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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 6.2K Apr 30 07:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 30 07:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 06:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 06:59 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.5K May 9 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K 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 32K 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-09a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652629284740

Running Version 202205111006
[2022-05-15 15:41:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 15:41:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:41:26] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2022-05-15 15:41:26] [INFO ] Transformed 93 places.
[2022-05-15 15:41:26] [INFO ] Transformed 127 transitions.
[2022-05-15 15:41:26] [INFO ] Found NUPN structural information;
[2022-05-15 15:41:26] [INFO ] Parsed PT model containing 93 places and 127 transitions in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 89 transition count 123
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 89 transition count 123
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 86 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 86 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 84 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 84 transition count 116
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 25 place count 84 transition count 109
Applied a total of 25 rules in 22 ms. Remains 84 /93 variables (removed 9) and now considering 109/127 (removed 18) transitions.
// Phase 1: matrix 109 rows 84 cols
[2022-05-15 15:41:26] [INFO ] Computed 2 place invariants in 9 ms
[2022-05-15 15:41:26] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 109 rows 84 cols
[2022-05-15 15:41:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:26] [INFO ] State equation strengthened by 69 read => feed constraints.
[2022-05-15 15:41:26] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 306 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/93 places, 109/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 83/93 places, 109/127 transitions.
Support contains 30 out of 83 places after structural reductions.
[2022-05-15 15:41:26] [INFO ] Flatten gal took : 28 ms
[2022-05-15 15:41:26] [INFO ] Flatten gal took : 12 ms
[2022-05-15 15:41:26] [INFO ] Input system was already deterministic with 109 transitions.
Support contains 28 out of 83 places (down from 30) after GAL structural reductions.
Finished random walk after 376 steps, including 3 resets, run visited all 21 properties in 50 ms. (steps per millisecond=7 )
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 83 vertex of which 78 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||X(p1)||G(p2)))'
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 109/109 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 80 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 80 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 78 transition count 104
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 78 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 77 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 77 transition count 103
Applied a total of 12 rules in 10 ms. Remains 77 /83 variables (removed 6) and now considering 103/109 (removed 6) transitions.
// Phase 1: matrix 103 rows 77 cols
[2022-05-15 15:41:27] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:41:27] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 103 rows 77 cols
[2022-05-15 15:41:27] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-15 15:41:27] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-15 15:41:27] [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 103 rows 77 cols
[2022-05-15 15:41:27] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:41:27] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 77/83 places, 103/109 transitions.
Finished structural reductions, in 1 iterations. Remains : 77/83 places, 103/109 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s33 0) (EQ s13 1)), p1:(AND (EQ s35 0) (EQ s25 1)), p2:(OR (EQ s34 0) (EQ s59 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]]
Stuttering criterion allowed to conclude after 109 steps with 1 reset in 6 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-01 finished in 534 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 109/109 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 72 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 72 transition count 98
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 68 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 68 transition count 94
Applied a total of 30 rules in 10 ms. Remains 68 /83 variables (removed 15) and now considering 94/109 (removed 15) transitions.
// Phase 1: matrix 94 rows 68 cols
[2022-05-15 15:41:27] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 15:41:27] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 94 rows 68 cols
[2022-05-15 15:41:27] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:41:27] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-05-15 15:41:27] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 68 cols
[2022-05-15 15:41:27] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:41:27] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/83 places, 94/109 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/83 places, 94/109 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s21 0) (EQ s32 1)), p1:(AND (EQ s32 0) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-02 finished in 326 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U X((F(X(p1))||!p2))))'
Support contains 5 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 109/109 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 72 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 72 transition count 98
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 68 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 68 transition count 94
Applied a total of 30 rules in 11 ms. Remains 68 /83 variables (removed 15) and now considering 94/109 (removed 15) transitions.
// Phase 1: matrix 94 rows 68 cols
[2022-05-15 15:41:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:41:27] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 94 rows 68 cols
[2022-05-15 15:41:27] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:41:27] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-05-15 15:41:27] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 68 cols
[2022-05-15 15:41:27] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 15:41:28] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/83 places, 94/109 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/83 places, 94/109 transitions.
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p2 p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s29 0) (EQ s54 1)), p0:(OR (EQ s19 0) (EQ s55 1)), p1:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 540 steps with 95 reset in 8 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-04 finished in 431 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U !p1)||G(p2)))'
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 109/109 transitions.
Graph (complete) has 206 edges and 83 vertex of which 79 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
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 89 edges and 77 vertex of which 66 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Graph (trivial) has 61 edges and 66 vertex of which 28 / 66 are part of one of the 14 SCC in 2 ms
Free SCC test removed 14 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 52 transition count 85
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 35 place count 44 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 43 transition count 70
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 42 place count 37 transition count 58
Iterating global reduction 3 with 6 rules applied. Total rules applied 48 place count 37 transition count 58
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 54 place count 31 transition count 46
Iterating global reduction 3 with 6 rules applied. Total rules applied 60 place count 31 transition count 46
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 64 place count 27 transition count 38
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 27 transition count 38
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 23 transition count 34
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 23 transition count 34
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 3 with 4 rules applied. Total rules applied 80 place count 21 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 20 transition count 33
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 20 transition count 30
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 88 place count 20 transition count 30
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 90 place count 18 transition count 28
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 18 transition count 28
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 15 transition count 25
Applied a total of 95 rules in 24 ms. Remains 15 /83 variables (removed 68) and now considering 25/109 (removed 84) transitions.
[2022-05-15 15:41:28] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 15 cols
[2022-05-15 15:41:28] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:41:28] [INFO ] Implicit Places using invariants in 14 ms returned []
[2022-05-15 15:41:28] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 15 cols
[2022-05-15 15:41:28] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:41:28] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-15 15:41:28] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 15:41:28] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 15 cols
[2022-05-15 15:41:28] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:41:28] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/83 places, 25/109 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/83 places, 25/109 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, p1, (NOT p2), (AND p1 (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(OR (EQ s2 0) (EQ s7 1)), p0:(OR (EQ s4 0) (EQ s10 1)), p2:(OR (EQ s8 0) (EQ s14 1))], 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, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 128 steps with 3 reset in 2 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-06 finished in 252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G((G(p1)||p0)))))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 109/109 transitions.
Graph (complete) has 206 edges and 83 vertex of which 78 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 88 edges and 76 vertex of which 64 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Graph (trivial) has 69 edges and 64 vertex of which 34 / 64 are part of one of the 17 SCC in 1 ms
Free SCC test removed 17 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 47 transition count 82
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 39 place count 38 transition count 65
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 46 place count 31 transition count 51
Iterating global reduction 2 with 7 rules applied. Total rules applied 53 place count 31 transition count 51
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 60 place count 24 transition count 37
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 24 transition count 37
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 73 place count 18 transition count 25
Iterating global reduction 2 with 6 rules applied. Total rules applied 79 place count 18 transition count 25
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 85 place count 12 transition count 19
Iterating global reduction 2 with 6 rules applied. Total rules applied 91 place count 12 transition count 19
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 2 with 2 rules applied. Total rules applied 93 place count 11 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 10 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 10 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 10 transition count 16
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 9 transition count 15
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 9 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 7 transition count 13
Applied a total of 102 rules in 24 ms. Remains 7 /83 variables (removed 76) and now considering 13/109 (removed 96) transitions.
[2022-05-15 15:41:28] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 7 cols
[2022-05-15 15:41:28] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:41:28] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-15 15:41:28] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 7 cols
[2022-05-15 15:41:28] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:41:28] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-15 15:41:28] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:41:28] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 7 cols
[2022-05-15 15:41:28] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:41:28] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/83 places, 13/109 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/83 places, 13/109 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s4 0) (EQ s3 1)), p0:(OR (EQ s4 0) (EQ s3 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 38 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-08 finished in 146 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!F(!p0) U X(p0))&&X(F(G(X(p1))))))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 109/109 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 72 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 72 transition count 98
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 69 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 69 transition count 95
Applied a total of 28 rules in 7 ms. Remains 69 /83 variables (removed 14) and now considering 95/109 (removed 14) transitions.
// Phase 1: matrix 95 rows 69 cols
[2022-05-15 15:41:28] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:41:28] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 95 rows 69 cols
[2022-05-15 15:41:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:41:28] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-05-15 15:41:28] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 95 rows 69 cols
[2022-05-15 15:41:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:41:28] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/83 places, 95/109 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/83 places, 95/109 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s40 0) (EQ s32 1)), p1:(AND (EQ s32 0) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 114 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-10 finished in 284 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 109/109 transitions.
Graph (complete) has 206 edges and 83 vertex of which 78 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 88 edges and 76 vertex of which 64 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Graph (trivial) has 69 edges and 64 vertex of which 34 / 64 are part of one of the 17 SCC in 1 ms
Free SCC test removed 17 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 47 transition count 83
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 38 place count 39 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 38 transition count 65
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 46 place count 31 transition count 51
Iterating global reduction 3 with 7 rules applied. Total rules applied 53 place count 31 transition count 51
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 60 place count 24 transition count 37
Iterating global reduction 3 with 7 rules applied. Total rules applied 67 place count 24 transition count 37
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 73 place count 18 transition count 25
Iterating global reduction 3 with 6 rules applied. Total rules applied 79 place count 18 transition count 25
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 85 place count 12 transition count 19
Iterating global reduction 3 with 6 rules applied. Total rules applied 91 place count 12 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 11 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 10 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 10 transition count 16
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 100 place count 7 transition count 13
Applied a total of 100 rules in 11 ms. Remains 7 /83 variables (removed 76) and now considering 13/109 (removed 96) transitions.
[2022-05-15 15:41:29] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 7 cols
[2022-05-15 15:41:29] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:41:29] [INFO ] Implicit Places using invariants in 14 ms returned []
[2022-05-15 15:41:29] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 7 cols
[2022-05-15 15:41:29] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:41:29] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2022-05-15 15:41:29] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:41:29] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 7 cols
[2022-05-15 15:41:29] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:41:29] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/83 places, 13/109 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/83 places, 13/109 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s4 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 7 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-11 finished in 123 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X((!(X(G(X(X(p0)))) U X(p1))||p2))))))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 109/109 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 104
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 74 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 74 transition count 100
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 70 transition count 96
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 70 transition count 96
Applied a total of 26 rules in 6 ms. Remains 70 /83 variables (removed 13) and now considering 96/109 (removed 13) transitions.
// Phase 1: matrix 96 rows 70 cols
[2022-05-15 15:41:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:41:29] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 96 rows 70 cols
[2022-05-15 15:41:29] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-15 15:41:29] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-05-15 15:41:29] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 96 rows 70 cols
[2022-05-15 15:41:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:41:29] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/83 places, 96/109 transitions.
Finished structural reductions, in 1 iterations. Remains : 70/83 places, 96/109 transitions.
Stuttering acceptance computed with spot in 222 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0), (AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p2), acceptance={0, 1} source=0 dest: 1}], [{ cond=p1, acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={1} source=3 dest: 5}], [{ cond=(AND p2 (NOT p1) p0), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={0, 1} source=5 dest: 4}, { cond=p0, acceptance={1} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s11 0), p1:(EQ s11 1), p0:(EQ s20 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1082 reset in 195 ms.
Stack based approach found an accepted trace after 2018 steps with 21 reset with depth 92 and stack size 85 in 4 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-12 finished in 608 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 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 109/109 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 72 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 72 transition count 98
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 68 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 68 transition count 94
Applied a total of 30 rules in 6 ms. Remains 68 /83 variables (removed 15) and now considering 94/109 (removed 15) transitions.
// Phase 1: matrix 94 rows 68 cols
[2022-05-15 15:41:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:41:29] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 94 rows 68 cols
[2022-05-15 15:41:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:41:29] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-05-15 15:41:29] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 68 cols
[2022-05-15 15:41:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:41:29] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/83 places, 94/109 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/83 places, 94/109 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-14 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=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(OR (EQ s50 0) (EQ s49 1)), p1:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-14 finished in 277 ms.
All properties solved by simple procedures.
Total runtime 4108 ms.

BK_STOP 1652629290081

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-09a"
export BK_EXAMINATION="LTLCardinality"
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-09a, examination is LTLCardinality"
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-165260109800051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-09a.tgz
mv DiscoveryGPU-PT-09a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;