Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260109900123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DiscoveryGPU-PT-13b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109900123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 8.3K Apr 30 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 30 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 07:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 30 07:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 97K May 10 09:33 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-13b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652634442622

Running Version 202205111006
[2022-05-15 17:07:23] [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]
[2022-05-15 17:07:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 17:07:23] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2022-05-15 17:07:23] [INFO ] Transformed 380 places.
[2022-05-15 17:07:23] [INFO ] Transformed 404 transitions.
[2022-05-15 17:07:23] [INFO ] Found NUPN structural information;
[2022-05-15 17:07:23] [INFO ] Parsed PT model containing 380 places and 404 transitions in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 404/404 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 356 transition count 404
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 89 place count 291 transition count 339
Iterating global reduction 1 with 65 rules applied. Total rules applied 154 place count 291 transition count 339
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 168 place count 277 transition count 325
Iterating global reduction 1 with 14 rules applied. Total rules applied 182 place count 277 transition count 325
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 194 place count 265 transition count 313
Iterating global reduction 1 with 12 rules applied. Total rules applied 206 place count 265 transition count 313
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 217 place count 254 transition count 302
Iterating global reduction 1 with 11 rules applied. Total rules applied 228 place count 254 transition count 302
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 239 place count 243 transition count 280
Iterating global reduction 1 with 11 rules applied. Total rules applied 250 place count 243 transition count 280
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 261 place count 232 transition count 269
Iterating global reduction 1 with 11 rules applied. Total rules applied 272 place count 232 transition count 269
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 281 place count 223 transition count 260
Iterating global reduction 1 with 9 rules applied. Total rules applied 290 place count 223 transition count 260
Applied a total of 290 rules in 103 ms. Remains 223 /380 variables (removed 157) and now considering 260/404 (removed 144) transitions.
// Phase 1: matrix 260 rows 223 cols
[2022-05-15 17:07:24] [INFO ] Computed 2 place invariants in 18 ms
[2022-05-15 17:07:24] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 260 rows 223 cols
[2022-05-15 17:07:24] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 17:07:24] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
// Phase 1: matrix 260 rows 223 cols
[2022-05-15 17:07:24] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:07:24] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 223/380 places, 260/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/380 places, 260/404 transitions.
Support contains 26 out of 223 places after structural reductions.
[2022-05-15 17:07:24] [INFO ] Flatten gal took : 43 ms
[2022-05-15 17:07:24] [INFO ] Flatten gal took : 19 ms
[2022-05-15 17:07:25] [INFO ] Input system was already deterministic with 260 transitions.
Support contains 24 out of 223 places (down from 26) after GAL structural reductions.
Finished random walk after 255 steps, including 0 resets, run visited all 13 properties in 38 ms. (steps per millisecond=6 )
Computed a total of 43 stabilizing places and 43 stable transitions
Graph (complete) has 443 edges and 223 vertex of which 218 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(p0)||(G(p2)&&p1)))))'
Support contains 5 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 260/260 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 221 transition count 260
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 214 transition count 253
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 214 transition count 253
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 213 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 213 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 212 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 212 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 211 transition count 249
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 211 transition count 249
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 210 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 210 transition count 248
Applied a total of 24 rules in 57 ms. Remains 210 /223 variables (removed 13) and now considering 248/260 (removed 12) transitions.
// Phase 1: matrix 248 rows 210 cols
[2022-05-15 17:07:25] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 17:07:25] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 248 rows 210 cols
[2022-05-15 17:07:25] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 17:07:25] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
// Phase 1: matrix 248 rows 210 cols
[2022-05-15 17:07:25] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 17:07:25] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 210/223 places, 248/260 transitions.
Finished structural reductions, in 1 iterations. Remains : 210/223 places, 248/260 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s12 1), p1:(AND (EQ s136 0) (EQ s44 1)), p2:(OR (AND (EQ s136 0) (EQ s44 1)) (AND (EQ s95 0) (EQ s45 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2364 reset in 284 ms.
Stack based approach found an accepted trace after 721 steps with 17 reset with depth 24 and stack size 24 in 2 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-01 finished in 1011 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(!(!p0 U X(p0))))'
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 260/260 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 221 transition count 260
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 215 transition count 254
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 215 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 214 transition count 253
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 214 transition count 253
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 213 transition count 251
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 213 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 212 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 212 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 211 transition count 249
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 211 transition count 249
Applied a total of 22 rules in 20 ms. Remains 211 /223 variables (removed 12) and now considering 249/260 (removed 11) transitions.
// Phase 1: matrix 249 rows 211 cols
[2022-05-15 17:07:26] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:07:26] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 249 rows 211 cols
[2022-05-15 17:07:26] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:07:26] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
// Phase 1: matrix 249 rows 211 cols
[2022-05-15 17:07:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:26] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 211/223 places, 249/260 transitions.
Finished structural reductions, in 1 iterations. Remains : 211/223 places, 249/260 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, p0, p0]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s185 0) (EQ s187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-04 finished in 459 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U X(p1))))'
Support contains 4 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 260/260 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 260
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 216 transition count 254
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 216 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 215 transition count 253
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 215 transition count 253
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 214 transition count 251
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 214 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 213 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 213 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 212 transition count 249
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 212 transition count 249
Applied a total of 21 rules in 19 ms. Remains 212 /223 variables (removed 11) and now considering 249/260 (removed 11) transitions.
// Phase 1: matrix 249 rows 212 cols
[2022-05-15 17:07:26] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:07:26] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 249 rows 212 cols
[2022-05-15 17:07:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:26] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
// Phase 1: matrix 249 rows 212 cols
[2022-05-15 17:07:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:27] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 212/223 places, 249/260 transitions.
Finished structural reductions, in 1 iterations. Remains : 212/223 places, 249/260 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(OR (EQ s104 0) (EQ s67 1)), p0:(OR (EQ s58 0) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 163 ms.
Product exploration explored 100000 steps with 33333 reset in 167 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 428 edges and 212 vertex of which 209 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-05 finished in 924 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 260/260 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 221 transition count 260
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 214 transition count 253
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 214 transition count 253
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 213 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 213 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 212 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 212 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 211 transition count 249
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 211 transition count 249
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 210 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 210 transition count 248
Applied a total of 24 rules in 19 ms. Remains 210 /223 variables (removed 13) and now considering 248/260 (removed 12) transitions.
// Phase 1: matrix 248 rows 210 cols
[2022-05-15 17:07:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:07:27] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 248 rows 210 cols
[2022-05-15 17:07:27] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:07:27] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
// Phase 1: matrix 248 rows 210 cols
[2022-05-15 17:07:27] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 17:07:27] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 210/223 places, 248/260 transitions.
Finished structural reductions, in 1 iterations. Remains : 210/223 places, 248/260 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s99 0) (EQ s130 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 123 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-06 finished in 417 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 260/260 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 260
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 216 transition count 254
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 216 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 215 transition count 253
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 215 transition count 253
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 214 transition count 251
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 214 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 213 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 213 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 212 transition count 249
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 212 transition count 249
Applied a total of 21 rules in 17 ms. Remains 212 /223 variables (removed 11) and now considering 249/260 (removed 11) transitions.
// Phase 1: matrix 249 rows 212 cols
[2022-05-15 17:07:28] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:07:28] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 249 rows 212 cols
[2022-05-15 17:07:28] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:07:28] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
// Phase 1: matrix 249 rows 212 cols
[2022-05-15 17:07:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:28] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 212/223 places, 249/260 transitions.
Finished structural reductions, in 1 iterations. Remains : 212/223 places, 249/260 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s181 0) (EQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-07 finished in 477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 260/260 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 221 transition count 260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 216 transition count 255
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 216 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 215 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 215 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 214 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 214 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 213 transition count 251
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 213 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 212 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 212 transition count 250
Applied a total of 20 rules in 18 ms. Remains 212 /223 variables (removed 11) and now considering 250/260 (removed 10) transitions.
// Phase 1: matrix 250 rows 212 cols
[2022-05-15 17:07:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:28] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 250 rows 212 cols
[2022-05-15 17:07:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:28] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 212 cols
[2022-05-15 17:07:28] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:07:28] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 212/223 places, 250/260 transitions.
Finished structural reductions, in 1 iterations. Remains : 212/223 places, 250/260 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s208 0) (EQ s191 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Computed a total of 42 stabilizing places and 42 stable transitions
Graph (complete) has 429 edges and 212 vertex of which 211 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 42 stabilizing places and 42 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-08 finished in 788 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 260/260 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 221 transition count 260
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 214 transition count 253
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 214 transition count 253
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 213 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 213 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 212 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 212 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 211 transition count 249
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 211 transition count 249
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 210 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 210 transition count 248
Applied a total of 24 rules in 16 ms. Remains 210 /223 variables (removed 13) and now considering 248/260 (removed 12) transitions.
// Phase 1: matrix 248 rows 210 cols
[2022-05-15 17:07:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:29] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 248 rows 210 cols
[2022-05-15 17:07:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:29] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 248 rows 210 cols
[2022-05-15 17:07:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:29] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 210/223 places, 248/260 transitions.
Finished structural reductions, in 1 iterations. Remains : 210/223 places, 248/260 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s144 0) (EQ s137 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 427 edges and 210 vertex of which 209 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-10 finished in 758 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F(p0))))'
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 260/260 transitions.
Graph (complete) has 443 edges and 223 vertex of which 218 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 217 transition count 228
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 189 transition count 228
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 57 place count 189 transition count 187
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 139 place count 148 transition count 187
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 141 place count 146 transition count 185
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 146 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 145 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 145 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 144 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 144 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 143 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 143 transition count 181
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 259 place count 88 transition count 126
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 270 place count 77 transition count 104
Iterating global reduction 2 with 11 rules applied. Total rules applied 281 place count 77 transition count 104
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 292 place count 66 transition count 93
Iterating global reduction 2 with 11 rules applied. Total rules applied 303 place count 66 transition count 93
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 314 place count 55 transition count 71
Iterating global reduction 2 with 11 rules applied. Total rules applied 325 place count 55 transition count 71
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 335 place count 45 transition count 61
Iterating global reduction 2 with 10 rules applied. Total rules applied 345 place count 45 transition count 61
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 355 place count 35 transition count 41
Iterating global reduction 2 with 10 rules applied. Total rules applied 365 place count 35 transition count 41
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 375 place count 25 transition count 31
Iterating global reduction 2 with 10 rules applied. Total rules applied 385 place count 25 transition count 31
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 386 place count 25 transition count 30
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 387 place count 25 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 389 place count 23 transition count 28
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 25 edges and 21 vertex of which 18 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 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 2 with 7 rules applied. Total rules applied 396 place count 18 transition count 21
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 400 place count 14 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 402 place count 13 transition count 20
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 404 place count 12 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 406 place count 12 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 409 place count 9 transition count 15
Applied a total of 409 rules in 58 ms. Remains 9 /223 variables (removed 214) and now considering 15/260 (removed 245) transitions.
[2022-05-15 17:07:30] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 9 cols
[2022-05-15 17:07:30] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 17:07:30] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-15 17:07:30] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 9 cols
[2022-05-15 17:07:30] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 17:07:30] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-15 17:07:30] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:07:30] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 9 cols
[2022-05-15 17:07:30] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 17:07:30] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/223 places, 15/260 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/223 places, 15/260 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-11 automaton TGBA Formula[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:(OR (EQ s7 0) (EQ s4 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 8 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-11 finished in 215 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((p0 U X(p1))))))'
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 260/260 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 221 transition count 260
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 215 transition count 254
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 215 transition count 254
Applied a total of 14 rules in 14 ms. Remains 215 /223 variables (removed 8) and now considering 254/260 (removed 6) transitions.
// Phase 1: matrix 254 rows 215 cols
[2022-05-15 17:07:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:30] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 254 rows 215 cols
[2022-05-15 17:07:30] [INFO ] Computed 2 place invariants in 9 ms
[2022-05-15 17:07:30] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
// Phase 1: matrix 254 rows 215 cols
[2022-05-15 17:07:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:30] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 215/223 places, 254/260 transitions.
Finished structural reductions, in 1 iterations. Remains : 215/223 places, 254/260 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s203 1), p1:(OR (EQ s96 0) (EQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33318 reset in 152 ms.
Product exploration explored 100000 steps with 33316 reset in 161 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 437 edges and 215 vertex of which 214 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 413 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :3
Finished Best-First random walk after 840 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=280 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 452 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 254/254 transitions.
Applied a total of 0 rules in 7 ms. Remains 215 /215 variables (removed 0) and now considering 254/254 (removed 0) transitions.
// Phase 1: matrix 254 rows 215 cols
[2022-05-15 17:07:32] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:07:32] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 254 rows 215 cols
[2022-05-15 17:07:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:32] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
// Phase 1: matrix 254 rows 215 cols
[2022-05-15 17:07:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:32] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 215/215 places, 254/254 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 437 edges and 215 vertex of which 214 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 326 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :3
Finished Best-First random walk after 1364 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=454 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 419 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33402 reset in 141 ms.
Product exploration explored 100000 steps with 33397 reset in 145 ms.
Built C files in :
/tmp/ltsmin8411134216688815182
[2022-05-15 17:07:34] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8411134216688815182
Running compilation step : cd /tmp/ltsmin8411134216688815182;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 458 ms.
Running link step : cd /tmp/ltsmin8411134216688815182;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8411134216688815182;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14542137720440251070.hoa' '--buchi-type=spotba'
LTSmin run took 621 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-13 finished in 5318 ms.
All properties solved by simple procedures.
Total runtime 11851 ms.

BK_STOP 1652634455661

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-13b"
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-13b, 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 r078-tall-165260109900123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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