Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875200301.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DiscoveryGPU-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875200301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 17:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 36K May 5 16:51 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-10a-00
FORMULA_NAME DiscoveryGPU-PT-10a-01
FORMULA_NAME DiscoveryGPU-PT-10a-02
FORMULA_NAME DiscoveryGPU-PT-10a-03
FORMULA_NAME DiscoveryGPU-PT-10a-04
FORMULA_NAME DiscoveryGPU-PT-10a-05
FORMULA_NAME DiscoveryGPU-PT-10a-06
FORMULA_NAME DiscoveryGPU-PT-10a-07
FORMULA_NAME DiscoveryGPU-PT-10a-08
FORMULA_NAME DiscoveryGPU-PT-10a-09
FORMULA_NAME DiscoveryGPU-PT-10a-10
FORMULA_NAME DiscoveryGPU-PT-10a-11
FORMULA_NAME DiscoveryGPU-PT-10a-12
FORMULA_NAME DiscoveryGPU-PT-10a-13
FORMULA_NAME DiscoveryGPU-PT-10a-14
FORMULA_NAME DiscoveryGPU-PT-10a-15

=== Now, execution of the tool begins

BK_START 1620575375165

Running Version 0
[2021-05-09 15:49: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]
[2021-05-09 15:49:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:49:36] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-09 15:49:36] [INFO ] Transformed 103 places.
[2021-05-09 15:49:36] [INFO ] Transformed 141 transitions.
[2021-05-09 15:49:36] [INFO ] Found NUPN structural information;
[2021-05-09 15:49:36] [INFO ] Parsed PT model containing 103 places and 141 transitions in 82 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 15:49:36] [INFO ] Initial state test concluded for 2 properties.
FORMULA DiscoveryGPU-PT-10a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 134
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 134
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 91 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 91 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 88 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 88 transition count 123
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 37 place count 88 transition count 116
Applied a total of 37 rules in 27 ms. Remains 88 /103 variables (removed 15) and now considering 116/141 (removed 25) transitions.
// Phase 1: matrix 116 rows 88 cols
[2021-05-09 15:49:36] [INFO ] Computed 2 place invariants in 10 ms
[2021-05-09 15:49:36] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 116 rows 88 cols
[2021-05-09 15:49:37] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:49:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2021-05-09 15:49:37] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 88 cols
[2021-05-09 15:49:37] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 15:49:37] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/103 places, 116/141 transitions.
[2021-05-09 15:49:37] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 15:49:37] [INFO ] Flatten gal took : 30 ms
FORMULA DiscoveryGPU-PT-10a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 15:49:37] [INFO ] Flatten gal took : 11 ms
[2021-05-09 15:49:37] [INFO ] Input system was already deterministic with 116 transitions.
Finished random walk after 784 steps, including 6 resets, run visited all 26 properties in 11 ms. (steps per millisecond=71 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0)) U (G(p2)&&p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 116/116 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 88 transition count 111
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 83 transition count 111
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 16 place count 77 transition count 105
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 77 transition count 105
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 75 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 75 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 74 transition count 102
Applied a total of 28 rules in 29 ms. Remains 74 /88 variables (removed 14) and now considering 102/116 (removed 14) transitions.
// Phase 1: matrix 102 rows 74 cols
[2021-05-09 15:49:37] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:49:37] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 102 rows 74 cols
[2021-05-09 15:49:37] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 15:49:37] [INFO ] State equation strengthened by 71 read => feed constraints.
[2021-05-09 15:49:37] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2021-05-09 15:49:37] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 102 rows 74 cols
[2021-05-09 15:49:37] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:49:37] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 74/88 places, 102/116 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-10a-00 automaton TGBA [mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s55 1) (EQ s73 1)), p2:(EQ s2 1), p0:(OR (EQ s55 0) (EQ s73 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1028 reset in 257 ms.
Stack based approach found an accepted trace after 46 steps with 0 reset with depth 47 and stack size 46 in 1 ms.
FORMULA DiscoveryGPU-PT-10a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-00 finished in 732 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 116/116 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 88 transition count 112
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 84 transition count 112
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 13 place count 79 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 18 place count 79 transition count 107
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 77 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 77 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 75 transition count 103
Applied a total of 26 rules in 17 ms. Remains 75 /88 variables (removed 13) and now considering 103/116 (removed 13) transitions.
// Phase 1: matrix 103 rows 75 cols
[2021-05-09 15:49:38] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:49:38] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 103 rows 75 cols
[2021-05-09 15:49:38] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:49:38] [INFO ] State equation strengthened by 71 read => feed constraints.
[2021-05-09 15:49:38] [INFO ] Implicit Places using invariants and state equation in 76 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 104 ms to find 1 implicit places.
[2021-05-09 15:49:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 103 rows 74 cols
[2021-05-09 15:49:38] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-09 15:49:38] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 74/88 places, 103/116 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 56 transition count 85
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 48 transition count 69
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 48 transition count 69
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 40 transition count 53
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 40 transition count 53
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 75 place count 33 transition count 46
Iterating global reduction 0 with 7 rules applied. Total rules applied 82 place count 33 transition count 46
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 89 place count 26 transition count 32
Iterating global reduction 0 with 7 rules applied. Total rules applied 96 place count 26 transition count 32
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 19 transition count 25
Iterating global reduction 0 with 7 rules applied. Total rules applied 110 place count 19 transition count 25
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 19 transition count 25
Applied a total of 112 rules in 19 ms. Remains 19 /74 variables (removed 55) and now considering 25/103 (removed 78) transitions.
[2021-05-09 15:49:38] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 19 cols
[2021-05-09 15:49:38] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-09 15:49:38] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-09 15:49:38] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 19 cols
[2021-05-09 15:49:38] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:49:38] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-09 15:49:38] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 19/88 places, 25/116 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s14 1) (NEQ s18 1)), p1:(NEQ s2 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 25 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-01 finished in 331 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U p1)||X(F(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 116/116 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 83 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 83 transition count 111
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 80 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 80 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 79 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 79 transition count 107
Applied a total of 18 rules in 6 ms. Remains 79 /88 variables (removed 9) and now considering 107/116 (removed 9) transitions.
// Phase 1: matrix 107 rows 79 cols
[2021-05-09 15:49:38] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:49:38] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 107 rows 79 cols
[2021-05-09 15:49:38] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 15:49:38] [INFO ] State equation strengthened by 72 read => feed constraints.
[2021-05-09 15:49:38] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 79 cols
[2021-05-09 15:49:38] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-09 15:49:38] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/88 places, 107/116 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-10a-02 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s4 1), p2:(OR (EQ s67 1) (AND (EQ s36 1) (EQ s78 1))), p1:(EQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4175 reset in 216 ms.
Stack based approach found an accepted trace after 27 steps with 1 reset with depth 16 and stack size 16 in 0 ms.
FORMULA DiscoveryGPU-PT-10a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-02 finished in 466 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 116/116 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 98 edges and 85 vertex of which 40 / 85 are part of one of the 20 SCC in 3 ms
Free SCC test removed 20 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 65 transition count 95
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 63 place count 45 transition count 75
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 40 transition count 65
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 40 transition count 65
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 40 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 39 transition count 64
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 80 place count 34 transition count 54
Iterating global reduction 4 with 5 rules applied. Total rules applied 85 place count 34 transition count 54
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 90 place count 29 transition count 44
Iterating global reduction 4 with 5 rules applied. Total rules applied 95 place count 29 transition count 44
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 100 place count 24 transition count 38
Iterating global reduction 4 with 5 rules applied. Total rules applied 105 place count 24 transition count 38
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 106 place count 23 transition count 37
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 23 transition count 37
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 119 place count 17 transition count 31
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 121 place count 15 transition count 27
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 15 transition count 27
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 125 place count 13 transition count 21
Iterating global reduction 4 with 2 rules applied. Total rules applied 127 place count 13 transition count 21
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 129 place count 11 transition count 19
Iterating global reduction 4 with 2 rules applied. Total rules applied 131 place count 11 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 11 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 10 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 9 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 8 transition count 15
Applied a total of 135 rules in 19 ms. Remains 8 /88 variables (removed 80) and now considering 15/116 (removed 101) transitions.
[2021-05-09 15:49:39] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-09 15:49:39] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:49:39] [INFO ] Implicit Places using invariants in 10 ms returned []
[2021-05-09 15:49:39] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-09 15:49:39] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:49:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:49:39] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-09 15:49:39] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:49:39] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-09 15:49:39] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 15:49:39] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/88 places, 15/116 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2 1), p1:(EQ s5 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 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-03 finished in 146 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 82 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 82 transition count 110
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 78 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 78 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 76 transition count 104
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 76 transition count 104
Applied a total of 24 rules in 6 ms. Remains 76 /88 variables (removed 12) and now considering 104/116 (removed 12) transitions.
// Phase 1: matrix 104 rows 76 cols
[2021-05-09 15:49:39] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:49:39] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 104 rows 76 cols
[2021-05-09 15:49:39] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:49:39] [INFO ] State equation strengthened by 71 read => feed constraints.
[2021-05-09 15:49:39] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 103 ms to find 1 implicit places.
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:49:39] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:49:39] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 75/88 places, 104/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:49:39] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:49:39] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 75/88 places, 104/116 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-10a-05 automaton TGBA [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:(OR (NEQ s48 1) (NEQ s74 1)), p0:(OR (NEQ s36 1) (NEQ s48 1) (NEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 79 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-05 finished in 282 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 82 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 82 transition count 110
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 78 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 78 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 76 transition count 104
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 76 transition count 104
Applied a total of 24 rules in 4 ms. Remains 76 /88 variables (removed 12) and now considering 104/116 (removed 12) transitions.
// Phase 1: matrix 104 rows 76 cols
[2021-05-09 15:49:39] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:49:39] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 104 rows 76 cols
[2021-05-09 15:49:39] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 15:49:39] [INFO ] State equation strengthened by 71 read => feed constraints.
[2021-05-09 15:49:39] [INFO ] Implicit Places using invariants and state equation in 69 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 94 ms to find 1 implicit places.
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:49:39] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:49:39] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 75/88 places, 104/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:49:39] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:49:39] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 75/88 places, 104/116 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-10a-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s15 1), p1:(AND (EQ s20 1) (EQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4509 reset in 175 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA DiscoveryGPU-PT-10a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-06 finished in 411 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F((p0&&X(p0))))||(F((p0&&X(p0)))&&G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 116/116 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 83 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 83 transition count 111
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 80 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 80 transition count 108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 78 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 78 transition count 106
Applied a total of 20 rules in 3 ms. Remains 78 /88 variables (removed 10) and now considering 106/116 (removed 10) transitions.
// Phase 1: matrix 106 rows 78 cols
[2021-05-09 15:49:39] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:49:39] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 106 rows 78 cols
[2021-05-09 15:49:39] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:49:39] [INFO ] State equation strengthened by 72 read => feed constraints.
[2021-05-09 15:49:39] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 95 ms to find 1 implicit places.
// Phase 1: matrix 106 rows 77 cols
[2021-05-09 15:49:39] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-09 15:49:39] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 77/88 places, 106/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 77 cols
[2021-05-09 15:49:39] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:49:40] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 77/88 places, 106/116 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-10a-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s69 1), p1:(AND (OR (NEQ s53 1) (NEQ s76 1)) (NEQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3083 reset in 165 ms.
Stack based approach found an accepted trace after 60587 steps with 1977 reset with depth 50 and stack size 50 in 116 ms.
FORMULA DiscoveryGPU-PT-10a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-07 finished in 614 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 82 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 82 transition count 110
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 78 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 78 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 76 transition count 104
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 76 transition count 104
Applied a total of 24 rules in 2 ms. Remains 76 /88 variables (removed 12) and now considering 104/116 (removed 12) transitions.
// Phase 1: matrix 104 rows 76 cols
[2021-05-09 15:49:40] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:49:40] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 104 rows 76 cols
[2021-05-09 15:49:40] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:49:40] [INFO ] State equation strengthened by 71 read => feed constraints.
[2021-05-09 15:49:40] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 119 ms to find 1 implicit places.
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:49:40] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:49:40] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 75/88 places, 104/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:49:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:49:40] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 75/88 places, 104/116 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s29 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Graph (complete) has 206 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Product exploration explored 100000 steps with 50000 reset in 187 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 75 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 75/75 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 75 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 75 transition count 104
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 75 transition count 123
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 30 place count 66 transition count 105
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 39 place count 66 transition count 105
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 57 place count 48 transition count 69
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 75 place count 48 transition count 69
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 84 place count 39 transition count 60
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 93 place count 39 transition count 60
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 101 place count 31 transition count 44
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 109 place count 31 transition count 44
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 125 place count 15 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 141 place count 15 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 141 rules in 9 ms. Remains 15 /75 variables (removed 60) and now considering 20/104 (removed 84) transitions.
[2021-05-09 15:49:41] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:49:41] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 15 cols
[2021-05-09 15:49:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:49:41] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/75 places, 20/104 transitions.
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Product exploration explored 100000 steps with 50000 reset in 242 ms.
[2021-05-09 15:49:42] [INFO ] Flatten gal took : 7 ms
[2021-05-09 15:49:42] [INFO ] Flatten gal took : 14 ms
[2021-05-09 15:49:42] [INFO ] Time to serialize gal into /tmp/LTL3926238054198530404.gal : 3 ms
[2021-05-09 15:49:42] [INFO ] Time to serialize properties into /tmp/LTL12782479683589485641.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3926238054198530404.gal, -t, CGAL, -LTL, /tmp/LTL12782479683589485641.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3926238054198530404.gal -t CGAL -LTL /tmp/LTL12782479683589485641.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p38==0)"))))
Formula 0 simplified : !XF"(p38==0)"
Reverse transition relation is NOT exact ! Due to transitions t29, t31, t33, t35, t37, t39, t40, t42, t44, t46, t103, t105, t106, t107, t108, t109, t110, t112, t113, t114, t115, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/83/21/104
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
941 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.43148,243580,1,0,149,1.10497e+06,234,99,2329,1.48154e+06,221
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-10a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-10a-09 finished in 12334 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X((G(p1)&&F(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 82 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 82 transition count 110
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 78 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 78 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 77 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 77 transition count 105
Applied a total of 22 rules in 3 ms. Remains 77 /88 variables (removed 11) and now considering 105/116 (removed 11) transitions.
// Phase 1: matrix 105 rows 77 cols
[2021-05-09 15:49:52] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:49:52] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 105 rows 77 cols
[2021-05-09 15:49:52] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:49:52] [INFO ] State equation strengthened by 71 read => feed constraints.
[2021-05-09 15:49:52] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 89 ms to find 1 implicit places.
// Phase 1: matrix 105 rows 76 cols
[2021-05-09 15:49:52] [INFO ] Computed 1 place invariants in 9 ms
[2021-05-09 15:49:52] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 76/88 places, 105/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 76 cols
[2021-05-09 15:49:52] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:49:52] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 76/88 places, 105/116 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-10a-10 automaton TGBA [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=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s6 0), p1:(EQ s18 1), p2:(OR (NEQ s22 1) (NEQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-10 finished in 316 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 82 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 82 transition count 110
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 78 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 78 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 76 transition count 104
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 76 transition count 104
Applied a total of 24 rules in 3 ms. Remains 76 /88 variables (removed 12) and now considering 104/116 (removed 12) transitions.
// Phase 1: matrix 104 rows 76 cols
[2021-05-09 15:49:53] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:49:53] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 104 rows 76 cols
[2021-05-09 15:49:53] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:49:53] [INFO ] State equation strengthened by 71 read => feed constraints.
[2021-05-09 15:49:53] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 92 ms to find 1 implicit places.
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:49:53] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 15:49:53] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 75/88 places, 104/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:49:53] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:49:53] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 2 iterations. Remains : 75/88 places, 104/116 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s51 0) (EQ s74 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-11 finished in 288 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 82 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 82 transition count 110
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 78 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 78 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 76 transition count 104
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 76 transition count 104
Applied a total of 24 rules in 3 ms. Remains 76 /88 variables (removed 12) and now considering 104/116 (removed 12) transitions.
// Phase 1: matrix 104 rows 76 cols
[2021-05-09 15:49:53] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:49:53] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 104 rows 76 cols
[2021-05-09 15:49:53] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:49:53] [INFO ] State equation strengthened by 71 read => feed constraints.
[2021-05-09 15:49:53] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 76 cols
[2021-05-09 15:49:53] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:49:53] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 76/88 places, 104/116 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s60 1) (NEQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 204 ms.
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Graph (complete) has 239 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 76 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 76/76 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 76 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 76 transition count 104
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 6 ms. Remains 76 /76 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2021-05-09 15:49:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 104 rows 76 cols
[2021-05-09 15:49:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:49:54] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 104/104 transitions.
Product exploration explored 100000 steps with 50000 reset in 413 ms.
Product exploration explored 100000 steps with 50000 reset in 416 ms.
[2021-05-09 15:49:55] [INFO ] Flatten gal took : 6 ms
[2021-05-09 15:49:55] [INFO ] Flatten gal took : 5 ms
[2021-05-09 15:49:55] [INFO ] Time to serialize gal into /tmp/LTL12594471864234335633.gal : 2 ms
[2021-05-09 15:49:55] [INFO ] Time to serialize properties into /tmp/LTL8215166451922480251.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12594471864234335633.gal, -t, CGAL, -LTL, /tmp/LTL8215166451922480251.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12594471864234335633.gal -t CGAL -LTL /tmp/LTL8215166451922480251.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p84!=1)||(p102!=1))"))))
Formula 0 simplified : !XF"((p84!=1)||(p102!=1))"
Reverse transition relation is NOT exact ! Due to transitions t29, t31, t33, t35, t37, t39, t40, t42, t44, t46, t103, t105, t106, t107, t108, t109, t110, t112, t113, t114, t115, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/83/21/104
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
162 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.63426,55448,1,0,149,199214,234,99,2366,266549,221
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-10a-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-10a-12 finished in 3831 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 116/116 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 83 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 83 transition count 111
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 80 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 80 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 79 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 79 transition count 107
Applied a total of 18 rules in 4 ms. Remains 79 /88 variables (removed 9) and now considering 107/116 (removed 9) transitions.
// Phase 1: matrix 107 rows 79 cols
[2021-05-09 15:49:57] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:49:57] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 107 rows 79 cols
[2021-05-09 15:49:57] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:49:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2021-05-09 15:49:57] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 92 ms to find 1 implicit places.
// Phase 1: matrix 107 rows 78 cols
[2021-05-09 15:49:57] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:49:57] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 78/88 places, 107/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 78 cols
[2021-05-09 15:49:57] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:49:57] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 78/88 places, 107/116 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(NEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 334 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-13 finished in 274 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 116/116 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 88 transition count 111
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 83 transition count 111
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 16 place count 77 transition count 105
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 77 transition count 105
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 75 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 75 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 74 transition count 102
Applied a total of 28 rules in 9 ms. Remains 74 /88 variables (removed 14) and now considering 102/116 (removed 14) transitions.
// Phase 1: matrix 102 rows 74 cols
[2021-05-09 15:49:57] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:49:57] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 102 rows 74 cols
[2021-05-09 15:49:57] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:49:57] [INFO ] State equation strengthened by 71 read => feed constraints.
[2021-05-09 15:49:57] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2021-05-09 15:49:57] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 102 rows 74 cols
[2021-05-09 15:49:57] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:49:57] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 74/88 places, 102/116 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s63 1) (EQ s72 1) (OR (EQ s62 0) (EQ s73 0)))], 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 101 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-14 finished in 182 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p1)&&F(p2)&&p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 116/116 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 83 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 83 transition count 111
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 80 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 80 transition count 108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 78 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 78 transition count 106
Applied a total of 20 rules in 6 ms. Remains 78 /88 variables (removed 10) and now considering 106/116 (removed 10) transitions.
// Phase 1: matrix 106 rows 78 cols
[2021-05-09 15:49:57] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:49:57] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 106 rows 78 cols
[2021-05-09 15:49:57] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:49:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2021-05-09 15:49:57] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 90 ms to find 1 implicit places.
// Phase 1: matrix 106 rows 77 cols
[2021-05-09 15:49:57] [INFO ] Computed 1 place invariants in 7 ms
[2021-05-09 15:49:57] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Starting structural reductions, iteration 1 : 77/88 places, 106/116 transitions.
Applied a total of 0 rules in 0 ms. Remains 77 /77 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 77 cols
[2021-05-09 15:49:57] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:49:57] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 77/88 places, 106/116 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-10a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s25 1) (EQ s76 1)), p1:(EQ s18 1), p2:(AND (EQ s61 1) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-15 finished in 302 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620575398753

--------------------
content from stderr:

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-10a"
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-10a, 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 r083-tall-162048875200301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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