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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.6K Mar 28 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 15K Mar 28 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 10:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 18:01 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 46K 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-13a-00
FORMULA_NAME DiscoveryGPU-PT-13a-01
FORMULA_NAME DiscoveryGPU-PT-13a-02
FORMULA_NAME DiscoveryGPU-PT-13a-03
FORMULA_NAME DiscoveryGPU-PT-13a-04
FORMULA_NAME DiscoveryGPU-PT-13a-05
FORMULA_NAME DiscoveryGPU-PT-13a-06
FORMULA_NAME DiscoveryGPU-PT-13a-07
FORMULA_NAME DiscoveryGPU-PT-13a-08
FORMULA_NAME DiscoveryGPU-PT-13a-09
FORMULA_NAME DiscoveryGPU-PT-13a-10
FORMULA_NAME DiscoveryGPU-PT-13a-11
FORMULA_NAME DiscoveryGPU-PT-13a-12
FORMULA_NAME DiscoveryGPU-PT-13a-13
FORMULA_NAME DiscoveryGPU-PT-13a-14
FORMULA_NAME DiscoveryGPU-PT-13a-15

=== Now, execution of the tool begins

BK_START 1620579298153

Running Version 0
[2021-05-09 16:54:59] [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 16:54:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 16:55:00] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2021-05-09 16:55:00] [INFO ] Transformed 133 places.
[2021-05-09 16:55:00] [INFO ] Transformed 183 transitions.
[2021-05-09 16:55:00] [INFO ] Found NUPN structural information;
[2021-05-09 16:55:00] [INFO ] Parsed PT model containing 133 places and 183 transitions in 88 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 16:55:00] [INFO ] Initial state test concluded for 2 properties.
FORMULA DiscoveryGPU-PT-13a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 133 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 133/133 places, 183/183 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 123 transition count 173
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 123 transition count 173
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 117 transition count 167
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 117 transition count 167
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 113 transition count 159
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 113 transition count 159
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 49 place count 113 transition count 150
Applied a total of 49 rules in 47 ms. Remains 113 /133 variables (removed 20) and now considering 150/183 (removed 33) transitions.
// Phase 1: matrix 150 rows 113 cols
[2021-05-09 16:55:00] [INFO ] Computed 2 place invariants in 12 ms
[2021-05-09 16:55:00] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 150 rows 113 cols
[2021-05-09 16:55:00] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:55:00] [INFO ] State equation strengthened by 98 read => feed constraints.
[2021-05-09 16:55:00] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
// Phase 1: matrix 150 rows 113 cols
[2021-05-09 16:55:00] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 16:55:00] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 1 iterations. Remains : 113/133 places, 150/183 transitions.
[2021-05-09 16:55:00] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 16:55:00] [INFO ] Flatten gal took : 38 ms
FORMULA DiscoveryGPU-PT-13a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 16:55:00] [INFO ] Flatten gal took : 15 ms
[2021-05-09 16:55:00] [INFO ] Input system was already deterministic with 150 transitions.
Finished random walk after 4844 steps, including 34 resets, run visited all 26 properties in 30 ms. (steps per millisecond=161 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 113/113 places, 150/150 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 113 transition count 143
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 106 transition count 143
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 22 place count 98 transition count 135
Iterating global reduction 0 with 8 rules applied. Total rules applied 30 place count 98 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 96 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 96 transition count 133
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 36 place count 95 transition count 132
Applied a total of 36 rules in 34 ms. Remains 95 /113 variables (removed 18) and now considering 132/150 (removed 18) transitions.
// Phase 1: matrix 132 rows 95 cols
[2021-05-09 16:55:01] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 16:55:01] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 132 rows 95 cols
[2021-05-09 16:55:01] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:55:01] [INFO ] State equation strengthened by 92 read => feed constraints.
[2021-05-09 16:55:01] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [94]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 155 ms to find 1 implicit places.
[2021-05-09 16:55:01] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 132 rows 94 cols
[2021-05-09 16:55:01] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 16:55:01] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 94/113 places, 132/150 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 70 transition count 108
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 58 transition count 84
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 58 transition count 84
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 84 place count 46 transition count 60
Iterating global reduction 0 with 12 rules applied. Total rules applied 96 place count 46 transition count 60
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 107 place count 35 transition count 49
Iterating global reduction 0 with 11 rules applied. Total rules applied 118 place count 35 transition count 49
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 128 place count 25 transition count 29
Iterating global reduction 0 with 10 rules applied. Total rules applied 138 place count 25 transition count 29
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 148 place count 15 transition count 19
Iterating global reduction 0 with 10 rules applied. Total rules applied 158 place count 15 transition count 19
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 15 transition count 19
Applied a total of 160 rules in 23 ms. Remains 15 /94 variables (removed 79) and now considering 19/132 (removed 113) transitions.
[2021-05-09 16:55:01] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 15 cols
[2021-05-09 16:55:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:55:01] [INFO ] Implicit Places using invariants in 25 ms returned []
[2021-05-09 16:55:01] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 15 cols
[2021-05-09 16:55:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:55:01] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-09 16:55:01] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 15/113 places, 19/150 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s7 1) (NEQ s14 1)), p0:(AND (EQ s12 1) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-01 finished in 533 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&(p1 U p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 113/113 places, 150/150 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 106 transition count 143
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 106 transition count 143
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 101 transition count 138
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 101 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 99 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 99 transition count 136
Applied a total of 28 rules in 10 ms. Remains 99 /113 variables (removed 14) and now considering 136/150 (removed 14) transitions.
// Phase 1: matrix 136 rows 99 cols
[2021-05-09 16:55:01] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:55:01] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 136 rows 99 cols
[2021-05-09 16:55:01] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 16:55:01] [INFO ] State equation strengthened by 93 read => feed constraints.
[2021-05-09 16:55:01] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
// Phase 1: matrix 136 rows 99 cols
[2021-05-09 16:55:01] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:55:01] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Finished structural reductions, in 1 iterations. Remains : 99/113 places, 136/150 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13a-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s8 0) (EQ s98 0)), p2:(AND (EQ s48 1) (EQ s74 1) (EQ s97 1)), p1:(EQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-02 finished in 391 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 113/113 places, 150/150 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 113 transition count 144
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 107 transition count 144
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 19 place count 100 transition count 137
Iterating global reduction 0 with 7 rules applied. Total rules applied 26 place count 100 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 98 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 98 transition count 135
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 32 place count 97 transition count 134
Applied a total of 32 rules in 19 ms. Remains 97 /113 variables (removed 16) and now considering 134/150 (removed 16) transitions.
// Phase 1: matrix 134 rows 97 cols
[2021-05-09 16:55:01] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:55:01] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 134 rows 97 cols
[2021-05-09 16:55:01] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:55:02] [INFO ] State equation strengthened by 93 read => feed constraints.
[2021-05-09 16:55:02] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 128 ms to find 1 implicit places.
[2021-05-09 16:55:02] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 134 rows 96 cols
[2021-05-09 16:55:02] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:55:02] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Starting structural reductions, iteration 1 : 96/113 places, 134/150 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 71 transition count 109
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 61 place count 60 transition count 87
Iterating global reduction 0 with 11 rules applied. Total rules applied 72 place count 60 transition count 87
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 83 place count 49 transition count 65
Iterating global reduction 0 with 11 rules applied. Total rules applied 94 place count 49 transition count 65
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 104 place count 39 transition count 55
Iterating global reduction 0 with 10 rules applied. Total rules applied 114 place count 39 transition count 55
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 124 place count 29 transition count 35
Iterating global reduction 0 with 10 rules applied. Total rules applied 134 place count 29 transition count 35
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 144 place count 19 transition count 25
Iterating global reduction 0 with 10 rules applied. Total rules applied 154 place count 19 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 155 place count 19 transition count 25
Applied a total of 155 rules in 12 ms. Remains 19 /96 variables (removed 77) and now considering 25/134 (removed 109) transitions.
[2021-05-09 16:55:02] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 19 cols
[2021-05-09 16:55:02] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:55:02] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-09 16:55:02] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 19 cols
[2021-05-09 16:55:02] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:55:02] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-09 16:55:02] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 19/113 places, 25/150 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s14 1) (EQ s18 1)), p0:(AND (EQ s7 1) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-03 finished in 341 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(((p1||X(p2))&&p0))||X(F(p3))))], workingDir=/home/mcc/execution]
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 113/113 places, 150/150 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 105 transition count 142
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 105 transition count 142
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 100 transition count 137
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 100 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 98 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 98 transition count 135
Applied a total of 30 rules in 8 ms. Remains 98 /113 variables (removed 15) and now considering 135/150 (removed 15) transitions.
// Phase 1: matrix 135 rows 98 cols
[2021-05-09 16:55:02] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:55:02] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 135 rows 98 cols
[2021-05-09 16:55:02] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:55:02] [INFO ] State equation strengthened by 92 read => feed constraints.
[2021-05-09 16:55:02] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 135 ms to find 1 implicit places.
// Phase 1: matrix 135 rows 97 cols
[2021-05-09 16:55:02] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:55:02] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 97/113 places, 135/150 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 97 cols
[2021-05-09 16:55:02] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:55:02] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 2 iterations. Remains : 97/113 places, 135/150 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-13a-04 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p2))), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s96 1)), p1:(AND (EQ s54 1) (EQ s25 1) (EQ s96 1)), p3:(NEQ s18 1), p2:(EQ s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 426 ms.
Product exploration explored 100000 steps with 50000 reset in 277 ms.
Graph (complete) has 267 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [(NOT p0), (NOT p1), p3, (NOT p2)]
Adopting property with smaller alphabet thanks to knowledge :(NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Support contains 3 out of 97 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 97/97 places, 135/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 97 cols
[2021-05-09 16:55:03] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:55:03] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 135 rows 97 cols
[2021-05-09 16:55:03] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:55:03] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-09 16:55:03] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 135 rows 97 cols
[2021-05-09 16:55:03] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:55:03] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 97/97 places, 135/135 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 50000 reset in 221 ms.
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Support contains 3 out of 97 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 97/97 places, 135/135 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 97 transition count 159
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 87 transition count 139
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 87 transition count 139
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 66 place count 67 transition count 99
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 86 place count 67 transition count 99
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 96 place count 57 transition count 89
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 106 place count 57 transition count 89
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 116 place count 47 transition count 69
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 126 place count 47 transition count 69
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 146 place count 27 transition count 39
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 166 place count 27 transition count 39
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 166 rules in 11 ms. Remains 27 /97 variables (removed 70) and now considering 39/135 (removed 96) transitions.
[2021-05-09 16:55:04] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:55:04] [INFO ] Flow matrix only has 36 transitions (discarded 3 similar events)
// Phase 1: matrix 36 rows 27 cols
[2021-05-09 16:55:04] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:55:04] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/97 places, 39/135 transitions.
Product exploration explored 100000 steps with 50000 reset in 376 ms.
Product exploration explored 100000 steps with 50000 reset in 318 ms.
Starting structural reductions, iteration 0 : 97/97 places, 135/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 97 cols
[2021-05-09 16:55:05] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:55:05] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 135 rows 97 cols
[2021-05-09 16:55:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:55:05] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-09 16:55:05] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 135 rows 97 cols
[2021-05-09 16:55:05] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-09 16:55:05] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 97/97 places, 135/135 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:789)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1620579306186

--------------------
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-13a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-13a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875300349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13a.tgz
mv DiscoveryGPU-PT-13a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;