fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r083-tall-162048875300381
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for DiscoveryGPU-PT-15a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
328.884 9815.00 20897.00 87.20 FFFFFFFFFFFFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K 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.2K Mar 28 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 18:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:02 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 53K 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-15a-00
FORMULA_NAME DiscoveryGPU-PT-15a-01
FORMULA_NAME DiscoveryGPU-PT-15a-02
FORMULA_NAME DiscoveryGPU-PT-15a-03
FORMULA_NAME DiscoveryGPU-PT-15a-04
FORMULA_NAME DiscoveryGPU-PT-15a-05
FORMULA_NAME DiscoveryGPU-PT-15a-06
FORMULA_NAME DiscoveryGPU-PT-15a-07
FORMULA_NAME DiscoveryGPU-PT-15a-08
FORMULA_NAME DiscoveryGPU-PT-15a-09
FORMULA_NAME DiscoveryGPU-PT-15a-10
FORMULA_NAME DiscoveryGPU-PT-15a-11
FORMULA_NAME DiscoveryGPU-PT-15a-12
FORMULA_NAME DiscoveryGPU-PT-15a-13
FORMULA_NAME DiscoveryGPU-PT-15a-14
FORMULA_NAME DiscoveryGPU-PT-15a-15

=== Now, execution of the tool begins

BK_START 1620582391077

