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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 6.8K Apr 30 07:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 07:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 07:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 07:11 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.2K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 46K 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-13a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652633975732

Running Version 202205111006
[2022-05-15 16:59:36] [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:59:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:59:37] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2022-05-15 16:59:37] [INFO ] Transformed 133 places.
[2022-05-15 16:59:37] [INFO ] Transformed 183 transitions.
[2022-05-15 16:59:37] [INFO ] Found NUPN structural information;
[2022-05-15 16:59:37] [INFO ] Parsed PT model containing 133 places and 183 transitions in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 183/183 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 126 transition count 176
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 126 transition count 176
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 119 transition count 169
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 119 transition count 169
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 114 transition count 159
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 114 transition count 159
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 114 transition count 151
Applied a total of 46 rules in 52 ms. Remains 114 /133 variables (removed 19) and now considering 151/183 (removed 32) transitions.
// Phase 1: matrix 151 rows 114 cols
[2022-05-15 16:59:37] [INFO ] Computed 2 place invariants in 10 ms
[2022-05-15 16:59:37] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 151 rows 114 cols
[2022-05-15 16:59:37] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 16:59:37] [INFO ] State equation strengthened by 97 read => feed constraints.
[2022-05-15 16:59:37] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
// Phase 1: matrix 151 rows 114 cols
[2022-05-15 16:59:37] [INFO ] Computed 2 place invariants in 7 ms
[2022-05-15 16:59:37] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/133 places, 151/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/133 places, 151/183 transitions.
Support contains 29 out of 114 places after structural reductions.
[2022-05-15 16:59:37] [INFO ] Flatten gal took : 33 ms
[2022-05-15 16:59:37] [INFO ] Flatten gal took : 14 ms
[2022-05-15 16:59:37] [INFO ] Input system was already deterministic with 151 transitions.
Support contains 28 out of 114 places (down from 29) after GAL structural reductions.
Finished random walk after 1113 steps, including 7 resets, run visited all 29 properties in 98 ms. (steps per millisecond=11 )
Computed a total of 16 stabilizing places and 14 stable transitions
Graph (complete) has 337 edges and 114 vertex of which 108 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.11 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(G(p1))&&p0)))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 151/151 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 108 transition count 145
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 108 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 103 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 103 transition count 140
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 98 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 98 transition count 135
Applied a total of 32 rules in 13 ms. Remains 98 /114 variables (removed 16) and now considering 135/151 (removed 16) transitions.
// Phase 1: matrix 135 rows 98 cols
[2022-05-15 16:59:38] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:59:38] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 135 rows 98 cols
[2022-05-15 16:59:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:38] [INFO ] State equation strengthened by 92 read => feed constraints.
[2022-05-15 16:59:38] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 135 rows 98 cols
[2022-05-15 16:59:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:38] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/114 places, 135/151 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/114 places, 135/151 transitions.
Stuttering acceptance computed with spot in 276 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s23 1), p0:(AND (EQ s77 0) (OR (EQ s3 0) (EQ s97 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 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-01 finished in 539 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G(p0)))))'
Support contains 1 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 151/151 transitions.
Graph (complete) has 337 edges and 114 vertex of which 108 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 125 edges and 105 vertex of which 91 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Graph (trivial) has 102 edges and 91 vertex of which 52 / 91 are part of one of the 26 SCC in 2 ms
Free SCC test removed 26 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 65 transition count 118
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 55 place count 53 transition count 92
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 67 place count 41 transition count 68
Iterating global reduction 2 with 12 rules applied. Total rules applied 79 place count 41 transition count 68
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 30 transition count 46
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 30 transition count 46
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 112 place count 19 transition count 24
Iterating global reduction 2 with 11 rules applied. Total rules applied 123 place count 19 transition count 24
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 134 place count 8 transition count 13
Iterating global reduction 2 with 11 rules applied. Total rules applied 145 place count 8 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 7 transition count 12
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 5 transition count 8
Applied a total of 151 rules in 28 ms. Remains 5 /114 variables (removed 109) and now considering 8/151 (removed 143) transitions.
[2022-05-15 16:59:38] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-15 16:59:38] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 16:59:38] [INFO ] Implicit Places using invariants in 18 ms returned []
[2022-05-15 16:59:38] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-15 16:59:38] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:59:38] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-15 16:59:38] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:59:38] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-15 16:59:39] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:59:39] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/114 places, 8/151 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/114 places, 8/151 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 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 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-02 finished in 178 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((X(p2)||p1) U X(p3))))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 151/151 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 108 transition count 145
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 108 transition count 145
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 104 transition count 141
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 104 transition count 141
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 100 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 100 transition count 137
Applied a total of 28 rules in 16 ms. Remains 100 /114 variables (removed 14) and now considering 137/151 (removed 14) transitions.
// Phase 1: matrix 137 rows 100 cols
[2022-05-15 16:59:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:39] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 137 rows 100 cols
[2022-05-15 16:59:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:39] [INFO ] State equation strengthened by 93 read => feed constraints.
[2022-05-15 16:59:39] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
// Phase 1: matrix 137 rows 100 cols
[2022-05-15 16:59:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:39] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/114 places, 137/151 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/114 places, 137/151 transitions.
Stuttering acceptance computed with spot in 361 ms :[true, (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 0}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(EQ s60 1), p1:(OR (AND (NEQ s60 1) (EQ s39 1)) (EQ s39 1)), p2:(AND (EQ s18 1) (EQ s99 1)), p3:(EQ s39 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, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-03 finished in 608 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(X(p0))&&(X(X(!p1)) U p2)))))'
Support contains 5 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 151/151 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 107 transition count 144
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 107 transition count 144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 102 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 102 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 97 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 97 transition count 134
Applied a total of 34 rules in 11 ms. Remains 97 /114 variables (removed 17) and now considering 134/151 (removed 17) transitions.
// Phase 1: matrix 134 rows 97 cols
[2022-05-15 16:59:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:39] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 134 rows 97 cols
[2022-05-15 16:59:39] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:59:39] [INFO ] State equation strengthened by 92 read => feed constraints.
[2022-05-15 16:59:39] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
// Phase 1: matrix 134 rows 97 cols
[2022-05-15 16:59:39] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 16:59:39] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/114 places, 134/151 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/114 places, 134/151 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) p1), p1, true]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=true, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s89 1) (EQ s95 1)), p0:(AND (EQ s7 1) (EQ s95 1)), p1:(AND (EQ s74 1) (EQ s96 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3106 reset in 280 ms.
Stack based approach found an accepted trace after 99 steps with 4 reset with depth 22 and stack size 22 in 1 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-04 finished in 795 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 151/151 transitions.
Graph (complete) has 337 edges and 114 vertex of which 108 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 108 transition count 139
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 102 transition count 139
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 95 transition count 132
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 95 transition count 132
Applied a total of 27 rules in 22 ms. Remains 95 /114 variables (removed 19) and now considering 132/151 (removed 19) transitions.
// Phase 1: matrix 132 rows 95 cols
[2022-05-15 16:59:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:40] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 132 rows 95 cols
[2022-05-15 16:59:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:40] [INFO ] State equation strengthened by 92 read => feed constraints.
[2022-05-15 16:59:40] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [94]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 149 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/114 places, 132/151 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 69 transition count 107
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 57 transition count 83
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 57 transition count 83
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 84 place count 47 transition count 63
Iterating global reduction 0 with 10 rules applied. Total rules applied 94 place count 47 transition count 63
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 103 place count 38 transition count 54
Iterating global reduction 0 with 9 rules applied. Total rules applied 112 place count 38 transition count 54
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 121 place count 29 transition count 36
Iterating global reduction 0 with 9 rules applied. Total rules applied 130 place count 29 transition count 36
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 139 place count 20 transition count 27
Iterating global reduction 0 with 9 rules applied. Total rules applied 148 place count 20 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 20 transition count 27
Applied a total of 149 rules in 16 ms. Remains 20 /94 variables (removed 74) and now considering 27/132 (removed 105) transitions.
[2022-05-15 16:59:40] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 20 cols
[2022-05-15 16:59:40] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:59:40] [INFO ] Implicit Places using invariants in 20 ms returned []
[2022-05-15 16:59:40] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 20 cols
[2022-05-15 16:59:40] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:59:40] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-15 16:59:40] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/114 places, 27/151 transitions.
Finished structural reductions, in 2 iterations. Remains : 20/114 places, 27/151 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s15 1) (AND (EQ s7 1) (EQ s19 1))), p0:(AND (EQ s11 1) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-06 finished in 360 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(F(p1)))||p0))))'
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 151/151 transitions.
Graph (complete) has 337 edges and 114 vertex of which 109 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
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 109 transition count 140
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 103 transition count 140
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 97 transition count 134
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 97 transition count 134
Applied a total of 25 rules in 15 ms. Remains 97 /114 variables (removed 17) and now considering 134/151 (removed 17) transitions.
// Phase 1: matrix 134 rows 97 cols
[2022-05-15 16:59:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:40] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 134 rows 97 cols
[2022-05-15 16:59:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:40] [INFO ] State equation strengthened by 93 read => feed constraints.
[2022-05-15 16:59:40] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 148 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/114 places, 134/151 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 52 rules applied. Total rules applied 52 place count 70 transition count 108
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 59 transition count 86
Iterating global reduction 0 with 11 rules applied. Total rules applied 74 place count 59 transition count 86
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 85 place count 48 transition count 64
Iterating global reduction 0 with 11 rules applied. Total rules applied 96 place count 48 transition count 64
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 107 place count 37 transition count 53
Iterating global reduction 0 with 11 rules applied. Total rules applied 118 place count 37 transition count 53
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 129 place count 26 transition count 31
Iterating global reduction 0 with 11 rules applied. Total rules applied 140 place count 26 transition count 31
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 151 place count 15 transition count 20
Iterating global reduction 0 with 11 rules applied. Total rules applied 162 place count 15 transition count 20
Applied a total of 162 rules in 13 ms. Remains 15 /96 variables (removed 81) and now considering 20/134 (removed 114) transitions.
[2022-05-15 16:59:41] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2022-05-15 16:59:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:59:41] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-15 16:59:41] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2022-05-15 16:59:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:59:41] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-15 16:59:41] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/114 places, 20/151 transitions.
Finished structural reductions, in 2 iterations. Remains : 15/114 places, 20/151 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s7 1) (EQ s10 0) (EQ s14 0)), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-08 finished in 297 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F((G(p0)||p1))||G(p2)))))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 151/151 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 108 transition count 145
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 108 transition count 145
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 104 transition count 141
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 104 transition count 141
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 100 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 100 transition count 137
Applied a total of 28 rules in 7 ms. Remains 100 /114 variables (removed 14) and now considering 137/151 (removed 14) transitions.
// Phase 1: matrix 137 rows 100 cols
[2022-05-15 16:59:41] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:59:41] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 137 rows 100 cols
[2022-05-15 16:59:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:41] [INFO ] State equation strengthened by 93 read => feed constraints.
[2022-05-15 16:59:41] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 139 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/114 places, 137/151 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 99/114 places, 137/151 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(OR (EQ s28 0) (EQ s98 0)), p1:(EQ s39 0), p2:(EQ s79 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 310 ms.
Product exploration explored 100000 steps with 50000 reset in 272 ms.
Computed a total of 15 stabilizing places and 14 stable transitions
Graph (complete) has 270 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 15 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 (NOT p2))
Knowledge based reduction with 9 factoid took 252 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-09 finished in 1065 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(!(X(p0) U p1)))))&&F(p0)))'
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 151/151 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 108 transition count 145
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 108 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 103 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 103 transition count 140
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 98 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 98 transition count 135
Applied a total of 32 rules in 4 ms. Remains 98 /114 variables (removed 16) and now considering 135/151 (removed 16) transitions.
// Phase 1: matrix 135 rows 98 cols
[2022-05-15 16:59:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:42] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 135 rows 98 cols
[2022-05-15 16:59:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:42] [INFO ] State equation strengthened by 92 read => feed constraints.
[2022-05-15 16:59:42] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 135 rows 98 cols
[2022-05-15 16:59:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:42] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/114 places, 135/151 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/114 places, 135/151 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1, p1, p1, true, (AND p0 p1)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 6}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s53 1) (EQ s97 1)), p1:(EQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-10 finished in 465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U (p1 U p2))&&(X(X(p4))||p3))))'
Support contains 5 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 151/151 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 108 transition count 145
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 108 transition count 145
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 104 transition count 141
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 104 transition count 141
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 100 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 100 transition count 137
Applied a total of 28 rules in 9 ms. Remains 100 /114 variables (removed 14) and now considering 137/151 (removed 14) transitions.
// Phase 1: matrix 137 rows 100 cols
[2022-05-15 16:59:42] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:59:42] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 137 rows 100 cols
[2022-05-15 16:59:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:42] [INFO ] State equation strengthened by 93 read => feed constraints.
[2022-05-15 16:59:42] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 134 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/114 places, 137/151 transitions.
Applied a total of 0 rules in 7 ms. Remains 99 /99 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 99/114 places, 137/151 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR p2 (AND (NOT p3) (NOT p4))), (OR p2 (AND (NOT p3) (NOT p4))), true, p2, p2, (NOT p4), (NOT p4)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p4), acceptance={} source=6 dest: 2}]], initial=0, aps=[p2:(AND (EQ s50 1) (EQ s98 1)), p0:(AND (EQ s27 1) (EQ s98 1)), p1:(EQ s65 1), p3:(OR (EQ s27 0) (EQ s98 0)), p4:(EQ s32 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 227 ms.
Product exploration explored 100000 steps with 50000 reset in 237 ms.
Computed a total of 15 stabilizing places and 14 stable transitions
Graph (complete) has 270 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 15 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) p3 p4), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 (NOT p2))))
Knowledge based reduction with 10 factoid took 209 ms. Reduced automaton from 7 states, 13 edges and 5 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-11 finished in 1107 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 151/151 transitions.
Graph (complete) has 337 edges and 114 vertex of which 108 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 108 transition count 139
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 102 transition count 139
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 95 transition count 132
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 95 transition count 132
Applied a total of 27 rules in 17 ms. Remains 95 /114 variables (removed 19) and now considering 132/151 (removed 19) transitions.
// Phase 1: matrix 132 rows 95 cols
[2022-05-15 16:59:43] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:59:43] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 132 rows 95 cols
[2022-05-15 16:59:43] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:59:43] [INFO ] State equation strengthened by 92 read => feed constraints.
[2022-05-15 16:59:43] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [94]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 137 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/114 places, 132/151 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 69 transition count 107
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 57 transition count 83
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 57 transition count 83
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 86 place count 45 transition count 59
Iterating global reduction 0 with 12 rules applied. Total rules applied 98 place count 45 transition count 59
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 110 place count 33 transition count 47
Iterating global reduction 0 with 12 rules applied. Total rules applied 122 place count 33 transition count 47
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 133 place count 22 transition count 25
Iterating global reduction 0 with 11 rules applied. Total rules applied 144 place count 22 transition count 25
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 155 place count 11 transition count 14
Iterating global reduction 0 with 11 rules applied. Total rules applied 166 place count 11 transition count 14
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 167 place count 11 transition count 14
Applied a total of 167 rules in 7 ms. Remains 11 /94 variables (removed 83) and now considering 14/132 (removed 118) transitions.
[2022-05-15 16:59:43] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2022-05-15 16:59:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:59:43] [INFO ] Implicit Places using invariants in 16 ms returned []
[2022-05-15 16:59:43] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2022-05-15 16:59:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:59:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-15 16:59:43] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/114 places, 14/151 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/114 places, 14/151 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-12 finished in 244 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 151/151 transitions.
Graph (complete) has 337 edges and 114 vertex of which 108 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 108 transition count 139
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 102 transition count 139
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 95 transition count 132
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 95 transition count 132
Applied a total of 27 rules in 11 ms. Remains 95 /114 variables (removed 19) and now considering 132/151 (removed 19) transitions.
// Phase 1: matrix 132 rows 95 cols
[2022-05-15 16:59:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:44] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 132 rows 95 cols
[2022-05-15 16:59:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:44] [INFO ] State equation strengthened by 92 read => feed constraints.
[2022-05-15 16:59:44] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [94]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 149 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/114 places, 132/151 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 69 transition count 107
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 57 transition count 83
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 57 transition count 83
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 86 place count 45 transition count 59
Iterating global reduction 0 with 12 rules applied. Total rules applied 98 place count 45 transition count 59
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 109 place count 34 transition count 48
Iterating global reduction 0 with 11 rules applied. Total rules applied 120 place count 34 transition count 48
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 131 place count 23 transition count 26
Iterating global reduction 0 with 11 rules applied. Total rules applied 142 place count 23 transition count 26
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 153 place count 12 transition count 15
Iterating global reduction 0 with 11 rules applied. Total rules applied 164 place count 12 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 165 place count 12 transition count 15
Applied a total of 165 rules in 11 ms. Remains 12 /94 variables (removed 82) and now considering 15/132 (removed 117) transitions.
[2022-05-15 16:59:44] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 12 cols
[2022-05-15 16:59:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:59:44] [INFO ] Implicit Places using invariants in 18 ms returned []
[2022-05-15 16:59:44] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 12 cols
[2022-05-15 16:59:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:59:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-15 16:59:44] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/114 places, 15/151 transitions.
Finished structural reductions, in 2 iterations. Remains : 12/114 places, 15/151 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-13 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:(OR (EQ s7 0) (EQ s11 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-13 finished in 302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U X(p1)))))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 151/151 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 107 transition count 144
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 107 transition count 144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 102 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 102 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 97 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 97 transition count 134
Applied a total of 34 rules in 5 ms. Remains 97 /114 variables (removed 17) and now considering 134/151 (removed 17) transitions.
// Phase 1: matrix 134 rows 97 cols
[2022-05-15 16:59:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:59:44] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 134 rows 97 cols
[2022-05-15 16:59:44] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:59:44] [INFO ] State equation strengthened by 92 read => feed constraints.
[2022-05-15 16:59:44] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
// Phase 1: matrix 134 rows 97 cols
[2022-05-15 16:59:44] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:59:44] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/114 places, 134/151 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/114 places, 134/151 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s95 1)), p1:(AND (EQ s74 1) (EQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-14 finished in 481 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(G(p0))&&p1))))'
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 151/151 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 107 transition count 144
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 107 transition count 144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 102 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 102 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 97 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 97 transition count 134
Applied a total of 34 rules in 6 ms. Remains 97 /114 variables (removed 17) and now considering 134/151 (removed 17) transitions.
// Phase 1: matrix 134 rows 97 cols
[2022-05-15 16:59:44] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:59:44] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 134 rows 97 cols
[2022-05-15 16:59:44] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:59:44] [INFO ] State equation strengthened by 92 read => feed constraints.
[2022-05-15 16:59:44] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 134 rows 97 cols
[2022-05-15 16:59:44] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:59:44] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/114 places, 134/151 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/114 places, 134/151 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s4 0) (EQ s96 0)), p1:(EQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-15 finished in 297 ms.
All properties solved by simple procedures.
Total runtime 8221 ms.

BK_STOP 1652633985175

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

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