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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 10:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 89K 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-12b-00
FORMULA_NAME DiscoveryGPU-PT-12b-01
FORMULA_NAME DiscoveryGPU-PT-12b-02
FORMULA_NAME DiscoveryGPU-PT-12b-03
FORMULA_NAME DiscoveryGPU-PT-12b-04
FORMULA_NAME DiscoveryGPU-PT-12b-05
FORMULA_NAME DiscoveryGPU-PT-12b-06
FORMULA_NAME DiscoveryGPU-PT-12b-07
FORMULA_NAME DiscoveryGPU-PT-12b-08
FORMULA_NAME DiscoveryGPU-PT-12b-09
FORMULA_NAME DiscoveryGPU-PT-12b-10
FORMULA_NAME DiscoveryGPU-PT-12b-11
FORMULA_NAME DiscoveryGPU-PT-12b-12
FORMULA_NAME DiscoveryGPU-PT-12b-13
FORMULA_NAME DiscoveryGPU-PT-12b-14
FORMULA_NAME DiscoveryGPU-PT-12b-15

=== Now, execution of the tool begins

BK_START 1620579078091

Running Version 0
[2021-05-09 16:51:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:51:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 16:51:19] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2021-05-09 16:51:19] [INFO ] Transformed 352 places.
[2021-05-09 16:51:19] [INFO ] Transformed 374 transitions.
[2021-05-09 16:51:19] [INFO ] Found NUPN structural information;
[2021-05-09 16:51:19] [INFO ] Parsed PT model containing 352 places and 374 transitions in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 16:51:19] [INFO ] Initial state test concluded for 4 properties.
FORMULA DiscoveryGPU-PT-12b-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 352 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 352/352 places, 374/374 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 329 transition count 374
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 78 place count 274 transition count 319
Iterating global reduction 1 with 55 rules applied. Total rules applied 133 place count 274 transition count 319
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 144 place count 263 transition count 308
Iterating global reduction 1 with 11 rules applied. Total rules applied 155 place count 263 transition count 308
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 163 place count 255 transition count 300
Iterating global reduction 1 with 8 rules applied. Total rules applied 171 place count 255 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 177 place count 249 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 183 place count 249 transition count 294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 187 place count 245 transition count 286
Iterating global reduction 1 with 4 rules applied. Total rules applied 191 place count 245 transition count 286
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 194 place count 242 transition count 283
Iterating global reduction 1 with 3 rules applied. Total rules applied 197 place count 242 transition count 283
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 200 place count 239 transition count 280
Iterating global reduction 1 with 3 rules applied. Total rules applied 203 place count 239 transition count 280
Applied a total of 203 rules in 93 ms. Remains 239 /352 variables (removed 113) and now considering 280/374 (removed 94) transitions.
// Phase 1: matrix 280 rows 239 cols
[2021-05-09 16:51:19] [INFO ] Computed 2 place invariants in 20 ms
[2021-05-09 16:51:20] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 280 rows 239 cols
[2021-05-09 16:51:20] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 16:51:20] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
// Phase 1: matrix 280 rows 239 cols
[2021-05-09 16:51:20] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 16:51:20] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Finished structural reductions, in 1 iterations. Remains : 239/352 places, 280/374 transitions.
[2021-05-09 16:51:20] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 16:51:20] [INFO ] Flatten gal took : 49 ms
FORMULA DiscoveryGPU-PT-12b-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 16:51:20] [INFO ] Flatten gal took : 20 ms
[2021-05-09 16:51:20] [INFO ] Input system was already deterministic with 280 transitions.
Finished random walk after 1417 steps, including 3 resets, run visited all 17 properties in 17 ms. (steps per millisecond=83 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G(p1)&&X((X(((!p1 U ((!p1&&G(p3))||G(!p1))) U (!p3&&(!p1 U ((!p1&&G(p3))||G(!p1))))))||p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 280/280 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 280
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 227 transition count 268
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 227 transition count 268
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 220 transition count 258
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 220 transition count 258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 214 transition count 252
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 214 transition count 252
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 209 transition count 246
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 209 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 207 transition count 243
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 207 transition count 243
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 205 transition count 241
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 205 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 204 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 204 transition count 240
Applied a total of 69 rules in 98 ms. Remains 204 /239 variables (removed 35) and now considering 240/280 (removed 40) transitions.
// Phase 1: matrix 240 rows 204 cols
[2021-05-09 16:51:20] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:20] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 240 rows 204 cols
[2021-05-09 16:51:20] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:51:20] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
// Phase 1: matrix 240 rows 204 cols
[2021-05-09 16:51:20] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:21] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Finished structural reductions, in 1 iterations. Remains : 204/239 places, 240/280 transitions.
Stuttering acceptance computed with spot in 648 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (OR (AND p1 (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p1) p2 p3), (OR (AND p1 (NOT p2)) (AND (NOT p2) p3)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)) (AND (NOT p1) p3)), (OR (AND (NOT p0) p1 (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p1) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), false, (AND p1 (NOT p2) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p3)) (AND p1 (NOT p2) (NOT p3)))]
Running random walk in product with property : DiscoveryGPU-PT-12b-00 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={1, 2} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1, 2} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1, 2} source=1 dest: 0}, { cond=p1, acceptance={1, 2} source=1 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={1, 2} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=2 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1, 2} source=2 dest: 5}], [{ cond=p1, acceptance={1, 2} source=3 dest: 1}, { cond=(AND (NOT p1) p2 p3), acceptance={0, 1, 2} source=3 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0, 1} source=3 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={1, 2} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p1) (NOT p2) p3)), acceptance={0, 1, 2} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={1, 2} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={0, 1, 2} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=5 dest: 7}], [{ cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND p0 p1 (NOT p3)), acceptance={1, 2} source=6 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={0, 1, 2} source=6 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=6 dest: 7}, { cond=(AND p0 p1 p3), acceptance={2} source=6 dest: 8}, { cond=(AND p0 p1 p3), acceptance={0, 2} source=6 dest: 9}, { cond=(AND (NOT p0) p1 p3), acceptance={0, 2} source=6 dest: 10}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1, 2} source=7 dest: 0}, { cond=(AND p0 p1), acceptance={1, 2} source=7 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1, 2} source=7 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1, 2} source=8 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={1, 2} source=8 dest: 1}, { cond=(AND p1 p3), acceptance={2} source=8 dest: 8}, { cond=(AND (NOT p1) p3), acceptance={0, 2} source=8 dest: 10}], [{ cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={1, 2} source=9 dest: 3}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=9 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={0, 1, 2} source=9 dest: 5}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={2} source=9 dest: 11}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={0, 2} source=9 dest: 12}, { cond=(OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), acceptance={0, 2} source=9 dest: 13}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0, 1, 2} source=10 dest: 0}, { cond=(AND p0 p1 (NOT p3)), acceptance={1, 2} source=10 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={0, 1, 2} source=10 dest: 2}, { cond=(AND p0 p1 p3), acceptance={2} source=10 dest: 8}, { cond=(AND p0 p1 p3), acceptance={0, 2} source=10 dest: 9}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p1) p3)), acceptance={0, 2} source=10 dest: 10}], [{ cond=(AND p1 (NOT p3)), acceptance={1, 2} source=11 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0, 1} source=11 dest: 7}, { cond=(AND p1 p3), acceptance={2} source=11 dest: 8}, { cond=(AND (NOT p1) p2 p3), acceptance={0, 2} source=11 dest: 13}], [{ cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={1, 2} source=12 dest: 3}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=12 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=12 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=12 dest: 7}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={2} source=12 dest: 11}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={0, 2} source=12 dest: 12}, { cond=(OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), acceptance={0, 2} source=12 dest: 13}], [{ cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0, 1, 2} source=13 dest: 0}, { cond=(AND p0 p1 (NOT p3)), acceptance={1, 2} source=13 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={0, 1, 2} source=13 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=13 dest: 7}, { cond=(AND p0 p1 p3), acceptance={2} source=13 dest: 8}, { cond=(AND p0 p1 p3), acceptance={0, 2} source=13 dest: 9}, { cond=(AND (NOT p0) p1 p3), acceptance={0, 2} source=13 dest: 10}, { cond=(AND (NOT p1) p3), acceptance={0, 2} source=13 dest: 13}]], initial=0, aps=[p0:(OR (EQ s150 0) (EQ s86 1)), p1:(EQ s148 1), p2:(OR (EQ s88 0) (EQ s179 1)), p3:(AND (NEQ s88 0) (NEQ s179 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 497 steps with 0 reset in 8 ms.
FORMULA DiscoveryGPU-PT-12b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-00 finished in 1073 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((X(p1)&&G(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 280/280 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 280
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 229 transition count 270
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 229 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 223 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 223 transition count 261
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 217 transition count 255
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 217 transition count 255
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 212 transition count 249
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 212 transition count 249
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 210 transition count 246
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 210 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 208 transition count 244
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 208 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 207 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 207 transition count 243
Applied a total of 63 rules in 23 ms. Remains 207 /239 variables (removed 32) and now considering 243/280 (removed 37) transitions.
// Phase 1: matrix 243 rows 207 cols
[2021-05-09 16:51:21] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:51:21] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 243 rows 207 cols
[2021-05-09 16:51:21] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:21] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 243 rows 207 cols
[2021-05-09 16:51:21] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:22] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 1 iterations. Remains : 207/239 places, 243/280 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (AND p2 (NOT p1)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-12b-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s126 0) (EQ s46 1)), p2:(OR (EQ s115 0) (EQ s119 1)), p1:(OR (EQ s81 0) (EQ s69 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]]
Entered a terminal (fully accepting) state of product in 308 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-12b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-02 finished in 444 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 280/280 transitions.
Graph (complete) has 471 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 237 transition count 240
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 198 transition count 240
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 79 place count 198 transition count 202
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 155 place count 160 transition count 202
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 161 place count 154 transition count 196
Iterating global reduction 2 with 6 rules applied. Total rules applied 167 place count 154 transition count 196
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 171 place count 150 transition count 190
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 150 transition count 190
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 179 place count 146 transition count 186
Iterating global reduction 2 with 4 rules applied. Total rules applied 183 place count 146 transition count 186
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 185 place count 144 transition count 182
Iterating global reduction 2 with 2 rules applied. Total rules applied 187 place count 144 transition count 182
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 189 place count 142 transition count 180
Iterating global reduction 2 with 2 rules applied. Total rules applied 191 place count 142 transition count 180
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 307 place count 84 transition count 122
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 317 place count 74 transition count 103
Iterating global reduction 2 with 10 rules applied. Total rules applied 327 place count 74 transition count 103
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 337 place count 64 transition count 91
Iterating global reduction 2 with 10 rules applied. Total rules applied 347 place count 64 transition count 91
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 357 place count 54 transition count 72
Iterating global reduction 2 with 10 rules applied. Total rules applied 367 place count 54 transition count 72
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 377 place count 44 transition count 61
Iterating global reduction 2 with 10 rules applied. Total rules applied 387 place count 44 transition count 61
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 397 place count 34 transition count 42
Iterating global reduction 2 with 10 rules applied. Total rules applied 407 place count 34 transition count 42
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 417 place count 24 transition count 31
Iterating global reduction 2 with 10 rules applied. Total rules applied 427 place count 24 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 429 place count 22 transition count 28
Iterating global reduction 2 with 2 rules applied. Total rules applied 431 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 432 place count 21 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 21 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 434 place count 21 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 435 place count 20 transition count 25
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 440 place count 18 transition count 22
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 444 place count 15 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 445 place count 14 transition count 21
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 5 with 10 rules applied. Total rules applied 455 place count 9 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 456 place count 9 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 457 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 458 place count 8 transition count 13
Applied a total of 458 rules in 56 ms. Remains 8 /239 variables (removed 231) and now considering 13/280 (removed 267) transitions.
[2021-05-09 16:51:22] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2021-05-09 16:51:22] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:51:22] [INFO ] Implicit Places using invariants in 18 ms returned []
[2021-05-09 16:51:22] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2021-05-09 16:51:22] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:51:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:51:22] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-09 16:51:22] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:51:22] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2021-05-09 16:51:22] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:51:22] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/239 places, 13/280 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 151 steps with 3 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-03 finished in 130 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 280/280 transitions.
Graph (complete) has 471 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 237 transition count 241
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 199 transition count 241
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 77 place count 199 transition count 204
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 151 place count 162 transition count 204
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 157 place count 156 transition count 197
Iterating global reduction 2 with 6 rules applied. Total rules applied 163 place count 156 transition count 197
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 168 place count 151 transition count 190
Iterating global reduction 2 with 5 rules applied. Total rules applied 173 place count 151 transition count 190
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 176 place count 148 transition count 187
Iterating global reduction 2 with 3 rules applied. Total rules applied 179 place count 148 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 180 place count 147 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 181 place count 147 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 182 place count 146 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 183 place count 146 transition count 184
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 301 place count 87 transition count 125
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 311 place count 77 transition count 106
Iterating global reduction 2 with 10 rules applied. Total rules applied 321 place count 77 transition count 106
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 331 place count 67 transition count 94
Iterating global reduction 2 with 10 rules applied. Total rules applied 341 place count 67 transition count 94
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 351 place count 57 transition count 75
Iterating global reduction 2 with 10 rules applied. Total rules applied 361 place count 57 transition count 75
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 370 place count 48 transition count 65
Iterating global reduction 2 with 9 rules applied. Total rules applied 379 place count 48 transition count 65
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 388 place count 39 transition count 48
Iterating global reduction 2 with 9 rules applied. Total rules applied 397 place count 39 transition count 48
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 406 place count 30 transition count 38
Iterating global reduction 2 with 9 rules applied. Total rules applied 415 place count 30 transition count 38
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 417 place count 28 transition count 35
Iterating global reduction 2 with 2 rules applied. Total rules applied 419 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 420 place count 27 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 421 place count 27 transition count 34
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 423 place count 27 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 424 place count 26 transition count 31
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 11 rules applied. Total rules applied 435 place count 24 transition count 22
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 444 place count 15 transition count 22
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 4 with 8 rules applied. Total rules applied 452 place count 11 transition count 18
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 4 with 2 rules applied. Total rules applied 454 place count 10 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 455 place count 10 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 456 place count 9 transition count 16
Applied a total of 456 rules in 46 ms. Remains 9 /239 variables (removed 230) and now considering 16/280 (removed 264) transitions.
[2021-05-09 16:51:22] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 16:51:22] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:51:22] [INFO ] Implicit Places using invariants in 6 ms returned []
[2021-05-09 16:51:22] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 16:51:22] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-09 16:51:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:51:22] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-09 16:51:22] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:51:22] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 16:51:22] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:51:22] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/239 places, 16/280 transitions.
Stuttering acceptance computed with spot in 29 ms :[true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-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}]], initial=1, aps=[p0:(OR (EQ s5 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 108 steps with 3 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-05 finished in 127 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 280/280 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 280
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 224 transition count 265
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 224 transition count 265
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 37 place count 216 transition count 254
Iterating global reduction 1 with 8 rules applied. Total rules applied 45 place count 216 transition count 254
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 209 transition count 247
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 209 transition count 247
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 65 place count 203 transition count 240
Iterating global reduction 1 with 6 rules applied. Total rules applied 71 place count 203 transition count 240
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 200 transition count 235
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 200 transition count 235
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 197 transition count 232
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 197 transition count 232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 195 transition count 230
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 195 transition count 230
Applied a total of 87 rules in 32 ms. Remains 195 /239 variables (removed 44) and now considering 230/280 (removed 50) transitions.
// Phase 1: matrix 230 rows 195 cols
[2021-05-09 16:51:22] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:22] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 230 rows 195 cols
[2021-05-09 16:51:22] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:22] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
// Phase 1: matrix 230 rows 195 cols
[2021-05-09 16:51:22] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:51:22] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 1 iterations. Remains : 195/239 places, 230/280 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s116 0) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1222 steps with 4 reset in 6 ms.
FORMULA DiscoveryGPU-PT-12b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-06 finished in 345 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 280/280 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 226 transition count 266
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 226 transition count 266
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 218 transition count 255
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 218 transition count 255
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 211 transition count 248
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 211 transition count 248
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 205 transition count 241
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 205 transition count 241
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 202 transition count 236
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 202 transition count 236
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 199 transition count 233
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 199 transition count 233
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 197 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 197 transition count 231
Applied a total of 84 rules in 23 ms. Remains 197 /239 variables (removed 42) and now considering 231/280 (removed 49) transitions.
// Phase 1: matrix 231 rows 197 cols
[2021-05-09 16:51:22] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:22] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 231 rows 197 cols
[2021-05-09 16:51:22] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:22] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
// Phase 1: matrix 231 rows 197 cols
[2021-05-09 16:51:22] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:23] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Finished structural reductions, in 1 iterations. Remains : 197/239 places, 231/280 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-12b-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s145 1), p1:(AND (NEQ s26 0) (NEQ s77 1) (NEQ s145 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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-12b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-08 finished in 379 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 280/280 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 280
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 225 transition count 267
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 225 transition count 267
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 218 transition count 257
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 218 transition count 257
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 212 transition count 251
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 212 transition count 251
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 59 place count 206 transition count 244
Iterating global reduction 1 with 6 rules applied. Total rules applied 65 place count 206 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 203 transition count 239
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 203 transition count 239
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 200 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 200 transition count 236
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 198 transition count 234
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 198 transition count 234
Applied a total of 81 rules in 28 ms. Remains 198 /239 variables (removed 41) and now considering 234/280 (removed 46) transitions.
// Phase 1: matrix 234 rows 198 cols
[2021-05-09 16:51:23] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:51:23] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 234 rows 198 cols
[2021-05-09 16:51:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:23] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 234 rows 198 cols
[2021-05-09 16:51:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:23] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 198/239 places, 234/280 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s166 0) (EQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 303 ms.
Product exploration explored 100000 steps with 50000 reset in 264 ms.
Graph (complete) has 402 edges and 198 vertex of which 197 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 217 ms.
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 198 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 198/198 places, 234/234 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 198 transition count 234
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 39 Pre rules applied. Total rules applied 25 place count 198 transition count 345
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 64 place count 198 transition count 345
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 198 transition count 345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 197 transition count 344
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 197 transition count 344
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -122
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 119 place count 197 transition count 466
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 128 place count 188 transition count 430
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 137 place count 188 transition count 430
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 164 place count 161 transition count 358
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 191 place count 161 transition count 358
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 218 place count 134 transition count 295
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 245 place count 134 transition count 295
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 254 place count 125 transition count 277
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 263 place count 125 transition count 277
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 281 place count 107 transition count 232
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 299 place count 107 transition count 232
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 335 place count 71 transition count 142
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 371 place count 71 transition count 142
Deduced a syphon composed of 44 places in 0 ms
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 1 with 19 rules applied. Total rules applied 390 place count 71 transition count 123
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 393 place count 68 transition count 117
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 396 place count 68 transition count 117
Deduced a syphon composed of 41 places in 0 ms
Applied a total of 396 rules in 49 ms. Remains 68 /198 variables (removed 130) and now considering 117/234 (removed 117) transitions.
[2021-05-09 16:51:24] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 16:51:24] [INFO ] Flow matrix only has 109 transitions (discarded 8 similar events)
// Phase 1: matrix 109 rows 68 cols
[2021-05-09 16:51:24] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:51:24] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/198 places, 117/234 transitions.
Product exploration explored 100000 steps with 50000 reset in 585 ms.
Product exploration explored 100000 steps with 50000 reset in 510 ms.
[2021-05-09 16:51:26] [INFO ] Flatten gal took : 12 ms
[2021-05-09 16:51:26] [INFO ] Flatten gal took : 10 ms
[2021-05-09 16:51:26] [INFO ] Time to serialize gal into /tmp/LTL6488790305004049315.gal : 7 ms
[2021-05-09 16:51:26] [INFO ] Time to serialize properties into /tmp/LTL16941905964070549993.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6488790305004049315.gal, -t, CGAL, -LTL, /tmp/LTL16941905964070549993.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/LTL6488790305004049315.gal -t CGAL -LTL /tmp/LTL16941905964070549993.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p295==0)||(p264==1))"))))
Formula 0 simplified : !XF"((p295==0)||(p264==1))"
Detected timeout of ITS tools.
[2021-05-09 16:51:41] [INFO ] Flatten gal took : 12 ms
[2021-05-09 16:51:41] [INFO ] Applying decomposition
[2021-05-09 16:51:41] [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/graph3415100460047921337.txt, -o, /tmp/graph3415100460047921337.bin, -w, /tmp/graph3415100460047921337.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/graph3415100460047921337.bin, -l, -1, -v, -w, /tmp/graph3415100460047921337.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 16:51:41] [INFO ] Decomposing Gal with order
[2021-05-09 16:51:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 16:51:41] [INFO ] Removed a total of 93 redundant transitions.
[2021-05-09 16:51:41] [INFO ] Flatten gal took : 42 ms
[2021-05-09 16:51:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 5 ms.
[2021-05-09 16:51:41] [INFO ] Time to serialize gal into /tmp/LTL9239837095171226230.gal : 4 ms
[2021-05-09 16:51:41] [INFO ] Time to serialize properties into /tmp/LTL8052701204034915936.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/LTL9239837095171226230.gal, -t, CGAL, -LTL, /tmp/LTL8052701204034915936.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/LTL9239837095171226230.gal -t CGAL -LTL /tmp/LTL8052701204034915936.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i4.u59.p295==0)||(i3.u7.p264==1))"))))
Formula 0 simplified : !XF"((i4.u59.p295==0)||(i3.u7.p264==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17629516126046127723
[2021-05-09 16:51:56] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17629516126046127723
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/ltsmin17629516126046127723]
Compilation finished in 964 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17629516126046127723]
Link finished in 38 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin17629516126046127723]
LTSmin run took 413 ms.
FORMULA DiscoveryGPU-PT-12b-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-12b-09 finished in 34634 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 280/280 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 280
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 224 transition count 265
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 224 transition count 265
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 217 transition count 256
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 217 transition count 256
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 211 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 211 transition count 250
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 206 transition count 244
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 206 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 203 transition count 239
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 203 transition count 239
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 200 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 200 transition count 236
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 198 transition count 234
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 198 transition count 234
Applied a total of 81 rules in 17 ms. Remains 198 /239 variables (removed 41) and now considering 234/280 (removed 46) transitions.
// Phase 1: matrix 234 rows 198 cols
[2021-05-09 16:51:57] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:57] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 234 rows 198 cols
[2021-05-09 16:51:57] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:57] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 234 rows 198 cols
[2021-05-09 16:51:57] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:58] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 1 iterations. Remains : 198/239 places, 234/280 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s95 0) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 301 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-12 finished in 330 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p1 U X(p2))||p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 280/280 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 280
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 225 transition count 266
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 225 transition count 266
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 218 transition count 257
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 218 transition count 257
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 212 transition count 251
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 212 transition count 251
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 207 transition count 245
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 207 transition count 245
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 204 transition count 240
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 204 transition count 240
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 201 transition count 237
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 201 transition count 237
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 199 transition count 235
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 199 transition count 235
Applied a total of 79 rules in 17 ms. Remains 199 /239 variables (removed 40) and now considering 235/280 (removed 45) transitions.
// Phase 1: matrix 235 rows 199 cols
[2021-05-09 16:51:58] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:51:58] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 235 rows 199 cols
[2021-05-09 16:51:58] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:58] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 235 rows 199 cols
[2021-05-09 16:51:58] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:58] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 1 iterations. Remains : 199/239 places, 235/280 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Running random walk in product with property : DiscoveryGPU-PT-12b-15 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) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s92 0) (EQ s110 1)), p1:(AND (EQ s110 0) (EQ s92 1)), p2:(OR (EQ s92 0) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 267 reset in 207 ms.
Stack based approach found an accepted trace after 31583 steps with 86 reset with depth 292 and stack size 287 in 76 ms.
FORMULA DiscoveryGPU-PT-12b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-15 finished in 651 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620579119586

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-12b"
export BK_EXAMINATION="LTLCardinality"
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-12b, examination is LTLCardinality"
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-162048875300340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-12b.tgz
mv DiscoveryGPU-PT-12b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;