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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 6.2K Apr 30 07:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 07:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 07:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 07:11 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.7K May 9 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 111K 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-15b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652637272642

Running Version 202205111006
[2022-05-15 17:54:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 17:54:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 17:54:34] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2022-05-15 17:54:34] [INFO ] Transformed 436 places.
[2022-05-15 17:54:34] [INFO ] Transformed 464 transitions.
[2022-05-15 17:54:34] [INFO ] Found NUPN structural information;
[2022-05-15 17:54:34] [INFO ] Parsed PT model containing 436 places and 464 transitions in 218 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 91 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 464/464 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 406 transition count 464
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 104 place count 332 transition count 390
Iterating global reduction 1 with 74 rules applied. Total rules applied 178 place count 332 transition count 390
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 193 place count 317 transition count 375
Iterating global reduction 1 with 15 rules applied. Total rules applied 208 place count 317 transition count 375
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 220 place count 305 transition count 363
Iterating global reduction 1 with 12 rules applied. Total rules applied 232 place count 305 transition count 363
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 239 place count 298 transition count 356
Iterating global reduction 1 with 7 rules applied. Total rules applied 246 place count 298 transition count 356
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 253 place count 291 transition count 342
Iterating global reduction 1 with 7 rules applied. Total rules applied 260 place count 291 transition count 342
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 266 place count 285 transition count 336
Iterating global reduction 1 with 6 rules applied. Total rules applied 272 place count 285 transition count 336
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 277 place count 280 transition count 331
Iterating global reduction 1 with 5 rules applied. Total rules applied 282 place count 280 transition count 331
Applied a total of 282 rules in 129 ms. Remains 280 /436 variables (removed 156) and now considering 331/464 (removed 133) transitions.
// Phase 1: matrix 331 rows 280 cols
[2022-05-15 17:54:34] [INFO ] Computed 2 place invariants in 15 ms
[2022-05-15 17:54:34] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 331 rows 280 cols
[2022-05-15 17:54:34] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:54:34] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
// Phase 1: matrix 331 rows 280 cols
[2022-05-15 17:54:34] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:54:35] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 280/436 places, 331/464 transitions.
Finished structural reductions, in 1 iterations. Remains : 280/436 places, 331/464 transitions.
Support contains 23 out of 280 places after structural reductions.
[2022-05-15 17:54:35] [INFO ] Flatten gal took : 59 ms
[2022-05-15 17:54:35] [INFO ] Flatten gal took : 42 ms
[2022-05-15 17:54:35] [INFO ] Input system was already deterministic with 331 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 19) seen :18
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 331 rows 280 cols
[2022-05-15 17:54:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:54:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 17:54:36] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 564 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||F(p1)))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 321
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 321
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 263 transition count 312
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 263 transition count 312
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 257 transition count 304
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 257 transition count 304
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 251 transition count 297
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 251 transition count 297
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 247 transition count 292
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 247 transition count 292
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 245 transition count 290
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 245 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 244 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 244 transition count 289
Applied a total of 72 rules in 48 ms. Remains 244 /280 variables (removed 36) and now considering 289/331 (removed 42) transitions.
// Phase 1: matrix 289 rows 244 cols
[2022-05-15 17:54:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:54:36] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 289 rows 244 cols
[2022-05-15 17:54:36] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:54:36] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
// Phase 1: matrix 289 rows 244 cols
[2022-05-15 17:54:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:54:36] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 244/280 places, 289/331 transitions.
Finished structural reductions, in 1 iterations. Remains : 244/280 places, 289/331 transitions.
Stuttering acceptance computed with spot in 1527 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s151 1) (EQ s240 1)), p0:(AND (OR (EQ s137 0) (EQ s243 0)) (OR (EQ s151 0) (EQ s240 0)))], 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][false, false, false]]
Product exploration explored 100000 steps with 2868 reset in 486 ms.
Product exploration explored 100000 steps with 2858 reset in 224 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 497 edges and 244 vertex of which 243 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 1506 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2831 steps, including 5 resets, run visited all 3 properties in 9 ms. (steps per millisecond=314 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 264 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 289/289 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 289/289 (removed 0) transitions.
// Phase 1: matrix 289 rows 244 cols
[2022-05-15 17:54:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:54:41] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 289 rows 244 cols
[2022-05-15 17:54:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:54:41] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
// Phase 1: matrix 289 rows 244 cols
[2022-05-15 17:54:41] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:54:41] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 244/244 places, 289/289 transitions.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 497 edges and 244 vertex of which 243 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 637 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 4028 steps, including 8 resets, run visited all 3 properties in 20 ms. (steps per millisecond=201 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 262 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2857 reset in 174 ms.
Product exploration explored 100000 steps with 2841 reset in 260 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 289/289 transitions.
Graph (complete) has 497 edges and 244 vertex of which 243 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 243 transition count 288
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 32 place count 243 transition count 288
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 78 place count 243 transition count 288
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 111 place count 243 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 242 transition count 302
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 242 transition count 302
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -62
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 144 place count 242 transition count 364
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 157 place count 229 transition count 338
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 170 place count 229 transition count 338
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 209 place count 190 transition count 273
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 248 place count 190 transition count 273
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 287 place count 151 transition count 208
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 326 place count 151 transition count 208
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 339 place count 138 transition count 195
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 352 place count 138 transition count 195
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 378 place count 112 transition count 156
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 404 place count 112 transition count 156
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 456 place count 60 transition count 78
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 508 place count 60 transition count 78
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 508 rules in 97 ms. Remains 60 /244 variables (removed 184) and now considering 78/289 (removed 211) transitions.
[2022-05-15 17:54:43] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 17:54:43] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
// Phase 1: matrix 75 rows 60 cols
[2022-05-15 17:54:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:54:43] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/244 places, 78/289 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/244 places, 78/289 transitions.
Product exploration explored 100000 steps with 13265 reset in 283 ms.
Product exploration explored 100000 steps with 13213 reset in 211 ms.
Built C files in :
/tmp/ltsmin11237222014908991658
[2022-05-15 17:54:45] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11237222014908991658
Running compilation step : cd /tmp/ltsmin11237222014908991658;'/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 469 ms.
Running link step : cd /tmp/ltsmin11237222014908991658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11237222014908991658;'/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/stateBased17592154914903964088.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 289/289 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 289/289 (removed 0) transitions.
// Phase 1: matrix 289 rows 244 cols
[2022-05-15 17:55:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:55:00] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 289 rows 244 cols
[2022-05-15 17:55:00] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 17:55:00] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 289 rows 244 cols
[2022-05-15 17:55:00] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 17:55:00] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 244/244 places, 289/289 transitions.
Built C files in :
/tmp/ltsmin3483828805220009243
[2022-05-15 17:55:00] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3483828805220009243
Running compilation step : cd /tmp/ltsmin3483828805220009243;'/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 382 ms.
Running link step : cd /tmp/ltsmin3483828805220009243;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3483828805220009243;'/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/stateBased3577872844803748994.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 17:55:16] [INFO ] Flatten gal took : 18 ms
[2022-05-15 17:55:16] [INFO ] Flatten gal took : 22 ms
[2022-05-15 17:55:16] [INFO ] Time to serialize gal into /tmp/LTL9421559400507565953.gal : 4 ms
[2022-05-15 17:55:16] [INFO ] Time to serialize properties into /tmp/LTL9642754921488696318.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9421559400507565953.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9642754921488696318.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9421559...266
Read 1 LTL properties
Checking formula 0 : !(((G(X("(((p239==0)||(p434==0))&&((p257==0)||(p427==0)))")))||(F("((p257==1)&&(p427==1))"))))
Formula 0 simplified : !(GX"(((p239==0)||(p434==0))&&((p257==0)||(p427==0)))" | F"((p257==1)&&(p427==1))")
Detected timeout of ITS tools.
[2022-05-15 17:55:31] [INFO ] Flatten gal took : 17 ms
[2022-05-15 17:55:31] [INFO ] Applying decomposition
[2022-05-15 17:55:31] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17056998764798865388.txt' '-o' '/tmp/graph17056998764798865388.bin' '-w' '/tmp/graph17056998764798865388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17056998764798865388.bin' '-l' '-1' '-v' '-w' '/tmp/graph17056998764798865388.weights' '-q' '0' '-e' '0.001'
[2022-05-15 17:55:31] [INFO ] Decomposing Gal with order
[2022-05-15 17:55:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 17:55:31] [INFO ] Removed a total of 119 redundant transitions.
[2022-05-15 17:55:31] [INFO ] Flatten gal took : 50 ms
[2022-05-15 17:55:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2022-05-15 17:55:31] [INFO ] Time to serialize gal into /tmp/LTL7138896231263916999.gal : 4 ms
[2022-05-15 17:55:31] [INFO ] Time to serialize properties into /tmp/LTL9184587546681813816.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7138896231263916999.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9184587546681813816.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7138896...245
Read 1 LTL properties
Checking formula 0 : !(((G(X("(((i13.u48.p239==0)||(i13.u86.p434==0))&&((i1.i0.u53.p257==0)||(u85.p427==0)))")))||(F("((i1.i0.u53.p257==1)&&(u85.p427==1))"...159
Formula 0 simplified : !(GX"(((i13.u48.p239==0)||(i13.u86.p434==0))&&((i1.i0.u53.p257==0)||(u85.p427==0)))" | F"((i1.i0.u53.p257==1)&&(u85.p427==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18193627898820284586
[2022-05-15 17:55:46] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18193627898820284586
Running compilation step : cd /tmp/ltsmin18193627898820284586;'/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 375 ms.
Running link step : cd /tmp/ltsmin18193627898820284586;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18193627898820284586;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((LTLAPp0==true)))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-00 finished in 85319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 321
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 321
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 263 transition count 312
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 263 transition count 312
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 257 transition count 304
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 257 transition count 304
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 251 transition count 297
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 251 transition count 297
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 247 transition count 292
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 247 transition count 292
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 245 transition count 290
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 245 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 244 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 244 transition count 289
Applied a total of 72 rules in 25 ms. Remains 244 /280 variables (removed 36) and now considering 289/331 (removed 42) transitions.
// Phase 1: matrix 289 rows 244 cols
[2022-05-15 17:56:01] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:56:01] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 289 rows 244 cols
[2022-05-15 17:56:01] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:56:01] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
// Phase 1: matrix 289 rows 244 cols
[2022-05-15 17:56:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:56:02] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 244/280 places, 289/331 transitions.
Finished structural reductions, in 1 iterations. Remains : 244/280 places, 289/331 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-01 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:(AND (EQ s81 0) (EQ s103 0))], 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 390 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-01 finished in 492 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Graph (complete) has 564 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 277 transition count 288
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 237 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 236 transition count 287
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 83 place count 236 transition count 239
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 179 place count 188 transition count 239
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 187 place count 180 transition count 231
Iterating global reduction 3 with 8 rules applied. Total rules applied 195 place count 180 transition count 231
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 200 place count 175 transition count 224
Iterating global reduction 3 with 5 rules applied. Total rules applied 205 place count 175 transition count 224
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 210 place count 170 transition count 216
Iterating global reduction 3 with 5 rules applied. Total rules applied 215 place count 170 transition count 216
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 218 place count 167 transition count 213
Iterating global reduction 3 with 3 rules applied. Total rules applied 221 place count 167 transition count 213
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 353 place count 101 transition count 147
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 367 place count 87 transition count 120
Iterating global reduction 3 with 14 rules applied. Total rules applied 381 place count 87 transition count 120
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 395 place count 73 transition count 104
Iterating global reduction 3 with 14 rules applied. Total rules applied 409 place count 73 transition count 104
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 422 place count 60 transition count 79
Iterating global reduction 3 with 13 rules applied. Total rules applied 435 place count 60 transition count 79
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 448 place count 47 transition count 65
Iterating global reduction 3 with 13 rules applied. Total rules applied 461 place count 47 transition count 65
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 474 place count 34 transition count 40
Iterating global reduction 3 with 13 rules applied. Total rules applied 487 place count 34 transition count 40
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 500 place count 21 transition count 26
Iterating global reduction 3 with 13 rules applied. Total rules applied 513 place count 21 transition count 26
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 515 place count 19 transition count 23
Iterating global reduction 3 with 2 rules applied. Total rules applied 517 place count 19 transition count 23
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 518 place count 18 transition count 22
Iterating global reduction 3 with 1 rules applied. Total rules applied 519 place count 18 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 520 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 522 place count 16 transition count 19
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 16 edges and 14 vertex of which 11 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 527 place count 11 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 529 place count 9 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 533 place count 7 transition count 12
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 535 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 537 place count 5 transition count 8
Applied a total of 537 rules in 50 ms. Remains 5 /280 variables (removed 275) and now considering 8/331 (removed 323) transitions.
[2022-05-15 17:56:02] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-15 17:56:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 17:56:02] [INFO ] Implicit Places using invariants in 17 ms returned []
[2022-05-15 17:56:02] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-15 17:56:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 17:56:02] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-15 17:56:02] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:56:02] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-15 17:56:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 17:56:02] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/280 places, 8/331 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/280 places, 8/331 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-02 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:(EQ s3 0)], 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 3 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-02 finished in 216 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((((!G((p0 U !p0))&&!p0) U p1)||X(F(p1)))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Graph (complete) has 564 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 277 transition count 288
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 237 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 236 transition count 287
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 83 place count 236 transition count 241
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 175 place count 190 transition count 241
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 183 place count 182 transition count 233
Iterating global reduction 3 with 8 rules applied. Total rules applied 191 place count 182 transition count 233
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 196 place count 177 transition count 226
Iterating global reduction 3 with 5 rules applied. Total rules applied 201 place count 177 transition count 226
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 206 place count 172 transition count 218
Iterating global reduction 3 with 5 rules applied. Total rules applied 211 place count 172 transition count 218
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 214 place count 169 transition count 215
Iterating global reduction 3 with 3 rules applied. Total rules applied 217 place count 169 transition count 215
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 349 place count 103 transition count 149
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 363 place count 89 transition count 122
Iterating global reduction 3 with 14 rules applied. Total rules applied 377 place count 89 transition count 122
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 391 place count 75 transition count 106
Iterating global reduction 3 with 14 rules applied. Total rules applied 405 place count 75 transition count 106
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 419 place count 61 transition count 79
Iterating global reduction 3 with 14 rules applied. Total rules applied 433 place count 61 transition count 79
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 447 place count 47 transition count 64
Iterating global reduction 3 with 14 rules applied. Total rules applied 461 place count 47 transition count 64
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 473 place count 35 transition count 41
Iterating global reduction 3 with 12 rules applied. Total rules applied 485 place count 35 transition count 41
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 497 place count 23 transition count 28
Iterating global reduction 3 with 12 rules applied. Total rules applied 509 place count 23 transition count 28
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 511 place count 21 transition count 25
Iterating global reduction 3 with 2 rules applied. Total rules applied 513 place count 21 transition count 25
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 514 place count 20 transition count 24
Iterating global reduction 3 with 1 rules applied. Total rules applied 515 place count 20 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 516 place count 20 transition count 23
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 518 place count 18 transition count 21
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 520 place count 17 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 521 place count 16 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 521 place count 16 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 525 place count 14 transition count 18
Applied a total of 525 rules in 45 ms. Remains 14 /280 variables (removed 266) and now considering 18/331 (removed 313) transitions.
[2022-05-15 17:56:02] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 14 cols
[2022-05-15 17:56:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:56:02] [INFO ] Implicit Places using invariants in 17 ms returned []
[2022-05-15 17:56:02] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 14 cols
[2022-05-15 17:56:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:56:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 17:56:02] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-15 17:56:02] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:56:02] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 14 cols
[2022-05-15 17:56:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:56:02] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/280 places, 18/331 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/280 places, 18/331 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s8 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7806 reset in 106 ms.
Stack based approach found an accepted trace after 42 steps with 5 reset with depth 5 and stack size 5 in 3 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-04 finished in 284 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0) U p1))))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 321
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 321
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 263 transition count 311
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 263 transition count 311
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 256 transition count 302
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 256 transition count 302
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 249 transition count 294
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 249 transition count 294
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 245 transition count 289
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 245 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 243 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 243 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 242 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 242 transition count 286
Applied a total of 76 rules in 41 ms. Remains 242 /280 variables (removed 38) and now considering 286/331 (removed 45) transitions.
// Phase 1: matrix 286 rows 242 cols
[2022-05-15 17:56:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:56:02] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 286 rows 242 cols
[2022-05-15 17:56:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:56:02] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 286 rows 242 cols
[2022-05-15 17:56:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:56:02] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 242/280 places, 286/331 transitions.
Finished structural reductions, in 1 iterations. Remains : 242/280 places, 286/331 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(NEQ s9 1), p0:(AND (EQ s179 1) (EQ s241 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 168 ms.
Product exploration explored 100000 steps with 33333 reset in 158 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 492 edges and 242 vertex of which 241 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Detected a total of 47/242 stabilizing places and 47/286 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 3 factoid took 48 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-05 finished in 922 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 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 321
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 321
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 263 transition count 311
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 263 transition count 311
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 257 transition count 303
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 257 transition count 303
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 251 transition count 297
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 251 transition count 297
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 248 transition count 293
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 248 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 247 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 247 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 246 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 246 transition count 291
Applied a total of 68 rules in 31 ms. Remains 246 /280 variables (removed 34) and now considering 291/331 (removed 40) transitions.
// Phase 1: matrix 291 rows 246 cols
[2022-05-15 17:56:03] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:56:03] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 291 rows 246 cols
[2022-05-15 17:56:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:56:03] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
// Phase 1: matrix 291 rows 246 cols
[2022-05-15 17:56:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:56:03] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 246/280 places, 291/331 transitions.
Finished structural reductions, in 1 iterations. Remains : 246/280 places, 291/331 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s124 1) (EQ s242 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]]
Stuttering criterion allowed to conclude after 491 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-06 finished in 450 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Graph (complete) has 564 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 277 transition count 288
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 237 transition count 288
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 81 place count 237 transition count 241
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 175 place count 190 transition count 241
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 183 place count 182 transition count 233
Iterating global reduction 2 with 8 rules applied. Total rules applied 191 place count 182 transition count 233
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 196 place count 177 transition count 226
Iterating global reduction 2 with 5 rules applied. Total rules applied 201 place count 177 transition count 226
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 206 place count 172 transition count 218
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 172 transition count 218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 214 place count 169 transition count 215
Iterating global reduction 2 with 3 rules applied. Total rules applied 217 place count 169 transition count 215
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 351 place count 102 transition count 148
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 365 place count 88 transition count 121
Iterating global reduction 2 with 14 rules applied. Total rules applied 379 place count 88 transition count 121
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 393 place count 74 transition count 105
Iterating global reduction 2 with 14 rules applied. Total rules applied 407 place count 74 transition count 105
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 421 place count 60 transition count 78
Iterating global reduction 2 with 14 rules applied. Total rules applied 435 place count 60 transition count 78
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 448 place count 47 transition count 64
Iterating global reduction 2 with 13 rules applied. Total rules applied 461 place count 47 transition count 64
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 474 place count 34 transition count 39
Iterating global reduction 2 with 13 rules applied. Total rules applied 487 place count 34 transition count 39
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 500 place count 21 transition count 25
Iterating global reduction 2 with 13 rules applied. Total rules applied 513 place count 21 transition count 25
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 515 place count 19 transition count 22
Iterating global reduction 2 with 2 rules applied. Total rules applied 517 place count 19 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 518 place count 18 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 519 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 521 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 25 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 524 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 13 transition count 17
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 527 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 529 place count 10 transition count 15
Applied a total of 529 rules in 33 ms. Remains 10 /280 variables (removed 270) and now considering 15/331 (removed 316) transitions.
[2022-05-15 17:56:03] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 10 cols
[2022-05-15 17:56:03] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:56:04] [INFO ] Implicit Places using invariants in 22 ms returned []
[2022-05-15 17:56:04] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 10 cols
[2022-05-15 17:56:04] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:56:04] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-15 17:56:04] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:56:04] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 10 cols
[2022-05-15 17:56:04] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:56:04] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/280 places, 15/331 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/280 places, 15/331 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s6 1) (NEQ s9 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 24 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-07 finished in 171 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))&&X((F(G(p0))||!p1))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 321
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 321
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 262 transition count 310
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 262 transition count 310
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 255 transition count 301
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 255 transition count 301
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 248 transition count 293
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 248 transition count 293
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 244 transition count 288
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 244 transition count 288
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 242 transition count 286
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 242 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 241 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 241 transition count 285
Applied a total of 78 rules in 30 ms. Remains 241 /280 variables (removed 39) and now considering 285/331 (removed 46) transitions.
// Phase 1: matrix 285 rows 241 cols
[2022-05-15 17:56:04] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:56:04] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 285 rows 241 cols
[2022-05-15 17:56:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:56:04] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
// Phase 1: matrix 285 rows 241 cols
[2022-05-15 17:56:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:56:04] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/280 places, 285/331 transitions.
Finished structural reductions, in 1 iterations. Remains : 241/280 places, 285/331 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1), (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(OR p1 p0), acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s67 1), p0:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 510 steps with 0 reset in 10 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-09 finished in 588 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F((F(!p0)&&!p0)) U !(F(p1)||p2)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 272 transition count 323
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 272 transition count 323
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 266 transition count 315
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 266 transition count 315
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 261 transition count 308
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 261 transition count 308
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 256 transition count 302
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 256 transition count 302
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 253 transition count 299
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 253 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 252 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 252 transition count 298
Applied a total of 56 rules in 27 ms. Remains 252 /280 variables (removed 28) and now considering 298/331 (removed 33) transitions.
// Phase 1: matrix 298 rows 252 cols
[2022-05-15 17:56:04] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:56:04] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 298 rows 252 cols
[2022-05-15 17:56:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:56:04] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
// Phase 1: matrix 298 rows 252 cols
[2022-05-15 17:56:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:56:05] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/280 places, 298/331 transitions.
Finished structural reductions, in 1 iterations. Remains : 252/280 places, 298/331 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR p2 p1), (OR p2 p1), p0, (OR p2 p1), p1]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s212 1), p0:(AND (EQ s193 1) (EQ s251 1)), p1:(EQ s210 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 209 reset in 242 ms.
Stack based approach found an accepted trace after 907 steps with 1 reset with depth 408 and stack size 406 in 8 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-13 finished in 839 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||!((F(X(F(p0)))||p1) U (p2 U G(p2)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 271 transition count 322
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 271 transition count 322
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 265 transition count 314
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 265 transition count 314
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 260 transition count 308
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 260 transition count 308
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 255 transition count 302
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 255 transition count 302
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 252 transition count 298
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 252 transition count 298
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 250 transition count 296
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 250 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 249 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 249 transition count 295
Applied a total of 62 rules in 23 ms. Remains 249 /280 variables (removed 31) and now considering 295/331 (removed 36) transitions.
// Phase 1: matrix 295 rows 249 cols
[2022-05-15 17:56:05] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:56:05] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 295 rows 249 cols
[2022-05-15 17:56:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:56:05] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
// Phase 1: matrix 295 rows 249 cols
[2022-05-15 17:56:05] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:56:05] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 249/280 places, 295/331 transitions.
Finished structural reductions, in 1 iterations. Remains : 249/280 places, 295/331 transitions.
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) p2), false, (AND p2 (NOT p0)), (AND (NOT p0) p2), (AND p0 p2), p2, p2]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p2 p0), acceptance={} source=4 dest: 5}, { cond=(AND p1 p0), acceptance={} source=4 dest: 6}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s53 1), p2:(AND (EQ s86 1) (EQ s248 1)), p0:(EQ s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 205 reset in 181 ms.
Product exploration explored 100000 steps with 206 reset in 189 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 507 edges and 249 vertex of which 248 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 399 ms. Reduced automaton from 7 states, 15 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 141 ms :[(AND p0 p2), (AND p0 p2), p2, p2]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 295 rows 249 cols
[2022-05-15 17:56:07] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:56:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 17:56:07] [INFO ] After 89ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-15 17:56:07] [INFO ] After 109ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-15 17:56:07] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2022-05-15 17:56:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 17:56:07] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 17:56:07] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-15 17:56:07] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 55 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p2 p0))]
Knowledge based reduction with 10 factoid took 463 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 157 ms :[(AND p0 p2), (AND p0 p2), p2, p2]
Stuttering acceptance computed with spot in 151 ms :[(AND p0 p2), (AND p0 p2), p2, p2]
Support contains 4 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 295/295 transitions.
Applied a total of 0 rules in 6 ms. Remains 249 /249 variables (removed 0) and now considering 295/295 (removed 0) transitions.
// Phase 1: matrix 295 rows 249 cols
[2022-05-15 17:56:08] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:56:08] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 295 rows 249 cols
[2022-05-15 17:56:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:56:08] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
// Phase 1: matrix 295 rows 249 cols
[2022-05-15 17:56:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:56:09] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 249/249 places, 295/295 transitions.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 507 edges and 249 vertex of which 248 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p0))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 p0)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 451 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 179 ms :[(AND p0 p2), (AND p0 p2), p2, p2]
Incomplete random walk after 10000 steps, including 21 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :1
Finished Best-First random walk after 2762 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=394 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p0))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 p0)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p2 p0))]
Knowledge based reduction with 9 factoid took 391 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 143 ms :[(AND p0 p2), (AND p0 p2), p2, p2]
Stuttering acceptance computed with spot in 150 ms :[(AND p0 p2), (AND p0 p2), p2, p2]
Stuttering acceptance computed with spot in 147 ms :[(AND p0 p2), (AND p0 p2), p2, p2]
Product exploration explored 100000 steps with 206 reset in 187 ms.
Product exploration explored 100000 steps with 205 reset in 186 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 157 ms :[(AND p0 p2), (AND p0 p2), p2, p2]
Support contains 4 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 295/295 transitions.
Graph (complete) has 507 edges and 249 vertex of which 248 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 248 transition count 294
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 32 place count 248 transition count 294
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 78 place count 248 transition count 294
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 113 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 114 place count 248 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 246 transition count 308
Deduced a syphon composed of 111 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 246 transition count 308
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 148 place count 246 transition count 368
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 160 place count 234 transition count 344
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 172 place count 234 transition count 344
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 208 place count 198 transition count 284
Deduced a syphon composed of 117 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 244 place count 198 transition count 284
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 280 place count 162 transition count 224
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 316 place count 162 transition count 224
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 328 place count 150 transition count 212
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 340 place count 150 transition count 212
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 362 place count 128 transition count 179
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 384 place count 128 transition count 179
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 428 place count 84 transition count 113
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 472 place count 84 transition count 113
Deduced a syphon composed of 49 places in 0 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 478 place count 84 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 481 place count 81 transition count 104
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 484 place count 81 transition count 104
Deduced a syphon composed of 46 places in 0 ms
Applied a total of 484 rules in 42 ms. Remains 81 /249 variables (removed 168) and now considering 104/295 (removed 191) transitions.
[2022-05-15 17:56:11] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-15 17:56:11] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
// Phase 1: matrix 99 rows 81 cols
[2022-05-15 17:56:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:56:11] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/249 places, 104/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/249 places, 104/295 transitions.
Stuttering criterion allowed to conclude after 10804 steps with 72 reset in 51 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-14 finished in 5937 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||F(p1)))'
Found a SL insensitive property : DiscoveryGPU-PT-15b-LTLFireability-00
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 280/280 places, 331/331 transitions.
Graph (complete) has 564 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 277 transition count 287
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 236 transition count 287
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 83 place count 236 transition count 242
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 173 place count 191 transition count 242
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 180 place count 184 transition count 235
Iterating global reduction 2 with 7 rules applied. Total rules applied 187 place count 184 transition count 235
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 191 place count 180 transition count 230
Iterating global reduction 2 with 4 rules applied. Total rules applied 195 place count 180 transition count 230
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 199 place count 176 transition count 223
Iterating global reduction 2 with 4 rules applied. Total rules applied 203 place count 176 transition count 223
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 206 place count 173 transition count 220
Iterating global reduction 2 with 3 rules applied. Total rules applied 209 place count 173 transition count 220
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 343 place count 106 transition count 153
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 356 place count 93 transition count 128
Iterating global reduction 2 with 13 rules applied. Total rules applied 369 place count 93 transition count 128
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 382 place count 80 transition count 113
Iterating global reduction 2 with 13 rules applied. Total rules applied 395 place count 80 transition count 113
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 408 place count 67 transition count 88
Iterating global reduction 2 with 13 rules applied. Total rules applied 421 place count 67 transition count 88
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 434 place count 54 transition count 74
Iterating global reduction 2 with 13 rules applied. Total rules applied 447 place count 54 transition count 74
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 460 place count 41 transition count 49
Iterating global reduction 2 with 13 rules applied. Total rules applied 473 place count 41 transition count 49
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 486 place count 28 transition count 35
Iterating global reduction 2 with 13 rules applied. Total rules applied 499 place count 28 transition count 35
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 501 place count 26 transition count 32
Iterating global reduction 2 with 2 rules applied. Total rules applied 503 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 504 place count 25 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 505 place count 25 transition count 31
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 506 place count 25 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 508 place count 23 transition count 29
Applied a total of 508 rules in 30 ms. Remains 23 /280 variables (removed 257) and now considering 29/331 (removed 302) transitions.
[2022-05-15 17:56:11] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
// Phase 1: matrix 26 rows 23 cols
[2022-05-15 17:56:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:56:11] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-15 17:56:11] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
// Phase 1: matrix 26 rows 23 cols
[2022-05-15 17:56:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:56:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 17:56:11] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-15 17:56:11] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
// Phase 1: matrix 26 rows 23 cols
[2022-05-15 17:56:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:56:11] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 23/280 places, 29/331 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/280 places, 29/331 transitions.
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s18 1) (EQ s20 1)), p0:(AND (OR (EQ s12 0) (EQ s22 0)) (OR (EQ s18 0) (EQ s20 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22085 reset in 88 ms.
Product exploration explored 100000 steps with 21933 reset in 101 ms.
Computed a total of 21 stabilizing places and 24 stable transitions
Computed a total of 21 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1199 steps, including 5 resets, run visited all 3 properties in 6 ms. (steps per millisecond=199 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 276 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2022-05-15 17:56:12] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
// Phase 1: matrix 26 rows 23 cols
[2022-05-15 17:56:12] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:56:12] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-05-15 17:56:12] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
// Phase 1: matrix 26 rows 23 cols
[2022-05-15 17:56:12] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:56:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 17:56:12] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-15 17:56:12] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
// Phase 1: matrix 26 rows 23 cols
[2022-05-15 17:56:12] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:56:12] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 29/29 transitions.
Computed a total of 21 stabilizing places and 24 stable transitions
Computed a total of 21 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 55 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 250 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 22128 reset in 96 ms.
Product exploration explored 100000 steps with 22088 reset in 90 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 29/29 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2022-05-15 17:56:14] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:56:14] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
// Phase 1: matrix 26 rows 23 cols
[2022-05-15 17:56:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:56:14] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 29/29 transitions.
Product exploration explored 100000 steps with 22059 reset in 121 ms.
Product exploration explored 100000 steps with 22010 reset in 133 ms.
Built C files in :
/tmp/ltsmin14919088457554152291
[2022-05-15 17:56:14] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14919088457554152291
Running compilation step : cd /tmp/ltsmin14919088457554152291;'/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 94 ms.
Running link step : cd /tmp/ltsmin14919088457554152291;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin14919088457554152291;'/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/stateBased6293606808612004866.hoa' '--buchi-type=spotba'
LTSmin run took 9912 ms.
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-00 finished in 13143 ms.
CL/SL decision was in the wrong direction : SL + true
[2022-05-15 17:56:24] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1960920276677221221
[2022-05-15 17:56:24] [INFO ] Computing symmetric may disable matrix : 331 transitions.
[2022-05-15 17:56:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:56:24] [INFO ] Computing symmetric may enable matrix : 331 transitions.
[2022-05-15 17:56:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:56:24] [INFO ] Applying decomposition
[2022-05-15 17:56:24] [INFO ] Flatten gal took : 18 ms
[2022-05-15 17:56:24] [INFO ] Computing Do-Not-Accords matrix : 331 transitions.
[2022-05-15 17:56:24] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:56:24] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1960920276677221221
Running compilation step : cd /tmp/ltsmin1960920276677221221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17087160506569546038.txt' '-o' '/tmp/graph17087160506569546038.bin' '-w' '/tmp/graph17087160506569546038.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17087160506569546038.bin' '-l' '-1' '-v' '-w' '/tmp/graph17087160506569546038.weights' '-q' '0' '-e' '0.001'
[2022-05-15 17:56:24] [INFO ] Decomposing Gal with order
[2022-05-15 17:56:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 17:56:24] [INFO ] Removed a total of 134 redundant transitions.
[2022-05-15 17:56:24] [INFO ] Flatten gal took : 48 ms
[2022-05-15 17:56:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 7 ms.
[2022-05-15 17:56:24] [INFO ] Time to serialize gal into /tmp/LTLFireability14159180117096696771.gal : 7 ms
[2022-05-15 17:56:24] [INFO ] Time to serialize properties into /tmp/LTLFireability9999173551816330763.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14159180117096696771.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9999173551816330763.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((G(X("(((i18.u59.p239==0)||(i18.u101.p434==0))&&((i3.i0.u58.p257==0)||(u100.p427==0)))")))||(F("((i3.i0.u58.p257==1)&&(u100.p427==1...162
Formula 0 simplified : !(GX"(((i18.u59.p239==0)||(i18.u101.p434==0))&&((i3.i0.u58.p257==0)||(u100.p427==0)))" | F"((i3.i0.u58.p257==1)&&(u100.p427==1))")
Compilation finished in 632 ms.
Running link step : cd /tmp/ltsmin1960920276677221221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1960920276677221221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((LTLAPp0==true)))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: LTL layer: formula: ([](X((LTLAPp0==true)))||<>((LTLAPp1==true)))
pins2lts-mc-linux64( 3/ 8), 0.005: "([](X((LTLAPp0==true)))||<>((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.023: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.078: DFS-FIFO for weak LTL, using special progress label 334
pins2lts-mc-linux64( 0/ 8), 0.078: There are 335 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.078: State length is 281, there are 335 groups
pins2lts-mc-linux64( 0/ 8), 0.078: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.078: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.078: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.078: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.119: ~1 levels ~960 states ~6224 transitions
pins2lts-mc-linux64( 1/ 8), 0.134: ~1 levels ~1920 states ~11696 transitions
pins2lts-mc-linux64( 7/ 8), 0.174: ~1 levels ~3840 states ~24520 transitions
pins2lts-mc-linux64( 7/ 8), 0.236: ~1 levels ~7680 states ~54640 transitions
pins2lts-mc-linux64( 7/ 8), 0.393: ~1 levels ~15360 states ~116312 transitions
pins2lts-mc-linux64( 7/ 8), 0.675: ~1 levels ~30720 states ~247152 transitions
pins2lts-mc-linux64( 6/ 8), 1.239: ~1 levels ~61440 states ~437928 transitions
pins2lts-mc-linux64( 5/ 8), 2.239: ~1 levels ~122880 states ~933512 transitions
pins2lts-mc-linux64( 5/ 8), 4.054: ~1 levels ~245760 states ~1915688 transitions
pins2lts-mc-linux64( 5/ 8), 7.022: ~1 levels ~491520 states ~3912736 transitions
pins2lts-mc-linux64( 2/ 8), 12.523: ~1 levels ~983040 states ~8041192 transitions
pins2lts-mc-linux64( 2/ 8), 23.311: ~1 levels ~1966080 states ~16735592 transitions
pins2lts-mc-linux64( 2/ 8), 44.810: ~1 levels ~3932160 states ~33313920 transitions
pins2lts-mc-linux64( 2/ 8), 89.389: ~1 levels ~7864320 states ~69468632 transitions
pins2lts-mc-linux64( 2/ 8), 178.607: ~1 levels ~15728640 states ~143720744 transitions
pins2lts-mc-linux64( 2/ 8), 358.753: ~1 levels ~31457280 states ~292871208 transitions
pins2lts-mc-linux64( 2/ 8), 730.111: ~1 levels ~62914560 states ~599419600 transitions
pins2lts-mc-linux64( 2/ 8), 1060.520: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1060.587:
pins2lts-mc-linux64( 0/ 8), 1060.588: mean standard work distribution: 6.1% (states) 4.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 1060.588:
pins2lts-mc-linux64( 0/ 8), 1060.588: Explored 84320087 states 859141067 transitions, fanout: 10.189
pins2lts-mc-linux64( 0/ 8), 1060.588: Total exploration time 1060.510 sec (1060.420 sec minimum, 1060.458 sec on average)
pins2lts-mc-linux64( 0/ 8), 1060.588: States per second: 79509, Transitions per second: 810121
pins2lts-mc-linux64( 0/ 8), 1060.588:
pins2lts-mc-linux64( 0/ 8), 1060.588: Progress states detected: 134217269
pins2lts-mc-linux64( 0/ 8), 1060.588: Redundant explorations: -37.1765
pins2lts-mc-linux64( 0/ 8), 1060.588:
pins2lts-mc-linux64( 0/ 8), 1060.588: Queue width: 8B, total height: 88897163, memory: 678.23MB
pins2lts-mc-linux64( 0/ 8), 1060.588: Tree memory: 1031.2MB, 8.1 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1060.588: Tree fill ratio (roots/leafs): 99.0%/2.0%
pins2lts-mc-linux64( 0/ 8), 1060.588: Stored 333 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1060.588: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1060.588: Est. total memory use: 1709.4MB (~1702.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1960920276677221221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((LTLAPp0==true)))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1960920276677221221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((LTLAPp0==true)))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-15 18:17:02] [INFO ] Applying decomposition
[2022-05-15 18:17:02] [INFO ] Flatten gal took : 129 ms
[2022-05-15 18:17:02] [INFO ] Decomposing Gal with order
[2022-05-15 18:17:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:17:02] [INFO ] Removed a total of 132 redundant transitions.
[2022-05-15 18:17:02] [INFO ] Flatten gal took : 63 ms
[2022-05-15 18:17:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 943 labels/synchronizations in 73 ms.
[2022-05-15 18:17:02] [INFO ] Time to serialize gal into /tmp/LTLFireability8623224326671884064.gal : 28 ms
[2022-05-15 18:17:02] [INFO ] Time to serialize properties into /tmp/LTLFireability10220632416297034568.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8623224326671884064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10220632416297034568.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((G(X("(((i0.i0.i0.i0.i0.i0.i0.u23.p239==0)||(i1.u32.p434==0))&&((i0.i0.i0.i0.i0.i0.i0.u23.p257==0)||(i1.u31.p427==0)))")))||(F("((i...211
Formula 0 simplified : !(GX"(((i0.i0.i0.i0.i0.i0.i0.u23.p239==0)||(i1.u32.p434==0))&&((i0.i0.i0.i0.i0.i0.i0.u23.p257==0)||(i1.u31.p427==0)))" | F"((i0.i0.i...202
Detected timeout of ITS tools.
[2022-05-15 18:37:41] [INFO ] Flatten gal took : 225 ms
[2022-05-15 18:37:41] [INFO ] Input system was already deterministic with 331 transitions.
[2022-05-15 18:37:41] [INFO ] Transformed 280 places.
[2022-05-15 18:37:41] [INFO ] Transformed 331 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 18:37:42] [INFO ] Time to serialize gal into /tmp/LTLFireability2051608912986082620.gal : 7 ms
[2022-05-15 18:37:42] [INFO ] Time to serialize properties into /tmp/LTLFireability16766718854561347917.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2051608912986082620.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16766718854561347917.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G(X("(((p239==0)||(p434==0))&&((p257==0)||(p427==0)))")))||(F("((p257==1)&&(p427==1))"))))
Formula 0 simplified : !(GX"(((p239==0)||(p434==0))&&((p257==0)||(p427==0)))" | F"((p257==1)&&(p427==1))")

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ 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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@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-15b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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