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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 9.1K Apr 30 07:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 30 07:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 30 07:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 07:04 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.4K May 9 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 39K 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-11a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652631956707

Running Version 202205111006
[2022-05-15 16:25:57] [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:25:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:25:58] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2022-05-15 16:25:58] [INFO ] Transformed 113 places.
[2022-05-15 16:25:58] [INFO ] Transformed 155 transitions.
[2022-05-15 16:25:58] [INFO ] Found NUPN structural information;
[2022-05-15 16:25:58] [INFO ] Parsed PT model containing 113 places and 155 transitions in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 155/155 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 106 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 106 transition count 148
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 100 transition count 142
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 100 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 98 transition count 138
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 98 transition count 138
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 39 place count 98 transition count 129
Applied a total of 39 rules in 36 ms. Remains 98 /113 variables (removed 15) and now considering 129/155 (removed 26) transitions.
// Phase 1: matrix 129 rows 98 cols
[2022-05-15 16:25:58] [INFO ] Computed 2 place invariants in 10 ms
[2022-05-15 16:25:58] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 129 rows 98 cols
[2022-05-15 16:25:58] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-15 16:25:58] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-05-15 16:25:58] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 98 cols
[2022-05-15 16:25:58] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 16:25:58] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/113 places, 129/155 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/113 places, 129/155 transitions.
Support contains 28 out of 98 places after structural reductions.
[2022-05-15 16:25:58] [INFO ] Flatten gal took : 29 ms
[2022-05-15 16:25:58] [INFO ] Flatten gal took : 12 ms
[2022-05-15 16:25:58] [INFO ] Input system was already deterministic with 129 transitions.
Support contains 27 out of 98 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 31) seen :30
Finished Best-First random walk after 963 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=240 )
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 289 edges and 98 vertex of which 94 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(!(F(G(F(p0))) U !F(X(!p1))))))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 87 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 87 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 84 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 84 transition count 115
Applied a total of 28 rules in 12 ms. Remains 84 /98 variables (removed 14) and now considering 115/129 (removed 14) transitions.
// Phase 1: matrix 115 rows 84 cols
[2022-05-15 16:25:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:25:59] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 115 rows 84 cols
[2022-05-15 16:25:59] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:25:59] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-15 16:25:59] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
// Phase 1: matrix 115 rows 84 cols
[2022-05-15 16:25:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:25:59] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/98 places, 115/129 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/98 places, 115/129 transitions.
Stuttering acceptance computed with spot in 1794 ms :[p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s60 1) (EQ s83 1)), p0:(EQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 849 reset in 409 ms.
Product exploration explored 100000 steps with 854 reset in 223 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 264 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 84 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 115 rows 84 cols
[2022-05-15 16:26:02] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:26:02] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 16:26:02] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND p0 p1)))
Knowledge based reduction with 6 factoid took 156 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-01 finished in 3698 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)&&p1))))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 129/129 transitions.
Graph (complete) has 289 edges and 98 vertex of which 94 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 94 transition count 120
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 89 transition count 120
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 19 place count 81 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 27 place count 81 transition count 112
Applied a total of 27 rules in 23 ms. Remains 81 /98 variables (removed 17) and now considering 112/129 (removed 17) transitions.
// Phase 1: matrix 112 rows 81 cols
[2022-05-15 16:26:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:26:03] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 112 rows 81 cols
[2022-05-15 16:26:03] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 16:26:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-15 16:26:03] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2022-05-15 16:26:03] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 112 rows 81 cols
[2022-05-15 16:26:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:26:03] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/98 places, 112/129 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/98 places, 112/129 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s9 0) (EQ s80 0)), p0:(OR (EQ s57 0) (EQ s79 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4482 reset in 331 ms.
Stack based approach found an accepted trace after 33 steps with 2 reset with depth 5 and stack size 5 in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-02 finished in 636 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1)))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 90 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 90 transition count 121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 86 transition count 117
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 86 transition count 117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 83 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 83 transition count 114
Applied a total of 30 rules in 9 ms. Remains 83 /98 variables (removed 15) and now considering 114/129 (removed 15) transitions.
// Phase 1: matrix 114 rows 83 cols
[2022-05-15 16:26:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:26:03] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 114 rows 83 cols
[2022-05-15 16:26:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:26:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-15 16:26:03] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 114 rows 83 cols
[2022-05-15 16:26:03] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:26:03] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 83/98 places, 114/129 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/98 places, 114/129 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(OR (EQ s43 0) (EQ s82 0)), p1:(OR (EQ s64 0) (EQ s82 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-03 finished in 337 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 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 129/129 transitions.
Graph (complete) has 289 edges and 98 vertex of which 95 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 109 edges and 92 vertex of which 80 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Graph (trivial) has 90 edges and 80 vertex of which 44 / 80 are part of one of the 22 SCC in 1 ms
Free SCC test removed 22 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 58 transition count 101
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 51 place count 46 transition count 79
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 60 place count 37 transition count 61
Iterating global reduction 2 with 9 rules applied. Total rules applied 69 place count 37 transition count 61
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 78 place count 28 transition count 43
Iterating global reduction 2 with 9 rules applied. Total rules applied 87 place count 28 transition count 43
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 96 place count 19 transition count 25
Iterating global reduction 2 with 9 rules applied. Total rules applied 105 place count 19 transition count 25
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 114 place count 10 transition count 16
Iterating global reduction 2 with 9 rules applied. Total rules applied 123 place count 10 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 6 transition count 11
Applied a total of 130 rules in 11 ms. Remains 6 /98 variables (removed 92) and now considering 11/129 (removed 118) transitions.
[2022-05-15 16:26:03] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 16:26:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:26:03] [INFO ] Implicit Places using invariants in 15 ms returned []
[2022-05-15 16:26:03] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 16:26:03] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 16:26:04] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-15 16:26:04] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:26:04] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 16:26:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:26:04] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/98 places, 11/129 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/98 places, 11/129 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-05 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 s2 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 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-05 finished in 161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(X(F(X(G(X((X(p2)&&p1)))))))))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 122
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 88 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 88 transition count 119
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 85 transition count 116
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 85 transition count 116
Applied a total of 26 rules in 12 ms. Remains 85 /98 variables (removed 13) and now considering 116/129 (removed 13) transitions.
// Phase 1: matrix 116 rows 85 cols
[2022-05-15 16:26:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:26:04] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 116 rows 85 cols
[2022-05-15 16:26:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:26:04] [INFO ] State equation strengthened by 79 read => feed constraints.
[2022-05-15 16:26:04] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 163 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/98 places, 116/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 84/98 places, 116/129 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s18 0), p1:(AND (EQ s46 1) (EQ s83 1)), p2:(AND (EQ s42 1) (EQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Product exploration explored 100000 steps with 50000 reset in 217 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 229 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND p1 p2)))), (X (X (OR (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-06 finished in 883 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||p1))||G(p1)||F(p2)))'
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 87 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 87 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 85 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 85 transition count 116
Applied a total of 26 rules in 8 ms. Remains 85 /98 variables (removed 13) and now considering 116/129 (removed 13) transitions.
// Phase 1: matrix 116 rows 85 cols
[2022-05-15 16:26:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:26:05] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 116 rows 85 cols
[2022-05-15 16:26:05] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:26:05] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-15 16:26:05] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 85 cols
[2022-05-15 16:26:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:26:05] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/98 places, 116/129 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/98 places, 116/129 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s84 1)), p2:(AND (EQ s33 1) (EQ s84 1)), p0:(AND (EQ s65 1) (EQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 176 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-08 finished in 382 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U G(!(X(F(p1))||p2))))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 87 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 87 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 84 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 84 transition count 115
Applied a total of 28 rules in 8 ms. Remains 84 /98 variables (removed 14) and now considering 115/129 (removed 14) transitions.
// Phase 1: matrix 115 rows 84 cols
[2022-05-15 16:26:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:26:05] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 115 rows 84 cols
[2022-05-15 16:26:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:26:05] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-15 16:26:05] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 115 rows 84 cols
[2022-05-15 16:26:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:26:05] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/98 places, 115/129 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/98 places, 115/129 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s77 1) (EQ s25 1) (EQ s83 1)), p2:(AND (EQ s25 1) (EQ s83 1)), p1:(EQ s77 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1778 reset in 160 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-09 finished in 420 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (!F(p0)&&G(X(p1)))))'
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 92 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 92 transition count 123
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 90 transition count 121
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 90 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 89 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 89 transition count 120
Applied a total of 18 rules in 6 ms. Remains 89 /98 variables (removed 9) and now considering 120/129 (removed 9) transitions.
// Phase 1: matrix 120 rows 89 cols
[2022-05-15 16:26:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:26:05] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 120 rows 89 cols
[2022-05-15 16:26:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:26:05] [INFO ] State equation strengthened by 80 read => feed constraints.
[2022-05-15 16:26:05] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 137 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/98 places, 120/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 88/98 places, 120/129 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s77 1), p1:(EQ s67 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-10 finished in 252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!(p0 U p1)&&(X(X(p2))||p3)))))'
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 90 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 90 transition count 121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 86 transition count 117
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 86 transition count 117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 83 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 83 transition count 114
Applied a total of 30 rules in 5 ms. Remains 83 /98 variables (removed 15) and now considering 114/129 (removed 15) transitions.
// Phase 1: matrix 114 rows 83 cols
[2022-05-15 16:26:06] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:26:06] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 114 rows 83 cols
[2022-05-15 16:26:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:26:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-15 16:26:06] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 114 rows 83 cols
[2022-05-15 16:26:06] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:26:06] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 83/98 places, 114/129 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/98 places, 114/129 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, p1, (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s82 1)), p0:(AND (EQ s6 1) (EQ s81 1)), p3:(EQ s74 0), p2:(OR (AND (EQ s64 1) (EQ s82 1)) (AND (EQ s11 1) (EQ s82 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 162 ms.
Product exploration explored 100000 steps with 33333 reset in 179 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 262 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 14 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 7 states, 10 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-11 finished in 880 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 90 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 90 transition count 121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 86 transition count 117
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 86 transition count 117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 83 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 83 transition count 114
Applied a total of 30 rules in 8 ms. Remains 83 /98 variables (removed 15) and now considering 114/129 (removed 15) transitions.
// Phase 1: matrix 114 rows 83 cols
[2022-05-15 16:26:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:26:06] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 114 rows 83 cols
[2022-05-15 16:26:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:26:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-15 16:26:07] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 131 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/98 places, 114/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 82/98 places, 114/129 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-12 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 s20 1), p1:(EQ s20 0)], 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]]
Product exploration explored 100000 steps with 3264 reset in 141 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-12 finished in 429 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0) U (F(p1)&&X(p2)))))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 87 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 87 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 84 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 84 transition count 115
Applied a total of 28 rules in 5 ms. Remains 84 /98 variables (removed 14) and now considering 115/129 (removed 14) transitions.
// Phase 1: matrix 115 rows 84 cols
[2022-05-15 16:26:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:26:07] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 115 rows 84 cols
[2022-05-15 16:26:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:26:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-15 16:26:07] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 115 rows 84 cols
[2022-05-15 16:26:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:26:07] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/98 places, 115/129 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/98 places, 115/129 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s83 1) (EQ s67 1) (EQ s82 1)), p2:(AND (EQ s11 1) (EQ s83 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 122 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-13 finished in 296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 129/129 transitions.
Graph (complete) has 289 edges and 98 vertex of which 94 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 94 transition count 120
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 89 transition count 120
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 19 place count 81 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 27 place count 81 transition count 112
Applied a total of 27 rules in 18 ms. Remains 81 /98 variables (removed 17) and now considering 112/129 (removed 17) transitions.
// Phase 1: matrix 112 rows 81 cols
[2022-05-15 16:26:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:26:07] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 112 rows 81 cols
[2022-05-15 16:26:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:26:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-15 16:26:07] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 127 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/98 places, 112/129 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 59 transition count 91
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 50 transition count 73
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 50 transition count 73
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 42 transition count 57
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 42 transition count 57
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 34 transition count 49
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 34 transition count 49
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 100 place count 26 transition count 33
Iterating global reduction 0 with 8 rules applied. Total rules applied 108 place count 26 transition count 33
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 116 place count 18 transition count 25
Iterating global reduction 0 with 8 rules applied. Total rules applied 124 place count 18 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 125 place count 18 transition count 25
Applied a total of 125 rules in 12 ms. Remains 18 /80 variables (removed 62) and now considering 25/112 (removed 87) transitions.
[2022-05-15 16:26:07] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 18 cols
[2022-05-15 16:26:07] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:26:07] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-15 16:26:07] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 18 cols
[2022-05-15 16:26:07] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:26:07] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-15 16:26:07] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/98 places, 25/129 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/98 places, 25/129 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s17 1) (EQ s7 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 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-14 finished in 245 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&F(p1)))&&X((p2 U p3))))'
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 122
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 88 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 88 transition count 119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 86 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 86 transition count 117
Applied a total of 24 rules in 7 ms. Remains 86 /98 variables (removed 12) and now considering 117/129 (removed 12) transitions.
// Phase 1: matrix 117 rows 86 cols
[2022-05-15 16:26:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:26:07] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 117 rows 86 cols
[2022-05-15 16:26:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:26:08] [INFO ] State equation strengthened by 79 read => feed constraints.
[2022-05-15 16:26:08] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 145 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/98 places, 117/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 85/98 places, 117/129 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (NOT p1), (NOT p3), true]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s56 0) (EQ s84 0)), p1:(EQ s67 1), p3:(AND (EQ s26 1) (EQ s84 1)), p2:(AND (EQ s59 1) (EQ s84 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-15 finished in 349 ms.
All properties solved by simple procedures.
Total runtime 10438 ms.

BK_STOP 1652631968338

--------------------
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-11a"
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-11a, 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-165260109800084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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