Running Version 0
[2021-05-09 17:46:32] [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 17:46:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 17:46:32] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-09 17:46:32] [INFO ] Transformed 153 places.
[2021-05-09 17:46:32] [INFO ] Transformed 211 transitions.
[2021-05-09 17:46:32] [INFO ] Found NUPN structural information;
[2021-05-09 17:46:32] [INFO ] Parsed PT model containing 153 places and 211 transitions in 92 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 17:46:32] [INFO ] Initial state test concluded for 4 properties.
FORMULA DiscoveryGPU-PT-15a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 211/211 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 140 transition count 198
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 140 transition count 198
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 38 place count 128 transition count 186
Iterating global reduction 0 with 12 rules applied. Total rules applied 50 place count 128 transition count 186
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 119 transition count 168
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 119 transition count 168
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 119 transition count 162
Applied a total of 74 rules in 35 ms. Remains 119 /153 variables (removed 34) and now considering 162/211 (removed 49) transitions.
// Phase 1: matrix 162 rows 119 cols
[2021-05-09 17:46:33] [INFO ] Computed 2 place invariants in 11 ms
[2021-05-09 17:46:33] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 162 rows 119 cols
[2021-05-09 17:46:33] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 17:46:33] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-09 17:46:33] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 119 cols
[2021-05-09 17:46:33] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:46:33] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 1 iterations. Remains : 119/153 places, 162/211 transitions.
[2021-05-09 17:46:33] [INFO ] Flatten gal took : 36 ms
[2021-05-09 17:46:33] [INFO ] Flatten gal took : 14 ms
[2021-05-09 17:46:33] [INFO ] Input system was already deterministic with 162 transitions.
Finished random walk after 4965 steps, including 30 resets, run visited all 28 properties in 33 ms. (steps per millisecond=150 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 112 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 112 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 111 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 111 transition count 154
Applied a total of 16 rules in 18 ms. Remains 111 /119 variables (removed 8) and now considering 154/162 (removed 8) transitions.
// Phase 1: matrix 154 rows 111 cols
[2021-05-09 17:46:33] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 17:46:33] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 154 rows 111 cols
[2021-05-09 17:46:33] [INFO ] Computed 2 place invariants in 12 ms
[2021-05-09 17:46:33] [INFO ] State equation strengthened by 106 read => feed constraints.
[2021-05-09 17:46:34] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 169 ms to find 1 implicit places.
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:46:34] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 17:46:34] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 110/119 places, 154/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:46:34] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:46:34] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 2 iterations. Remains : 110/119 places, 154/162 transitions.
Stuttering acceptance computed with spot in 198 ms :[(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-15a-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s46 1), p1:(AND (EQ s26 1) (EQ s109 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]]
Stuttering criterion allowed to conclude after 259 steps with 2 reset in 5 ms.
FORMULA DiscoveryGPU-PT-15a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-00 finished in 572 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U X((p1&&X((p2&&F(G(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 116 transition count 159
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 116 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 115 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 115 transition count 158
Applied a total of 8 rules in 6 ms. Remains 115 /119 variables (removed 4) and now considering 158/162 (removed 4) transitions.
// Phase 1: matrix 158 rows 115 cols
[2021-05-09 17:46:34] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:46:34] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 158 rows 115 cols
[2021-05-09 17:46:34] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:46:34] [INFO ] State equation strengthened by 107 read => feed constraints.
[2021-05-09 17:46:34] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [114]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 165 ms to find 1 implicit places.
// Phase 1: matrix 158 rows 114 cols
[2021-05-09 17:46:34] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-09 17:46:34] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Starting structural reductions, iteration 1 : 114/119 places, 158/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 114 /114 variables (removed 0) and now considering 158/158 (removed 0) transitions.
// Phase 1: matrix 158 rows 114 cols
[2021-05-09 17:46:34] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:46:34] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 2 iterations. Remains : 114/119 places, 158/162 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-15a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND p0 p2), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 4}, { cond=p2, acceptance={} source=7 dest: 5}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s103 1), p1:(OR (EQ s108 0) (EQ s113 0)), p2:(NEQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 629 reset in 283 ms.
Stack based approach found an accepted trace after 588 steps with 3 reset with depth 98 and stack size 97 in 2 ms.
FORMULA DiscoveryGPU-PT-15a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-01 finished in 868 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(((p1&&F(p2))||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 112 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 112 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 111 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 111 transition count 154
Applied a total of 16 rules in 8 ms. Remains 111 /119 variables (removed 8) and now considering 154/162 (removed 8) transitions.
// Phase 1: matrix 154 rows 111 cols
[2021-05-09 17:46:35] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:46:35] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 154 rows 111 cols
[2021-05-09 17:46:35] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:46:35] [INFO ] State equation strengthened by 106 read => feed constraints.
[2021-05-09 17:46:35] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 174 ms to find 1 implicit places.
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:46:35] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:46:35] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 110/119 places, 154/162 transitions.
Applied a total of 0 rules in 5 ms. Remains 110 /110 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:46:35] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:46:35] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 2 iterations. Remains : 110/119 places, 154/162 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15a-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(OR (NEQ s54 1) (NEQ s109 1)), p0:(EQ s22 1), p1:(OR (NEQ s84 1) (NEQ s109 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, null, null][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-15a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-02 finished in 473 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 162/162 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 119 transition count 159
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 116 transition count 159
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 111 transition count 154
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 111 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 110 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 110 transition count 153
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 20 place count 109 transition count 152
Applied a total of 20 rules in 24 ms. Remains 109 /119 variables (removed 10) and now considering 152/162 (removed 10) transitions.
// Phase 1: matrix 152 rows 109 cols
[2021-05-09 17:46:35] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:46:35] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 152 rows 109 cols
[2021-05-09 17:46:35] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 17:46:35] [INFO ] State equation strengthened by 106 read => feed constraints.
[2021-05-09 17:46:35] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 160 ms to find 1 implicit places.
[2021-05-09 17:46:35] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 152 rows 108 cols
[2021-05-09 17:46:35] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:46:35] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Starting structural reductions, iteration 1 : 108/119 places, 152/162 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 78 transition count 122
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 74 place count 64 transition count 94
Iterating global reduction 0 with 14 rules applied. Total rules applied 88 place count 64 transition count 94
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 102 place count 50 transition count 66
Iterating global reduction 0 with 14 rules applied. Total rules applied 116 place count 50 transition count 66
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 130 place count 36 transition count 52
Iterating global reduction 0 with 14 rules applied. Total rules applied 144 place count 36 transition count 52
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 158 place count 22 transition count 24
Iterating global reduction 0 with 14 rules applied. Total rules applied 172 place count 22 transition count 24
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 185 place count 9 transition count 11
Iterating global reduction 0 with 13 rules applied. Total rules applied 198 place count 9 transition count 11
Applied a total of 198 rules in 14 ms. Remains 9 /108 variables (removed 99) and now considering 11/152 (removed 141) transitions.
[2021-05-09 17:46:36] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 9 cols
[2021-05-09 17:46:36] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-09 17:46:36] [INFO ] Implicit Places using invariants in 41 ms returned []
[2021-05-09 17:46:36] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 9 cols
[2021-05-09 17:46:36] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:46:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 17:46:36] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/119 places, 11/162 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-03 automaton TGBA [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:(AND (EQ s6 1) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-03 finished in 403 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||(X(X(F(!p0)))&&p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 112 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 112 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 111 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 111 transition count 154
Applied a total of 16 rules in 6 ms. Remains 111 /119 variables (removed 8) and now considering 154/162 (removed 8) transitions.
// Phase 1: matrix 154 rows 111 cols
[2021-05-09 17:46:36] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:46:36] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 154 rows 111 cols
[2021-05-09 17:46:36] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:46:36] [INFO ] State equation strengthened by 106 read => feed constraints.
[2021-05-09 17:46:36] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 111 cols
[2021-05-09 17:46:36] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:46:36] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 111/119 places, 154/162 transitions.
Stuttering acceptance computed with spot in 143 ms :[p0, false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), true, p0]
Running random walk in product with property : DiscoveryGPU-PT-15a-04 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { 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) p1), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 0}]], initial=2, aps=[p0:(AND (EQ s60 1) (EQ s110 1)), p1:(AND (EQ s53 1) (EQ s110 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, 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-15a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-04 finished in 398 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((X(p0)||F(p1))&&(p0||X((p0||G(F(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 112 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 112 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 111 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 111 transition count 154
Applied a total of 16 rules in 4 ms. Remains 111 /119 variables (removed 8) and now considering 154/162 (removed 8) transitions.
// Phase 1: matrix 154 rows 111 cols
[2021-05-09 17:46:36] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:46:36] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 154 rows 111 cols
[2021-05-09 17:46:36] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:46:36] [INFO ] State equation strengthened by 106 read => feed constraints.
[2021-05-09 17:46:36] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 170 ms to find 1 implicit places.
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:46:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:46:36] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Starting structural reductions, iteration 1 : 110/119 places, 154/162 transitions.
Applied a total of 0 rules in 6 ms. Remains 110 /110 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:46:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:46:36] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 2 iterations. Remains : 110/119 places, 154/162 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false]
Running random walk in product with property : DiscoveryGPU-PT-15a-05 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={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s109 1)), p1:(AND (EQ s48 1) (EQ s109 1)), p2:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8332 reset in 280 ms.
Stack based approach found an accepted trace after 48 steps with 1 reset with depth 18 and stack size 18 in 1 ms.
FORMULA DiscoveryGPU-PT-15a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-05 finished in 847 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)&&G((p1&&(p2||F(p3))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 116 transition count 159
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 116 transition count 159
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 114 transition count 157
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 114 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 113 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 113 transition count 156
Applied a total of 12 rules in 5 ms. Remains 113 /119 variables (removed 6) and now considering 156/162 (removed 6) transitions.
// Phase 1: matrix 156 rows 113 cols
[2021-05-09 17:46:37] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:46:37] [INFO ] Implicit Places using invariants in 346 ms returned []
// Phase 1: matrix 156 rows 113 cols
[2021-05-09 17:46:37] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:46:37] [INFO ] State equation strengthened by 106 read => feed constraints.
[2021-05-09 17:46:37] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 113 cols
[2021-05-09 17:46:37] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:46:37] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 113/119 places, 156/162 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), true, (AND p1 (NOT p0)), (NOT p3), (OR (NOT p1) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : DiscoveryGPU-PT-15a-06 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s60 0), p2:(AND (NEQ s89 0) (NEQ s112 0)), p3:(EQ s60 1), p0:(NEQ s75 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]]
Stuttering criterion allowed to conclude after 277 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-06 finished in 652 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(F((p0||X(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 112 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 112 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 111 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 111 transition count 154
Applied a total of 16 rules in 4 ms. Remains 111 /119 variables (removed 8) and now considering 154/162 (removed 8) transitions.
// Phase 1: matrix 154 rows 111 cols
[2021-05-09 17:46:38] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:46:38] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 154 rows 111 cols
[2021-05-09 17:46:38] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 17:46:38] [INFO ] State equation strengthened by 106 read => feed constraints.
[2021-05-09 17:46:38] [INFO ] Implicit Places using invariants and state equation in 127 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 159 ms to find 1 implicit places.
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:46:38] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:46:38] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 110/119 places, 154/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:46:38] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:46:38] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 2 iterations. Remains : 110/119 places, 154/162 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15a-09 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s27 1), p1:(AND (EQ s98 1) (EQ s109 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][false, false, false]]
Product exploration explored 100000 steps with 1936 reset in 199 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA DiscoveryGPU-PT-15a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-09 finished in 555 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 162/162 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 141 edges and 116 vertex of which 58 / 116 are part of one of the 29 SCC in 42 ms
Free SCC test removed 29 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 87 transition count 139
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 77 place count 65 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 64 transition count 109
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 89 place count 53 transition count 87
Iterating global reduction 3 with 11 rules applied. Total rules applied 100 place count 53 transition count 87
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 101 place count 53 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 52 transition count 86
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 114 place count 40 transition count 62
Iterating global reduction 5 with 12 rules applied. Total rules applied 126 place count 40 transition count 62
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 127 place count 40 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 128 place count 39 transition count 61
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 140 place count 27 transition count 37
Iterating global reduction 7 with 12 rules applied. Total rules applied 152 place count 27 transition count 37
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 153 place count 27 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 154 place count 26 transition count 36
Discarding 13 places :
Symmetric choice reduction at 9 with 13 rule applications. Total rules 167 place count 13 transition count 20
Iterating global reduction 9 with 13 rules applied. Total rules applied 180 place count 13 transition count 20
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 183 place count 10 transition count 15
Iterating global reduction 9 with 3 rules applied. Total rules applied 186 place count 10 transition count 15
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 188 place count 8 transition count 12
Iterating global reduction 9 with 2 rules applied. Total rules applied 190 place count 8 transition count 12
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 191 place count 7 transition count 11
Iterating global reduction 9 with 1 rules applied. Total rules applied 192 place count 7 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 194 place count 6 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 195 place count 6 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 196 place count 5 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 197 place count 4 transition count 8
Applied a total of 197 rules in 53 ms. Remains 4 /119 variables (removed 115) and now considering 8/162 (removed 154) transitions.
[2021-05-09 17:46:38] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 17:46:38] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:46:38] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-09 17:46:38] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 17:46:38] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:46:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:46:38] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2021-05-09 17:46:38] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:46:38] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 17:46:38] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:46:38] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/119 places, 8/162 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} 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-15a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-10 finished in 239 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((p1&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 112 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 112 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 111 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 111 transition count 154
Applied a total of 16 rules in 7 ms. Remains 111 /119 variables (removed 8) and now considering 154/162 (removed 8) transitions.
// Phase 1: matrix 154 rows 111 cols
[2021-05-09 17:46:38] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:46:38] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 154 rows 111 cols
[2021-05-09 17:46:38] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:46:38] [INFO ] State equation strengthened by 106 read => feed constraints.
[2021-05-09 17:46:39] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 169 ms to find 1 implicit places.
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:46:39] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:46:39] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Starting structural reductions, iteration 1 : 110/119 places, 154/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:46:39] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:46:39] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 2 iterations. Remains : 110/119 places, 154/162 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-15a-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s47 1) (EQ s109 1)), p1:(OR (NEQ s80 1) (NEQ s109 1)), p2:(EQ s48 1)], nbAcceptance=0, 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 139 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-12 finished in 420 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 112 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 112 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 111 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 111 transition count 154
Applied a total of 16 rules in 4 ms. Remains 111 /119 variables (removed 8) and now considering 154/162 (removed 8) transitions.
// Phase 1: matrix 154 rows 111 cols
[2021-05-09 17:46:39] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:46:39] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 154 rows 111 cols
[2021-05-09 17:46:39] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:46:39] [INFO ] State equation strengthened by 106 read => feed constraints.
[2021-05-09 17:46:39] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 111 cols
[2021-05-09 17:46:39] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:46:39] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 111/119 places, 154/162 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-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: 2}]], initial=3, aps=[p0:(AND (EQ s53 1) (EQ s110 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 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-13 finished in 303 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((F(p0)&&F(p1))) U p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 115 transition count 158
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 115 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 114 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 114 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 113 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 113 transition count 156
Applied a total of 12 rules in 4 ms. Remains 113 /119 variables (removed 6) and now considering 156/162 (removed 6) transitions.
// Phase 1: matrix 156 rows 113 cols
[2021-05-09 17:46:39] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 17:46:39] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 156 rows 113 cols
[2021-05-09 17:46:39] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 17:46:39] [INFO ] State equation strengthened by 107 read => feed constraints.
[2021-05-09 17:46:39] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 170 ms to find 1 implicit places.
// Phase 1: matrix 156 rows 112 cols
[2021-05-09 17:46:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:46:39] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 112/119 places, 156/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 112 cols
[2021-05-09 17:46:39] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 17:46:39] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 2 iterations. Remains : 112/119 places, 156/162 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s32 1), p0:(AND (OR (EQ s32 1) (AND (EQ s41 1) (EQ s111 1))) (EQ s46 1) (EQ s111 1)), p1:(AND (EQ s46 1) (EQ s111 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]]
Stuttering criterion allowed to conclude after 180 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-15 finished in 485 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620582400892

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

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