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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 151K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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.1K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 17:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 75K 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-10b-00
FORMULA_NAME DiscoveryGPU-PT-10b-01
FORMULA_NAME DiscoveryGPU-PT-10b-02
FORMULA_NAME DiscoveryGPU-PT-10b-03
FORMULA_NAME DiscoveryGPU-PT-10b-04
FORMULA_NAME DiscoveryGPU-PT-10b-05
FORMULA_NAME DiscoveryGPU-PT-10b-06
FORMULA_NAME DiscoveryGPU-PT-10b-07
FORMULA_NAME DiscoveryGPU-PT-10b-08
FORMULA_NAME DiscoveryGPU-PT-10b-09
FORMULA_NAME DiscoveryGPU-PT-10b-10
FORMULA_NAME DiscoveryGPU-PT-10b-11
FORMULA_NAME DiscoveryGPU-PT-10b-12
FORMULA_NAME DiscoveryGPU-PT-10b-13
FORMULA_NAME DiscoveryGPU-PT-10b-14
FORMULA_NAME DiscoveryGPU-PT-10b-15

=== Now, execution of the tool begins

BK_START 1620576049172

Running Version 0
[2021-05-09 16:00:51] [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:00:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 16:00:51] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2021-05-09 16:00:51] [INFO ] Transformed 296 places.
[2021-05-09 16:00:51] [INFO ] Transformed 314 transitions.
[2021-05-09 16:00:51] [INFO ] Found NUPN structural information;
[2021-05-09 16:00:51] [INFO ] Parsed PT model containing 296 places and 314 transitions in 129 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:00:51] [INFO ] Initial state test concluded for 3 properties.
FORMULA DiscoveryGPU-PT-10b-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 296 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 296/296 places, 314/314 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 276 transition count 314
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 67 place count 229 transition count 267
Iterating global reduction 1 with 47 rules applied. Total rules applied 114 place count 229 transition count 267
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 124 place count 219 transition count 257
Iterating global reduction 1 with 10 rules applied. Total rules applied 134 place count 219 transition count 257
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 143 place count 210 transition count 248
Iterating global reduction 1 with 9 rules applied. Total rules applied 152 place count 210 transition count 248
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 161 place count 201 transition count 239
Iterating global reduction 1 with 9 rules applied. Total rules applied 170 place count 201 transition count 239
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 174 place count 197 transition count 231
Iterating global reduction 1 with 4 rules applied. Total rules applied 178 place count 197 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 180 place count 195 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 182 place count 195 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 184 place count 193 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 186 place count 193 transition count 227
Applied a total of 186 rules in 107 ms. Remains 193 /296 variables (removed 103) and now considering 227/314 (removed 87) transitions.
// Phase 1: matrix 227 rows 193 cols
[2021-05-09 16:00:51] [INFO ] Computed 2 place invariants in 18 ms
[2021-05-09 16:00:51] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 227 rows 193 cols
[2021-05-09 16:00:51] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 16:00:51] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
// Phase 1: matrix 227 rows 193 cols
[2021-05-09 16:00:51] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 16:00:52] [INFO ] Dead Transitions using invariants and state equation in 196 ms returned []
Finished structural reductions, in 1 iterations. Remains : 193/296 places, 227/314 transitions.
[2021-05-09 16:00:52] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 16:00:52] [INFO ] Flatten gal took : 75 ms
FORMULA DiscoveryGPU-PT-10b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 16:00:52] [INFO ] Flatten gal took : 25 ms
[2021-05-09 16:00:52] [INFO ] Input system was already deterministic with 227 transitions.
Finished random walk after 4967 steps, including 15 resets, run visited all 27 properties in 39 ms. (steps per millisecond=127 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((((p0 U p1) U p2)||G(p3))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 193 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 193/193 places, 227/227 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 182 transition count 213
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 182 transition count 213
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 173 transition count 202
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 173 transition count 202
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 168 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 168 transition count 197
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 166 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 166 transition count 195
Applied a total of 54 rules in 33 ms. Remains 166 /193 variables (removed 27) and now considering 195/227 (removed 32) transitions.
// Phase 1: matrix 195 rows 166 cols
[2021-05-09 16:00:52] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:00:52] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 195 rows 166 cols
[2021-05-09 16:00:52] [INFO ] Computed 2 place invariants in 10 ms
[2021-05-09 16:00:52] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 195 rows 166 cols
[2021-05-09 16:00:52] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:00:52] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 166/193 places, 195/227 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-10b-00 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p3:(EQ s64 1), p2:(AND (EQ s120 1) (EQ s162 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 478 steps with 1 reset in 9 ms.
FORMULA DiscoveryGPU-PT-10b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-00 finished in 603 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 227/227 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 192 transition count 193
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 159 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 158 transition count 192
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 68 place count 158 transition count 163
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 126 place count 129 transition count 163
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 133 place count 122 transition count 153
Iterating global reduction 3 with 7 rules applied. Total rules applied 140 place count 122 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 140 place count 122 transition count 152
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 121 transition count 152
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 145 place count 118 transition count 149
Iterating global reduction 3 with 3 rules applied. Total rules applied 148 place count 118 transition count 149
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 240 place count 72 transition count 103
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 247 place count 65 transition count 89
Iterating global reduction 3 with 7 rules applied. Total rules applied 254 place count 65 transition count 89
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 261 place count 58 transition count 81
Iterating global reduction 3 with 7 rules applied. Total rules applied 268 place count 58 transition count 81
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 275 place count 51 transition count 68
Iterating global reduction 3 with 7 rules applied. Total rules applied 282 place count 51 transition count 68
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 289 place count 44 transition count 60
Iterating global reduction 3 with 7 rules applied. Total rules applied 296 place count 44 transition count 60
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 303 place count 37 transition count 47
Iterating global reduction 3 with 7 rules applied. Total rules applied 310 place count 37 transition count 47
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 317 place count 30 transition count 39
Iterating global reduction 3 with 7 rules applied. Total rules applied 324 place count 30 transition count 39
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 325 place count 29 transition count 38
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 place count 29 transition count 38
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 327 place count 29 transition count 37
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 328 place count 29 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 329 place count 28 transition count 36
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 8 rules applied. Total rules applied 337 place count 26 transition count 30
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 343 place count 20 transition count 30
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 361 place count 11 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 362 place count 11 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 363 place count 11 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 364 place count 10 transition count 18
Applied a total of 364 rules in 101 ms. Remains 10 /193 variables (removed 183) and now considering 18/227 (removed 209) transitions.
[2021-05-09 16:00:53] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
// Phase 1: matrix 13 rows 10 cols
[2021-05-09 16:00:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:00:53] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-09 16:00:53] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
// Phase 1: matrix 13 rows 10 cols
[2021-05-09 16:00:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:00:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:00:53] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2021-05-09 16:00:53] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:00:53] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
// Phase 1: matrix 13 rows 10 cols
[2021-05-09 16:00:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:00:53] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/193 places, 18/227 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-10b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s6 1), p1:(EQ s2 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 123 steps with 3 reset in 4 ms.
FORMULA DiscoveryGPU-PT-10b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-01 finished in 312 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||X(p1)))||(F(p2) U p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 227/227 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 182 transition count 213
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 182 transition count 213
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 173 transition count 202
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 173 transition count 202
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 168 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 168 transition count 197
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 166 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 166 transition count 195
Applied a total of 54 rules in 36 ms. Remains 166 /193 variables (removed 27) and now considering 195/227 (removed 32) transitions.
// Phase 1: matrix 195 rows 166 cols
[2021-05-09 16:00:53] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:00:53] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 195 rows 166 cols
[2021-05-09 16:00:53] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:00:53] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
// Phase 1: matrix 195 rows 166 cols
[2021-05-09 16:00:53] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 16:00:53] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 1 iterations. Remains : 166/193 places, 195/227 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s40 1) (EQ s165 1)), p2:(EQ s103 1), p1:(EQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1079 steps with 3 reset in 22 ms.
FORMULA DiscoveryGPU-PT-10b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-02 finished in 543 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(X(F(p0)))) U G((p1&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 227/227 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 182 transition count 213
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 182 transition count 213
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 174 transition count 204
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 174 transition count 204
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 170 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 170 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 169 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 169 transition count 199
Applied a total of 48 rules in 10 ms. Remains 169 /193 variables (removed 24) and now considering 199/227 (removed 28) transitions.
// Phase 1: matrix 199 rows 169 cols
[2021-05-09 16:00:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:00:54] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 199 rows 169 cols
[2021-05-09 16:00:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:00:54] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 169 cols
[2021-05-09 16:00:54] [INFO ] Computed 2 place invariants in 10 ms
[2021-05-09 16:00:54] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 1 iterations. Remains : 169/193 places, 199/227 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-10b-03 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s56 1), p2:(AND (EQ s131 1) (EQ s165 1)), p0:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 310 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-03 finished in 581 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 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 227/227 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 182 transition count 214
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 182 transition count 214
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 174 transition count 204
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 174 transition count 204
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 170 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 170 transition count 200
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 168 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 168 transition count 198
Applied a total of 50 rules in 10 ms. Remains 168 /193 variables (removed 25) and now considering 198/227 (removed 29) transitions.
// Phase 1: matrix 198 rows 168 cols
[2021-05-09 16:00:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:00:54] [INFO ] Implicit Places using invariants in 204 ms returned []
// Phase 1: matrix 198 rows 168 cols
[2021-05-09 16:00:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:00:54] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
// Phase 1: matrix 198 rows 168 cols
[2021-05-09 16:00:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:00:55] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 168/193 places, 198/227 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-05 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 (NEQ s94 1) (NEQ s146 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 253 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-05 finished in 537 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U p1)||G(p2)||X(F(p3)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 227/227 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 183 transition count 215
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 183 transition count 215
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 176 transition count 206
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 176 transition count 206
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 172 transition count 202
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 172 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 170 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 170 transition count 200
Applied a total of 46 rules in 28 ms. Remains 170 /193 variables (removed 23) and now considering 200/227 (removed 27) transitions.
// Phase 1: matrix 200 rows 170 cols
[2021-05-09 16:00:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:00:55] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 200 rows 170 cols
[2021-05-09 16:00:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:00:55] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 170 cols
[2021-05-09 16:00:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:00:55] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/193 places, 200/227 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-10b-06 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(NEQ s62 1), p1:(EQ s51 0), p0:(AND (EQ s135 1) (EQ s169 1)), p2:(NEQ s51 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]]
Product exploration explored 100000 steps with 50000 reset in 274 ms.
Product exploration explored 100000 steps with 50000 reset in 291 ms.
Graph (complete) has 343 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p3, p1, (NOT p0), p2]
Stuttering acceptance computed with spot in 170 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Applying partial POR strategy [true, true, false, false, true, true]
Stuttering acceptance computed with spot in 144 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3))]
Support contains 4 out of 170 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 170/170 places, 200/200 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 170 transition count 200
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 33 Pre rules applied. Total rules applied 20 place count 170 transition count 281
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 53 place count 170 transition count 281
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 67 place count 170 transition count 281
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 169 transition count 280
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 169 transition count 280
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 99 place count 169 transition count 381
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 106 place count 162 transition count 353
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 113 place count 162 transition count 353
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 134 place count 141 transition count 297
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 155 place count 141 transition count 297
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 173 place count 123 transition count 255
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 191 place count 123 transition count 255
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 197 place count 117 transition count 249
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 203 place count 117 transition count 249
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 215 place count 105 transition count 219
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 227 place count 105 transition count 219
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 251 place count 81 transition count 159
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 275 place count 81 transition count 159
Deduced a syphon composed of 46 places in 0 ms
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 1 with 21 rules applied. Total rules applied 296 place count 81 transition count 138
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 300 place count 77 transition count 130
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 304 place count 77 transition count 130
Deduced a syphon composed of 42 places in 0 ms
Applied a total of 304 rules in 50 ms. Remains 77 /170 variables (removed 93) and now considering 130/200 (removed 70) transitions.
[2021-05-09 16:00:57] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-09 16:00:57] [INFO ] Flow matrix only has 118 transitions (discarded 12 similar events)
// Phase 1: matrix 118 rows 77 cols
[2021-05-09 16:00:57] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:00:57] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 77/170 places, 130/200 transitions.
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Product exploration explored 100000 steps with 50000 reset in 241 ms.
[2021-05-09 16:00:57] [INFO ] Flatten gal took : 10 ms
[2021-05-09 16:00:57] [INFO ] Flatten gal took : 57 ms
[2021-05-09 16:00:57] [INFO ] Time to serialize gal into /tmp/LTL3718411739819564756.gal : 5 ms
[2021-05-09 16:00:57] [INFO ] Time to serialize properties into /tmp/LTL17131964442570787402.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3718411739819564756.gal, -t, CGAL, -LTL, /tmp/LTL17131964442570787402.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3718411739819564756.gal -t CGAL -LTL /tmp/LTL17131964442570787402.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(((("((p236==1)&&(p294==1))")U("(p80==0)"))||(G("(p80!=1)")))||(X(F("(p100!=1)"))))))
Formula 0 simplified : !X(("((p236==1)&&(p294==1))" U "(p80==0)") | G"(p80!=1)" | XF"(p100!=1)")
Detected timeout of ITS tools.
[2021-05-09 16:01:13] [INFO ] Flatten gal took : 10 ms
[2021-05-09 16:01:13] [INFO ] Applying decomposition
[2021-05-09 16:01:13] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8782035199770640629.txt, -o, /tmp/graph8782035199770640629.bin, -w, /tmp/graph8782035199770640629.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8782035199770640629.bin, -l, -1, -v, -w, /tmp/graph8782035199770640629.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 16:01:13] [INFO ] Decomposing Gal with order
[2021-05-09 16:01:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 16:01:13] [INFO ] Removed a total of 78 redundant transitions.
[2021-05-09 16:01:13] [INFO ] Flatten gal took : 66 ms
[2021-05-09 16:01:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 12 ms.
[2021-05-09 16:01:13] [INFO ] Time to serialize gal into /tmp/LTL11006842033966613155.gal : 14 ms
[2021-05-09 16:01:13] [INFO ] Time to serialize properties into /tmp/LTL14768164720776721052.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11006842033966613155.gal, -t, CGAL, -LTL, /tmp/LTL14768164720776721052.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11006842033966613155.gal -t CGAL -LTL /tmp/LTL14768164720776721052.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(((("((i16.u48.p236==1)&&(i7.u60.p294==1))")U("(i3.u17.p80==0)"))||(G("(i3.u17.p80!=1)")))||(X(F("(i7.u21.p100!=1)"))))))
Formula 0 simplified : !X(("((i16.u48.p236==1)&&(i7.u60.p294==1))" U "(i3.u17.p80==0)") | G"(i3.u17.p80!=1)" | XF"(i7.u21.p100!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5184837096711004344
[2021-05-09 16:01:28] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5184837096711004344
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5184837096711004344]
Compilation finished in 815 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5184837096711004344]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((((LTLAPp0==true) U (LTLAPp1==true))||[]((LTLAPp2==true))||X(<>((LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5184837096711004344]
LTSmin run took 818 ms.
FORMULA DiscoveryGPU-PT-10b-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-10b-06 finished in 34884 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 227/227 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 192 transition count 193
Reduce places removed 33 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 68 place count 159 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 157 transition count 191
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 70 place count 157 transition count 162
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 128 place count 128 transition count 162
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 136 place count 120 transition count 150
Iterating global reduction 3 with 8 rules applied. Total rules applied 144 place count 120 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 144 place count 120 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 119 transition count 149
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 150 place count 115 transition count 145
Iterating global reduction 3 with 4 rules applied. Total rules applied 154 place count 115 transition count 145
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 246 place count 69 transition count 99
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 255 place count 60 transition count 81
Iterating global reduction 3 with 9 rules applied. Total rules applied 264 place count 60 transition count 81
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 273 place count 51 transition count 71
Iterating global reduction 3 with 9 rules applied. Total rules applied 282 place count 51 transition count 71
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 291 place count 42 transition count 54
Iterating global reduction 3 with 9 rules applied. Total rules applied 300 place count 42 transition count 54
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 309 place count 33 transition count 44
Iterating global reduction 3 with 9 rules applied. Total rules applied 318 place count 33 transition count 44
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 326 place count 25 transition count 29
Iterating global reduction 3 with 8 rules applied. Total rules applied 334 place count 25 transition count 29
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 342 place count 17 transition count 20
Iterating global reduction 3 with 8 rules applied. Total rules applied 350 place count 17 transition count 20
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 351 place count 16 transition count 19
Iterating global reduction 3 with 1 rules applied. Total rules applied 352 place count 16 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 353 place count 16 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 354 place count 15 transition count 17
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 6 rules applied. Total rules applied 360 place count 13 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 364 place count 9 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 364 place count 9 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 366 place count 8 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 370 place count 6 transition count 10
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 5 with 2 rules applied. Total rules applied 372 place count 5 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 373 place count 5 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 374 place count 4 transition count 8
Applied a total of 374 rules in 36 ms. Remains 4 /193 variables (removed 189) and now considering 8/227 (removed 219) transitions.
[2021-05-09 16:01:30] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 16:01:30] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:01:30] [INFO ] Implicit Places using invariants in 5 ms returned []
[2021-05-09 16:01:30] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 16:01:30] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:01:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:01:30] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-09 16:01:30] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:01:30] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 16:01:30] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:01:30] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/193 places, 8/227 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-07 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:(EQ s2 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 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-07 finished in 133 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 227/227 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 182 transition count 213
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 182 transition count 213
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 174 transition count 203
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 174 transition count 203
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 169 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 169 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 167 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 167 transition count 196
Applied a total of 52 rules in 20 ms. Remains 167 /193 variables (removed 26) and now considering 196/227 (removed 31) transitions.
// Phase 1: matrix 196 rows 167 cols
[2021-05-09 16:01:30] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:01:30] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 196 rows 167 cols
[2021-05-09 16:01:30] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:01:30] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
// Phase 1: matrix 196 rows 167 cols
[2021-05-09 16:01:30] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:01:30] [INFO ] Dead Transitions using invariants and state equation in 181 ms returned []
Finished structural reductions, in 1 iterations. Remains : 167/193 places, 196/227 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-10b-08 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 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s72 1), p1:(AND (EQ s34 1) (EQ s166 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-10b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-08 finished in 515 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 227/227 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 181 transition count 212
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 181 transition count 212
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 172 transition count 201
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 172 transition count 201
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 167 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 167 transition count 196
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 165 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 165 transition count 194
Applied a total of 56 rules in 13 ms. Remains 165 /193 variables (removed 28) and now considering 194/227 (removed 33) transitions.
// Phase 1: matrix 194 rows 165 cols
[2021-05-09 16:01:30] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:01:30] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 194 rows 165 cols
[2021-05-09 16:01:30] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:01:30] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 194 rows 165 cols
[2021-05-09 16:01:30] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 16:01:30] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Finished structural reductions, in 1 iterations. Remains : 165/193 places, 194/227 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s141 1) (EQ s161 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 1906 reset in 161 ms.
Stack based approach found an accepted trace after 333 steps with 7 reset with depth 60 and stack size 60 in 1 ms.
FORMULA DiscoveryGPU-PT-10b-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-09 finished in 564 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 227/227 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 183 transition count 214
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 183 transition count 214
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 175 transition count 204
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 175 transition count 204
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 170 transition count 199
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 170 transition count 199
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 168 transition count 197
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 168 transition count 197
Applied a total of 50 rules in 7 ms. Remains 168 /193 variables (removed 25) and now considering 197/227 (removed 30) transitions.
// Phase 1: matrix 197 rows 168 cols
[2021-05-09 16:01:31] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:01:31] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 197 rows 168 cols
[2021-05-09 16:01:31] [INFO ] Computed 2 place invariants in 15 ms
[2021-05-09 16:01:31] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
// Phase 1: matrix 197 rows 168 cols
[2021-05-09 16:01:31] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:01:31] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 168/193 places, 197/227 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-10b-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s160 1), p1:(AND (NEQ s130 1) (EQ s3 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 304 reset in 187 ms.
Stack based approach found an accepted trace after 2787 steps with 8 reset with depth 101 and stack size 101 in 7 ms.
FORMULA DiscoveryGPU-PT-10b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-10 finished in 514 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 227/227 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 183 transition count 214
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 183 transition count 214
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 175 transition count 205
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 175 transition count 205
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 171 transition count 201
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 171 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 170 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 170 transition count 200
Applied a total of 46 rules in 7 ms. Remains 170 /193 variables (removed 23) and now considering 200/227 (removed 27) transitions.
// Phase 1: matrix 200 rows 170 cols
[2021-05-09 16:01:31] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:01:31] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 200 rows 170 cols
[2021-05-09 16:01:31] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:01:31] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 170 cols
[2021-05-09 16:01:31] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:01:32] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/193 places, 200/227 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10b-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { 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: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s146 1), p1:(EQ s90 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-11 finished in 357 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 227/227 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 192 transition count 192
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 158 transition count 192
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 68 place count 158 transition count 164
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 124 place count 130 transition count 164
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 132 place count 122 transition count 152
Iterating global reduction 2 with 8 rules applied. Total rules applied 140 place count 122 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 140 place count 122 transition count 151
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 121 transition count 151
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 145 place count 118 transition count 148
Iterating global reduction 2 with 3 rules applied. Total rules applied 148 place count 118 transition count 148
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 240 place count 72 transition count 102
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 247 place count 65 transition count 88
Iterating global reduction 2 with 7 rules applied. Total rules applied 254 place count 65 transition count 88
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 261 place count 58 transition count 81
Iterating global reduction 2 with 7 rules applied. Total rules applied 268 place count 58 transition count 81
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 275 place count 51 transition count 67
Iterating global reduction 2 with 7 rules applied. Total rules applied 282 place count 51 transition count 67
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 289 place count 44 transition count 60
Iterating global reduction 2 with 7 rules applied. Total rules applied 296 place count 44 transition count 60
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 303 place count 37 transition count 46
Iterating global reduction 2 with 7 rules applied. Total rules applied 310 place count 37 transition count 46
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 317 place count 30 transition count 39
Iterating global reduction 2 with 7 rules applied. Total rules applied 324 place count 30 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 326 place count 29 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 327 place count 28 transition count 37
Iterating global reduction 2 with 1 rules applied. Total rules applied 328 place count 28 transition count 37
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 329 place count 27 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 330 place count 27 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 331 place count 26 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 332 place count 26 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 333 place count 25 transition count 32
Iterating global reduction 2 with 1 rules applied. Total rules applied 334 place count 25 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 335 place count 24 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 336 place count 24 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 23 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 339 place count 22 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 340 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 341 place count 21 transition count 27
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 344 place count 20 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 346 place count 18 transition count 25
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 356 place count 13 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 357 place count 12 transition count 19
Applied a total of 357 rules in 20 ms. Remains 12 /193 variables (removed 181) and now considering 19/227 (removed 208) transitions.
[2021-05-09 16:01:32] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 12 cols
[2021-05-09 16:01:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:01:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-09 16:01:32] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 12 cols
[2021-05-09 16:01:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:01:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:01:32] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-09 16:01:32] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:01:32] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 12 cols
[2021-05-09 16:01:32] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:01:32] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/193 places, 19/227 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-12 finished in 105 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 227/227 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 192 transition count 192
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 158 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 157 transition count 191
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 70 place count 157 transition count 162
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 128 place count 128 transition count 162
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 136 place count 120 transition count 150
Iterating global reduction 3 with 8 rules applied. Total rules applied 144 place count 120 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 144 place count 120 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 119 transition count 149
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 150 place count 115 transition count 145
Iterating global reduction 3 with 4 rules applied. Total rules applied 154 place count 115 transition count 145
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 246 place count 69 transition count 99
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 255 place count 60 transition count 81
Iterating global reduction 3 with 9 rules applied. Total rules applied 264 place count 60 transition count 81
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 273 place count 51 transition count 71
Iterating global reduction 3 with 9 rules applied. Total rules applied 282 place count 51 transition count 71
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 290 place count 43 transition count 56
Iterating global reduction 3 with 8 rules applied. Total rules applied 298 place count 43 transition count 56
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 306 place count 35 transition count 47
Iterating global reduction 3 with 8 rules applied. Total rules applied 314 place count 35 transition count 47
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 322 place count 27 transition count 32
Iterating global reduction 3 with 8 rules applied. Total rules applied 330 place count 27 transition count 32
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 338 place count 19 transition count 23
Iterating global reduction 3 with 8 rules applied. Total rules applied 346 place count 19 transition count 23
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 347 place count 18 transition count 22
Iterating global reduction 3 with 1 rules applied. Total rules applied 348 place count 18 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 349 place count 18 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 350 place count 17 transition count 20
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 7 rules applied. Total rules applied 357 place count 15 transition count 15
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 362 place count 10 transition count 15
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 370 place count 6 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 371 place count 6 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 372 place count 5 transition count 9
Applied a total of 372 rules in 18 ms. Remains 5 /193 variables (removed 188) and now considering 9/227 (removed 218) transitions.
[2021-05-09 16:01:32] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 16:01:32] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:01:32] [INFO ] Implicit Places using invariants in 13 ms returned []
[2021-05-09 16:01:32] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 16:01:32] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:01:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:01:32] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-09 16:01:32] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:01:32] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 16:01:32] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:01:32] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/193 places, 9/227 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-15 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:(NEQ s3 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-10b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-15 finished in 103 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620576093185

--------------------
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-10b"
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-10b, 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-162048875200309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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