Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156600517.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is LeafsetExtension-PT-S16C4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156600517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 41K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 158K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 5.4K May 11 18:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 11 18:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 11 15:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 11 15:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 6 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 2.3M May 12 08:13 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 LeafsetExtension-PT-S16C4-00
FORMULA_NAME LeafsetExtension-PT-S16C4-01
FORMULA_NAME LeafsetExtension-PT-S16C4-02
FORMULA_NAME LeafsetExtension-PT-S16C4-03
FORMULA_NAME LeafsetExtension-PT-S16C4-04
FORMULA_NAME LeafsetExtension-PT-S16C4-05
FORMULA_NAME LeafsetExtension-PT-S16C4-06
FORMULA_NAME LeafsetExtension-PT-S16C4-07
FORMULA_NAME LeafsetExtension-PT-S16C4-08
FORMULA_NAME LeafsetExtension-PT-S16C4-09
FORMULA_NAME LeafsetExtension-PT-S16C4-10
FORMULA_NAME LeafsetExtension-PT-S16C4-11
FORMULA_NAME LeafsetExtension-PT-S16C4-12
FORMULA_NAME LeafsetExtension-PT-S16C4-13
FORMULA_NAME LeafsetExtension-PT-S16C4-14
FORMULA_NAME LeafsetExtension-PT-S16C4-15

=== Now, execution of the tool begins

BK_START 1621305488256

Running Version 0
[2021-05-18 02:38:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 02:38:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 02:38:10] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2021-05-18 02:38:10] [INFO ] Transformed 1542 places.
[2021-05-18 02:38:10] [INFO ] Transformed 1449 transitions.
[2021-05-18 02:38:10] [INFO ] Parsed PT model containing 1542 places and 1449 transitions in 244 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-18 02:38:10] [INFO ] Initial state test concluded for 1 properties.
FORMULA LeafsetExtension-PT-S16C4-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 1542 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Reduce places removed 293 places and 0 transitions.
Iterating post reduction 0 with 293 rules applied. Total rules applied 293 place count 1249 transition count 1449
Discarding 267 places :
Symmetric choice reduction at 1 with 267 rule applications. Total rules 560 place count 982 transition count 1182
Iterating global reduction 1 with 267 rules applied. Total rules applied 827 place count 982 transition count 1182
Discarding 228 places :
Symmetric choice reduction at 1 with 228 rule applications. Total rules 1055 place count 754 transition count 954
Iterating global reduction 1 with 228 rules applied. Total rules applied 1283 place count 754 transition count 954
Discarding 220 places :
Symmetric choice reduction at 1 with 220 rule applications. Total rules 1503 place count 534 transition count 734
Iterating global reduction 1 with 220 rules applied. Total rules applied 1723 place count 534 transition count 734
Discarding 18 places :
Implicit places reduction removed 18 places
Iterating post reduction 1 with 18 rules applied. Total rules applied 1741 place count 516 transition count 734
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1757 place count 500 transition count 718
Iterating global reduction 2 with 16 rules applied. Total rules applied 1773 place count 500 transition count 718
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1789 place count 484 transition count 702
Iterating global reduction 2 with 16 rules applied. Total rules applied 1805 place count 484 transition count 702
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1821 place count 468 transition count 686
Iterating global reduction 2 with 16 rules applied. Total rules applied 1837 place count 468 transition count 686
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1853 place count 452 transition count 670
Iterating global reduction 2 with 16 rules applied. Total rules applied 1869 place count 452 transition count 670
Discarding 110 places :
Symmetric choice reduction at 2 with 110 rule applications. Total rules 1979 place count 342 transition count 560
Iterating global reduction 2 with 110 rules applied. Total rules applied 2089 place count 342 transition count 560
Applied a total of 2089 rules in 366 ms. Remains 342 /1542 variables (removed 1200) and now considering 560/1449 (removed 889) transitions.
[2021-05-18 02:38:10] [INFO ] Flow matrix only has 450 transitions (discarded 110 similar events)
// Phase 1: matrix 450 rows 342 cols
[2021-05-18 02:38:10] [INFO ] Computed 36 place invariants in 27 ms
[2021-05-18 02:38:10] [INFO ] Implicit Places using invariants in 349 ms returned [4, 33, 45, 73, 91, 114, 118, 150, 152, 172, 176, 203, 207, 221, 227, 239, 258, 290, 302, 306]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 375 ms to find 20 implicit places.
[2021-05-18 02:38:10] [INFO ] Flow matrix only has 450 transitions (discarded 110 similar events)
// Phase 1: matrix 450 rows 322 cols
[2021-05-18 02:38:10] [INFO ] Computed 16 place invariants in 12 ms
[2021-05-18 02:38:11] [INFO ] Dead Transitions using invariants and state equation in 267 ms returned []
Starting structural reductions, iteration 1 : 322/1542 places, 560/1449 transitions.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 81 place count 241 transition count 479
Iterating global reduction 0 with 81 rules applied. Total rules applied 162 place count 241 transition count 479
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 170 place count 233 transition count 471
Iterating global reduction 0 with 8 rules applied. Total rules applied 178 place count 233 transition count 471
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 186 place count 225 transition count 463
Iterating global reduction 0 with 8 rules applied. Total rules applied 194 place count 225 transition count 463
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 202 place count 217 transition count 455
Iterating global reduction 0 with 8 rules applied. Total rules applied 210 place count 217 transition count 455
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 234 place count 193 transition count 431
Iterating global reduction 0 with 24 rules applied. Total rules applied 258 place count 193 transition count 431
Applied a total of 258 rules in 27 ms. Remains 193 /322 variables (removed 129) and now considering 431/560 (removed 129) transitions.
[2021-05-18 02:38:11] [INFO ] Flow matrix only has 261 transitions (discarded 170 similar events)
// Phase 1: matrix 261 rows 193 cols
[2021-05-18 02:38:11] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-18 02:38:11] [INFO ] Implicit Places using invariants in 75 ms returned []
[2021-05-18 02:38:11] [INFO ] Flow matrix only has 261 transitions (discarded 170 similar events)
// Phase 1: matrix 261 rows 193 cols
[2021-05-18 02:38:11] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-18 02:38:11] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 193/1542 places, 431/1449 transitions.
[2021-05-18 02:38:11] [INFO ] Flatten gal took : 58 ms
[2021-05-18 02:38:11] [INFO ] Flatten gal took : 28 ms
[2021-05-18 02:38:11] [INFO ] Input system was already deterministic with 431 transitions.
Finished random walk after 2888 steps, including 78 resets, run visited all 35 properties in 22 ms. (steps per millisecond=131 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((((p1&&((p2 U p3)||F(!p1))) U G(!p1))&&p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 193 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 193/193 places, 431/431 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 169 transition count 407
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 169 transition count 407
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 152 transition count 390
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 152 transition count 390
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 86 place count 148 transition count 390
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 98 place count 136 transition count 378
Iterating global reduction 1 with 12 rules applied. Total rules applied 110 place count 136 transition count 378
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 114 place count 132 transition count 378
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 124 place count 122 transition count 368
Iterating global reduction 2 with 10 rules applied. Total rules applied 134 place count 122 transition count 368
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 142 place count 114 transition count 360
Iterating global reduction 2 with 8 rules applied. Total rules applied 150 place count 114 transition count 360
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 158 place count 106 transition count 352
Iterating global reduction 2 with 8 rules applied. Total rules applied 166 place count 106 transition count 352
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 186 place count 86 transition count 332
Iterating global reduction 2 with 20 rules applied. Total rules applied 206 place count 86 transition count 332
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 221 place count 71 transition count 317
Iterating global reduction 2 with 15 rules applied. Total rules applied 236 place count 71 transition count 317
Applied a total of 236 rules in 22 ms. Remains 71 /193 variables (removed 122) and now considering 317/431 (removed 114) transitions.
[2021-05-18 02:38:14] [INFO ] Flow matrix only has 71 transitions (discarded 246 similar events)
// Phase 1: matrix 71 rows 71 cols
[2021-05-18 02:38:14] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-18 02:38:14] [INFO ] Implicit Places using invariants in 97 ms returned [18, 28, 53, 57, 63]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 99 ms to find 5 implicit places.
[2021-05-18 02:38:14] [INFO ] Flow matrix only has 71 transitions (discarded 246 similar events)
// Phase 1: matrix 71 rows 66 cols
[2021-05-18 02:38:14] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 02:38:15] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Starting structural reductions, iteration 1 : 66/193 places, 317/431 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 58 transition count 309
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 58 transition count 309
Applied a total of 16 rules in 29 ms. Remains 58 /66 variables (removed 8) and now considering 309/317 (removed 8) transitions.
[2021-05-18 02:38:15] [INFO ] Flow matrix only has 60 transitions (discarded 249 similar events)
// Phase 1: matrix 60 rows 58 cols
[2021-05-18 02:38:15] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 02:38:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2021-05-18 02:38:15] [INFO ] Flow matrix only has 60 transitions (discarded 249 similar events)
// Phase 1: matrix 60 rows 58 cols
[2021-05-18 02:38:15] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:38:15] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 58/193 places, 309/431 transitions.
Stuttering acceptance computed with spot in 283 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : LeafsetExtension-PT-S16C4-00 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 0}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p1:(LT s34 1), p0:(AND (GEQ s26 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C4-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-00 finished in 3561 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 431/431 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 193 transition count 409
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 171 transition count 409
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 44 place count 171 transition count 401
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 60 place count 163 transition count 401
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 80 place count 143 transition count 381
Iterating global reduction 2 with 20 rules applied. Total rules applied 100 place count 143 transition count 381
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 139 transition count 377
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 139 transition count 377
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 137 transition count 377
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 110 place count 137 transition count 375
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 135 transition count 375
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 133 transition count 373
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 133 transition count 373
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 131 transition count 371
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 131 transition count 371
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 128 place count 125 transition count 365
Iterating global reduction 3 with 6 rules applied. Total rules applied 134 place count 125 transition count 365
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 180 place count 102 transition count 342
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 186 place count 96 transition count 336
Iterating global reduction 3 with 6 rules applied. Total rules applied 192 place count 96 transition count 336
Applied a total of 192 rules in 62 ms. Remains 96 /193 variables (removed 97) and now considering 336/431 (removed 95) transitions.
[2021-05-18 02:38:15] [INFO ] Flow matrix only has 135 transitions (discarded 201 similar events)
// Phase 1: matrix 135 rows 96 cols
[2021-05-18 02:38:15] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-18 02:38:15] [INFO ] Implicit Places using invariants in 89 ms returned [11, 19, 33, 39, 42, 49, 56, 70, 73, 79, 85]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 90 ms to find 11 implicit places.
[2021-05-18 02:38:15] [INFO ] Redundant transitions in 19 ms returned []
[2021-05-18 02:38:15] [INFO ] Flow matrix only has 135 transitions (discarded 201 similar events)
// Phase 1: matrix 135 rows 85 cols
[2021-05-18 02:38:15] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 02:38:15] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Starting structural reductions, iteration 1 : 85/193 places, 336/431 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 64 transition count 315
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 64 transition count 315
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 61 transition count 312
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 61 transition count 312
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 58 transition count 309
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 58 transition count 309
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 70 place count 50 transition count 301
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 48 transition count 299
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 48 transition count 299
Applied a total of 74 rules in 20 ms. Remains 48 /85 variables (removed 37) and now considering 299/336 (removed 37) transitions.
[2021-05-18 02:38:15] [INFO ] Flow matrix only has 54 transitions (discarded 245 similar events)
// Phase 1: matrix 54 rows 48 cols
[2021-05-18 02:38:15] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:38:15] [INFO ] Implicit Places using invariants in 43 ms returned []
[2021-05-18 02:38:15] [INFO ] Flow matrix only has 54 transitions (discarded 245 similar events)
// Phase 1: matrix 54 rows 48 cols
[2021-05-18 02:38:15] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:38:15] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 48/193 places, 299/431 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S16C4-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s3 1), p0:(LT s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6970 reset in 318 ms.
Product exploration explored 100000 steps with 6972 reset in 262 ms.
Graph (complete) has 413 edges and 48 vertex of which 42 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 6963 reset in 216 ms.
Product exploration explored 100000 steps with 6970 reset in 248 ms.
[2021-05-18 02:38:17] [INFO ] Flatten gal took : 12 ms
[2021-05-18 02:38:17] [INFO ] Flatten gal took : 13 ms
[2021-05-18 02:38:17] [INFO ] Time to serialize gal into /tmp/LTL15887119756028918132.gal : 10 ms
[2021-05-18 02:38:17] [INFO ] Time to serialize properties into /tmp/LTL10432110840984146202.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15887119756028918132.gal, -t, CGAL, -LTL, /tmp/LTL10432110840984146202.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15887119756028918132.gal -t CGAL -LTL /tmp/LTL10432110840984146202.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(Node4HasTheLeafSetOfLxToReplaceNode0<1)")||(G("(Node0ManageTheBreakDownOfNode6>=1)"))))))
Formula 0 simplified : !GF("(Node4HasTheLeafSetOfLxToReplaceNode0<1)" | G"(Node0ManageTheBreakDownOfNode6>=1)")
Reverse transition relation is NOT exact ! Due to transitions t13, t61, t108, t304, t308, t34.t3, t150.t3, t225.t3, t259.t3, t1.t2.t3, t6.t2.t3, t7.t2.t3, t10.t2.t3, t14.t2.t3, t37.t2.t3, t39.t2.t3, t42.t2.t3, t54.t2.t3, t55.t2.t3, t57.t2.t3, t59.t2.t3, t80.t2.t3, t81.t2.t3, t83.t2.t3, t85.t2.t3, t130.t2.t3, t131.t2.t3, t132.t2.t3, t136.t2.t3, t148.t2.t3, t149.t2.t3, t155.t2.t3, t156.t2.t3, t197.t2.t3, t198.t2.t3, t199.t2.t3, t201.t2.t3, t204.t2.t3, t223.t2.t3, t224.t2.t3, t229.t2.t3, t231.t2.t3, t252.t2.t3, t253.t2.t3, t254.t2.t3, t256.t2.t3, t273.t2.t3, t274.t2.t3, t275.t2.t3, t278.t2.t3, t280.t2.t3, t293.t2.t3, t294.t2.t3, t295.t2.t3, t297.t2.t3, t299.t2.t3, t322.t2.t3, t323.t2.t3, t324.t2.t3, t327.t2.t3, t329.t2.t3, t371.t2.t3, t372.t2.t3, t373.t2.t3, t375.t2.t3, t377.t2.t3, t391.t2.t3, t392.t2.t3, t393.t2.t3, t395.t2.t3, t397.t2.t3, t413.t112.t5, t65.t18, t69.t18, t70.t18, t75.t18, t312.t18, t317.t18, t382.t18, t399.t18, t16.t17.t18, t21.t17.t18, t22.t17.t18, t23.t17.t18, t28.t17.t18, t44.t17.t18, t45.t17.t18, t46.t17.t18, t47.t17.t18, t50.t17.t18, t120.t17.t18, t121.t17.t18, t122.t17.t18, t123.t17.t18, t126.t17.t18, t138.t17.t18, t139.t17.t18, t140.t17.t18, t141.t17.t18, t144.t17.t18, t158.t17.t18, t159.t17.t18, t160.t17.t18, t161.t17.t18, t164.t17.t18, t186.t17.t18, t187.t17.t18, t188.t17.t18, t189.t17.t18, t193.t17.t18, t263.t17.t18, t264.t17.t18, t265.t17.t18, t268.t17.t18, t282.t17.t18, t283.t17.t18, t284.t17.t18, t289.t17.t18, t331.t17.t18, t332.t17.t18, t333.t17.t18, t334.t17.t18, t336.t17.t18, t361.t17.t18, t362.t17.t18, t363.t17.t18, t364.t17.t18, t367.t17.t18, t379.t17.t18, t380.t17.t18, t381.t17.t18, t402.t17.t18, t403.t17.t18, t404.t17.t18, t408.t17.t18, t87.t88.t89, t91.t88.t89, t92.t88.t89, t93.t88.t89, t100.t88.t89, t109.t110.t111, t113.t110.t111, t114.t110.t111, t115.t110.t111, t118.t110.t111, t173.t174.t171, t175.t174.t171, t176.t174.t171, t179.t174.t171, t185.t174.t171, t205.t206.t207, t209.t206.t207, t210.t206.t207, t211.t206.t207, t218.t206.t207, t232.t233.t234, t236.t233.t234, t237.t233.t234, t238.t233.t234, t243.t244.t245, t348.t341, t343.t344.t345, t352.t353.t341, t356.t353.t341, t359.t353.t341, t15.t2.t3.t168, t43.t2.t3.t168, t60.t2.t3.t168, t86.t2.t3.t168, t137.t2.t3.t168, t157.t2.t3.t168, t300.t18.t168, t262.t17.t18.t168, t281.t17.t18.t168, t330.t17.t18.t168, t360.t17.t18.t168, t378.t17.t18.t168, t398.t17.t18.t168, t119.t110.t111.t168, t8.t9.t3, t32.t9.t3, t38.t9.t3, t40.t9.t3, t53.t9.t3, t56.t9.t3, t58.t9.t3, t79.t9.t3, t82.t9.t3, t84.t9.t3, t129.t9.t3, t133.t9.t3, t135.t9.t3, t147.t9.t3, t153.t9.t3, t196.t9.t3, t200.t9.t3, t202.t9.t3, t222.t9.t3, t228.t9.t3, t230.t9.t3, t251.t9.t3, t255.t9.t3, t257.t9.t3, t271.t9.t3, t276.t9.t3, t279.t9.t3, t292.t9.t3, t296.t9.t3, t298.t9.t3, t321.t9.t3, t325.t9.t3, t328.t9.t3, t370.t9.t3, t374.t9.t3, t376.t9.t3, t390.t9.t3, t394.t9.t3, t396.t9.t3, t24.t25.t18, t26.t25.t18, t29.t25.t18, t48.t25.t18, t49.t25.t18, t51.t25.t18, t71.t25.t18, t73.t25.t18, t76.t25.t18, t124.t25.t18, t125.t25.t18, t127.t25.t18, t142.t25.t18, t143.t25.t18, t145.t25.t18, t162.t25.t18, t163.t25.t18, t165.t25.t18, t190.t25.t18, t192.t25.t18, t194.t25.t18, t266.t25.t18, t267.t25.t18, t269.t25.t18, t285.t25.t18, t286.t25.t18, t290.t25.t18, t313.t25.t18, t315.t25.t18, t318.t25.t18, t335.t25.t18, t337.t25.t18, t365.t25.t18, t368.t25.t18, t385.t25.t18, t386.t25.t18, t388.t25.t18, t405.t25.t18, t406.t25.t18, t94.t95.t89, t96.t95.t89, t101.t95.t89, t212.t95.t89, t214.t95.t89, t219.t95.t89, t239.t95.t89, t241.t95.t89, t248.t95.t89, t116.t117.t111, t169.t170.t171, t177.t170.t171, t180.t170.t171, t339.t170.t171, t354.t170.t171, t357.t170.t171, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/26/273/299
Computing Next relation with stutter on 17184 deadlock states
35 unique states visited
0 strongly connected components in search stack
39 transitions explored
20 items max in DFS search stack
825 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.28583,235212,1,0,1056,1.28778e+06,638,473,3205,1.21124e+06,1250
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S16C4-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property LeafsetExtension-PT-S16C4-01 finished in 11262 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (!p0 U (p1||G(!p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 431/431 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 169 transition count 407
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 169 transition count 407
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 152 transition count 390
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 152 transition count 390
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 86 place count 148 transition count 390
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 98 place count 136 transition count 378
Iterating global reduction 1 with 12 rules applied. Total rules applied 110 place count 136 transition count 378
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 114 place count 132 transition count 378
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 124 place count 122 transition count 368
Iterating global reduction 2 with 10 rules applied. Total rules applied 134 place count 122 transition count 368
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 142 place count 114 transition count 360
Iterating global reduction 2 with 8 rules applied. Total rules applied 150 place count 114 transition count 360
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 158 place count 106 transition count 352
Iterating global reduction 2 with 8 rules applied. Total rules applied 166 place count 106 transition count 352
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 186 place count 86 transition count 332
Iterating global reduction 2 with 20 rules applied. Total rules applied 206 place count 86 transition count 332
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 221 place count 71 transition count 317
Iterating global reduction 2 with 15 rules applied. Total rules applied 236 place count 71 transition count 317
Applied a total of 236 rules in 14 ms. Remains 71 /193 variables (removed 122) and now considering 317/431 (removed 114) transitions.
[2021-05-18 02:38:26] [INFO ] Flow matrix only has 71 transitions (discarded 246 similar events)
// Phase 1: matrix 71 rows 71 cols
[2021-05-18 02:38:26] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-18 02:38:26] [INFO ] Implicit Places using invariants in 47 ms returned [18, 36, 53, 57, 63]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 48 ms to find 5 implicit places.
[2021-05-18 02:38:26] [INFO ] Flow matrix only has 71 transitions (discarded 246 similar events)
// Phase 1: matrix 71 rows 66 cols
[2021-05-18 02:38:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:38:26] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Starting structural reductions, iteration 1 : 66/193 places, 317/431 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 58 transition count 309
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 58 transition count 309
Applied a total of 16 rules in 2 ms. Remains 58 /66 variables (removed 8) and now considering 309/317 (removed 8) transitions.
[2021-05-18 02:38:26] [INFO ] Flow matrix only has 60 transitions (discarded 249 similar events)
// Phase 1: matrix 60 rows 58 cols
[2021-05-18 02:38:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:38:26] [INFO ] Implicit Places using invariants in 44 ms returned []
[2021-05-18 02:38:26] [INFO ] Flow matrix only has 60 transitions (discarded 249 similar events)
// Phase 1: matrix 60 rows 58 cols
[2021-05-18 02:38:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 02:38:27] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 58/193 places, 309/431 transitions.
Stuttering acceptance computed with spot in 580 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), true]
Running random walk in product with property : LeafsetExtension-PT-S16C4-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (LT s28 1) (OR (LT s22 1) (LT s39 1))), p0:(AND (GEQ s22 1) (GEQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Product exploration explored 100000 steps with 50000 reset in 257 ms.
Graph (complete) has 436 edges and 58 vertex of which 49 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), true]
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), true]
Support contains 3 out of 58 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 58/58 places, 309/309 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 58 transition count 309
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 58 transition count 309
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 58 transition count 309
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 55 transition count 306
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 55 transition count 306
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 55 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 54 transition count 305
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 54 transition count 305
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 19 rules in 16 ms. Remains 54 /58 variables (removed 4) and now considering 305/309 (removed 4) transitions.
[2021-05-18 02:38:28] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-18 02:38:28] [INFO ] Flow matrix only has 54 transitions (discarded 251 similar events)
// Phase 1: matrix 54 rows 54 cols
[2021-05-18 02:38:28] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:38:28] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/58 places, 305/309 transitions.
Product exploration explored 100000 steps with 50000 reset in 844 ms.
Product exploration explored 100000 steps with 50000 reset in 806 ms.
[2021-05-18 02:38:30] [INFO ] Flatten gal took : 15 ms
[2021-05-18 02:38:30] [INFO ] Flatten gal took : 14 ms
[2021-05-18 02:38:30] [INFO ] Time to serialize gal into /tmp/LTL11444100753852785360.gal : 2 ms
[2021-05-18 02:38:30] [INFO ] Time to serialize properties into /tmp/LTL15503237666885502177.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11444100753852785360.gal, -t, CGAL, -LTL, /tmp/LTL15503237666885502177.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11444100753852785360.gal -t CGAL -LTL /tmp/LTL15503237666885502177.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((NoNodeManageTheBreakDownOfNode4>=1)&&(Node11WantsToManageTheBreakDownOfNode4>=1))")U(("((NoNodeManageTheBreakDownOfNode4<1)||(Node11WantsToManageTheBreakDownOfNode4<1))")U((G("((NoNodeManageTheBreakDownOfNode4<1)||(Node11WantsToManageTheBreakDownOfNode4<1))"))||("((Node6ManageTheBreakDownOfNode3<1)&&((NoNodeManageTheBreakDownOfNode4<1)||(Node11WantsToManageTheBreakDownOfNode4<1)))"))))))
Formula 0 simplified : !X("((NoNodeManageTheBreakDownOfNode4>=1)&&(Node11WantsToManageTheBreakDownOfNode4>=1))" U ("((NoNodeManageTheBreakDownOfNode4<1)||(Node11WantsToManageTheBreakDownOfNode4<1))" U ("((Node6ManageTheBreakDownOfNode3<1)&&((NoNodeManageTheBreakDownOfNode4<1)||(Node11WantsToManageTheBreakDownOfNode4<1)))" | G"((NoNodeManageTheBreakDownOfNode4<1)||(Node11WantsToManageTheBreakDownOfNode4<1))")))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t6, t7, t9, t10, t11, t14, t15, t16, t21, t22, t23, t24, t26, t28, t29, t32, t34, t37, t39, t40, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t53, t54, t55, t57, t58, t59, t60, t61, t65, t69, t70, t71, t73, t75, t76, t79, t80, t81, t83, t84, t85, t86, t87, t91, t92, t93, t94, t96, t100, t101, t104, t109, t113, t114, t115, t116, t118, t119, t120, t121, t122, t123, t124, t125, t126, t127, t129, t130, t131, t132, t134, t135, t136, t137, t138, t139, t140, t141, t142, t143, t144, t145, t147, t148, t149, t152, t155, t156, t157, t158, t159, t160, t161, t162, t163, t164, t165, t168, t169, t173, t175, t176, t179, t180, t185, t186, t187, t188, t189, t190, t192, t193, t194, t196, t197, t198, t199, t201, t202, t204, t205, t209, t210, t211, t212, t214, t218, t219, t222, t223, t224, t225, t229, t230, t231, t232, t236, t237, t238, t239, t241, t243, t248, t251, t252, t253, t254, t256, t257, t259, t262, t263, t264, t265, t266, t267, t268, t269, t271, t273, t274, t275, t277, t278, t279, t280, t281, t282, t283, t284, t285, t286, t289, t290, t292, t293, t294, t295, t297, t298, t299, t300, t304, t308, t312, t313, t315, t317, t318, t321, t322, t323, t324, t327, t328, t329, t330, t331, t332, t333, t334, t335, t336, t337, t339, t343, t348, t352, t356, t357, t359, t360, t361, t362, t363, t364, t365, t367, t368, t370, t371, t372, t373, t375, t376, t377, t378, t379, t380, t381, t382, t385, t386, t388, t390, t391, t392, t393, t395, t396, t397, t398, t399, t402, t403, t404, t405, t406, t408, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/48/261/309
Computing Next relation with stutter on 10304 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1494 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.9769,340776,1,0,885,2.0793e+06,657,314,3476,1.95138e+06,636
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S16C4-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property LeafsetExtension-PT-S16C4-02 finished in 18967 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 431/431 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 168 transition count 406
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 168 transition count 406
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 68 place count 150 transition count 388
Iterating global reduction 0 with 18 rules applied. Total rules applied 86 place count 150 transition count 388
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 90 place count 146 transition count 388
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 102 place count 134 transition count 376
Iterating global reduction 1 with 12 rules applied. Total rules applied 114 place count 134 transition count 376
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 118 place count 130 transition count 376
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 128 place count 120 transition count 366
Iterating global reduction 2 with 10 rules applied. Total rules applied 138 place count 120 transition count 366
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 146 place count 112 transition count 358
Iterating global reduction 2 with 8 rules applied. Total rules applied 154 place count 112 transition count 358
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 162 place count 104 transition count 350
Iterating global reduction 2 with 8 rules applied. Total rules applied 170 place count 104 transition count 350
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 190 place count 84 transition count 330
Iterating global reduction 2 with 20 rules applied. Total rules applied 210 place count 84 transition count 330
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 225 place count 69 transition count 315
Iterating global reduction 2 with 15 rules applied. Total rules applied 240 place count 69 transition count 315
Applied a total of 240 rules in 16 ms. Remains 69 /193 variables (removed 124) and now considering 315/431 (removed 116) transitions.
[2021-05-18 02:38:45] [INFO ] Flow matrix only has 68 transitions (discarded 247 similar events)
// Phase 1: matrix 68 rows 69 cols
[2021-05-18 02:38:45] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-18 02:38:45] [INFO ] Implicit Places using invariants in 42 ms returned [18, 34, 51, 55, 61]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 43 ms to find 5 implicit places.
[2021-05-18 02:38:45] [INFO ] Flow matrix only has 68 transitions (discarded 247 similar events)
// Phase 1: matrix 68 rows 64 cols
[2021-05-18 02:38:45] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:38:45] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Starting structural reductions, iteration 1 : 64/193 places, 315/431 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 56 transition count 307
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 56 transition count 307
Applied a total of 16 rules in 2 ms. Remains 56 /64 variables (removed 8) and now considering 307/315 (removed 8) transitions.
[2021-05-18 02:38:45] [INFO ] Flow matrix only has 57 transitions (discarded 250 similar events)
// Phase 1: matrix 57 rows 56 cols
[2021-05-18 02:38:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 02:38:45] [INFO ] Implicit Places using invariants in 35 ms returned []
[2021-05-18 02:38:45] [INFO ] Flow matrix only has 57 transitions (discarded 250 similar events)
// Phase 1: matrix 57 rows 56 cols
[2021-05-18 02:38:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 02:38:46] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 56/193 places, 307/431 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S16C4-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s29 1) (GEQ s34 1)), p1:(AND (OR (LT s29 1) (LT s34 1)) (OR (LT s22 1) (LT s41 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3932 reset in 207 ms.
Product exploration explored 100000 steps with 3917 reset in 224 ms.
Graph (complete) has 432 edges and 56 vertex of which 47 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3920 reset in 181 ms.
Product exploration explored 100000 steps with 3929 reset in 219 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 56 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 56/56 places, 307/307 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 56 transition count 307
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 5 place count 56 transition count 307
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 56 transition count 307
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 53 transition count 304
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 53 transition count 304
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 53 transition count 304
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 17 rules in 12 ms. Remains 53 /56 variables (removed 3) and now considering 304/307 (removed 3) transitions.
[2021-05-18 02:38:47] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-18 02:38:47] [INFO ] Flow matrix only has 52 transitions (discarded 252 similar events)
// Phase 1: matrix 52 rows 53 cols
[2021-05-18 02:38:47] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:38:47] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/56 places, 304/307 transitions.
Product exploration explored 100000 steps with 8752 reset in 372 ms.
Product exploration explored 100000 steps with 8787 reset in 374 ms.
[2021-05-18 02:38:48] [INFO ] Flatten gal took : 14 ms
[2021-05-18 02:38:48] [INFO ] Flatten gal took : 13 ms
[2021-05-18 02:38:48] [INFO ] Time to serialize gal into /tmp/LTL15764332536405449329.gal : 2 ms
[2021-05-18 02:38:48] [INFO ] Time to serialize properties into /tmp/LTL16803031933773939757.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15764332536405449329.gal, -t, CGAL, -LTL, /tmp/LTL16803031933773939757.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15764332536405449329.gal -t CGAL -LTL /tmp/LTL16803031933773939757.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(((Node7DontAnswerToAnyNode<1)||(Node10IsActive<1))&&((NoNodeManageTheBreakDownOfNode4<1)||(Node13WantsToManageTheBreakDownOfNode4<1)))")))||("((Node7DontAnswerToAnyNode>=1)&&(Node10IsActive>=1))")))))
Formula 0 simplified : !XF("((Node7DontAnswerToAnyNode>=1)&&(Node10IsActive>=1))" | GF"(((Node7DontAnswerToAnyNode<1)||(Node10IsActive<1))&&((NoNodeManageTheBreakDownOfNode4<1)||(Node13WantsToManageTheBreakDownOfNode4<1)))")
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t6, t7, t9, t10, t11, t14, t15, t16, t21, t22, t23, t24, t26, t28, t29, t32, t34, t37, t39, t40, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t53, t54, t55, t57, t58, t59, t60, t61, t65, t69, t70, t71, t73, t75, t76, t79, t80, t81, t83, t84, t85, t86, t87, t91, t92, t93, t94, t96, t100, t101, t104, t109, t113, t114, t115, t116, t118, t119, t120, t121, t122, t123, t124, t125, t126, t127, t129, t130, t131, t132, t134, t135, t136, t137, t138, t139, t140, t141, t142, t143, t144, t145, t147, t148, t149, t150, t155, t156, t157, t158, t159, t160, t161, t162, t163, t164, t165, t168, t169, t173, t175, t176, t179, t180, t185, t186, t187, t188, t189, t190, t192, t193, t194, t196, t197, t198, t199, t201, t202, t204, t205, t209, t210, t211, t212, t214, t218, t219, t222, t223, t224, t225, t229, t230, t231, t232, t236, t237, t238, t239, t241, t243, t248, t251, t252, t253, t254, t256, t257, t259, t262, t263, t264, t265, t266, t267, t268, t269, t271, t273, t274, t275, t278, t279, t280, t281, t282, t283, t284, t285, t286, t289, t290, t292, t293, t294, t295, t297, t298, t299, t300, t304, t308, t312, t313, t315, t317, t318, t321, t322, t323, t324, t326, t327, t328, t329, t330, t331, t332, t333, t334, t335, t336, t337, t339, t343, t348, t352, t356, t357, t359, t360, t361, t362, t363, t364, t365, t367, t368, t370, t371, t372, t373, t375, t376, t377, t378, t379, t380, t381, t382, t385, t386, t388, t390, t391, t392, t393, t395, t396, t397, t398, t399, t402, t403, t404, t405, t406, t408, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/46/261/307
Computing Next relation with stutter on 10304 deadlock states
Detected timeout of ITS tools.
[2021-05-18 02:39:03] [INFO ] Flatten gal took : 19 ms
[2021-05-18 02:39:03] [INFO ] Applying decomposition
[2021-05-18 02:39:03] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8226780719110048128.txt, -o, /tmp/graph8226780719110048128.bin, -w, /tmp/graph8226780719110048128.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8226780719110048128.bin, -l, -1, -v, -w, /tmp/graph8226780719110048128.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 02:39:04] [INFO ] Decomposing Gal with order
[2021-05-18 02:39:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 02:39:04] [INFO ] Removed a total of 281 redundant transitions.
[2021-05-18 02:39:04] [INFO ] Flatten gal took : 85 ms
[2021-05-18 02:39:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 7 ms.
[2021-05-18 02:39:04] [INFO ] Time to serialize gal into /tmp/LTL8165369488519521584.gal : 3 ms
[2021-05-18 02:39:04] [INFO ] Time to serialize properties into /tmp/LTL4603728973574850907.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8165369488519521584.gal, -t, CGAL, -LTL, /tmp/LTL4603728973574850907.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8165369488519521584.gal -t CGAL -LTL /tmp/LTL4603728973574850907.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(((u0.Node7DontAnswerToAnyNode<1)||(u2.Node10IsActive<1))&&((i1.i0.u1.NoNodeManageTheBreakDownOfNode4<1)||(i1.i0.u1.Node13WantsToManageTheBreakDownOfNode4<1)))")))||("((u0.Node7DontAnswerToAnyNode>=1)&&(u2.Node10IsActive>=1))")))))
Formula 0 simplified : !XF("((u0.Node7DontAnswerToAnyNode>=1)&&(u2.Node10IsActive>=1))" | GF"(((u0.Node7DontAnswerToAnyNode<1)||(u2.Node10IsActive<1))&&((i1.i0.u1.NoNodeManageTheBreakDownOfNode4<1)||(i1.i0.u1.Node13WantsToManageTheBreakDownOfNode4<1)))")
Reverse transition relation is NOT exact ! Due to transitions t2, t29, t43, t127, t165, t185, t232, t281, t323, t372, u0.t1, u0.t6, u0.t7, u0.t10, u0.t11, u0.t14, u0.t32, u0.t34, u0.t37, u0.t39, u0.t40, u0.t42, u0.t53, u0.t54, u0.t55, u0.t57, u0.t58, u0.t59, u0.t79, u0.t80, u0.t81, u0.t83, u0.t84, u0.t85, u0.t104, u0.t109, u0.t113, u0.t114, u0.t115, u0.t116, u0.t118, u0.t129, u0.t130, u0.t131, u0.t132, u0.t135, u0.t136, u0.t147, u0.t148, u0.t149, u0.t150, u0.t155, u0.t156, u0.t169, u0.t173, u0.t175, u0.t176, u0.t179, u0.t180, u2.t205, u2.t209, u2.t210, u2.t211, u2.t212, u2.t214, u2.t218, u2.t219, u2.t236, u2.t237, u2.t238, u2.t239, u2.t241, u2.t243, u2.t248, u2.t263, u2.t264, u2.t265, u2.t266, u2.t267, u2.t268, u2.t269, u2.t282, u2.t283, u2.t284, u2.t285, u2.t286, u2.t289, u2.t290, u2.t304, u2.t308, u2.t312, u2.t313, u2.t315, u2.t317, u2.t318, u2.t331, u2.t332, u2.t333, u2.t334, u2.t335, u2.t336, u2.t337, u2.t361, u2.t362, u2.t363, u2.t364, u2.t365, u2.t367, u2.t368, u2.t379, u2.t380, u2.t381, u2.t382, u2.t385, u2.t386, u2.t388, u2.t399, u2.t402, u2.t403, u2.t404, u2.t405, u2.t406, u2.t408, u6.t168, i1.i0.t9, i1.i0.u1.t326, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/126/147
Computing Next relation with stutter on 10304 deadlock states
64 unique states visited
0 strongly connected components in search stack
65 transitions explored
36 items max in DFS search stack
407 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.09952,128860,1,0,74314,185020,1196,186042,1347,1.35594e+06,65279
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S16C4-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property LeafsetExtension-PT-S16C4-03 finished in 23556 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X(p0)&&((p1&&F(p2))||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 431/431 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 169 transition count 407
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 169 transition count 407
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 64 place count 153 transition count 391
Iterating global reduction 0 with 16 rules applied. Total rules applied 80 place count 153 transition count 391
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 83 place count 150 transition count 391
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 92 place count 141 transition count 382
Iterating global reduction 1 with 9 rules applied. Total rules applied 101 place count 141 transition count 382
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 104 place count 138 transition count 382
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 111 place count 131 transition count 375
Iterating global reduction 2 with 7 rules applied. Total rules applied 118 place count 131 transition count 375
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 125 transition count 369
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 125 transition count 369
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 136 place count 119 transition count 363
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 119 transition count 363
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 157 place count 104 transition count 348
Iterating global reduction 2 with 15 rules applied. Total rules applied 172 place count 104 transition count 348
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 183 place count 93 transition count 337
Iterating global reduction 2 with 11 rules applied. Total rules applied 194 place count 93 transition count 337
Applied a total of 194 rules in 17 ms. Remains 93 /193 variables (removed 100) and now considering 337/431 (removed 94) transitions.
[2021-05-18 02:39:09] [INFO ] Flow matrix only has 104 transitions (discarded 233 similar events)
// Phase 1: matrix 104 rows 93 cols
[2021-05-18 02:39:09] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-18 02:39:09] [INFO ] Implicit Places using invariants in 63 ms returned [18, 28, 34, 73, 77, 83]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 64 ms to find 6 implicit places.
[2021-05-18 02:39:09] [INFO ] Flow matrix only has 104 transitions (discarded 233 similar events)
// Phase 1: matrix 104 rows 87 cols
[2021-05-18 02:39:09] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 02:39:09] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Starting structural reductions, iteration 1 : 87/193 places, 337/431 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 71 transition count 321
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 71 transition count 321
Applied a total of 32 rules in 11 ms. Remains 71 /87 variables (removed 16) and now considering 321/337 (removed 16) transitions.
[2021-05-18 02:39:09] [INFO ] Flow matrix only has 84 transitions (discarded 237 similar events)
// Phase 1: matrix 84 rows 71 cols
[2021-05-18 02:39:09] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 02:39:09] [INFO ] Implicit Places using invariants in 39 ms returned []
[2021-05-18 02:39:09] [INFO ] Flow matrix only has 84 transitions (discarded 237 similar events)
// Phase 1: matrix 84 rows 71 cols
[2021-05-18 02:39:09] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 02:39:09] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 71/193 places, 321/431 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LT s36 1), p2:(AND (GEQ s50 1) (GEQ s52 1)), p0:(OR (LT s18 1) (LT s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 65 steps with 1 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C4-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-04 finished in 522 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 431/431 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 193 transition count 409
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 171 transition count 408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 170 transition count 408
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 46 place count 170 transition count 400
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 62 place count 162 transition count 400
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 81 place count 143 transition count 381
Iterating global reduction 3 with 19 rules applied. Total rules applied 100 place count 143 transition count 381
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 103 place count 140 transition count 378
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 140 transition count 378
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 138 transition count 378
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 108 place count 138 transition count 376
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 112 place count 136 transition count 376
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 114 place count 134 transition count 374
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 134 transition count 374
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 132 transition count 372
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 132 transition count 372
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 126 place count 126 transition count 366
Iterating global reduction 4 with 6 rules applied. Total rules applied 132 place count 126 transition count 366
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 178 place count 103 transition count 343
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 186 place count 95 transition count 335
Iterating global reduction 4 with 8 rules applied. Total rules applied 194 place count 95 transition count 335
Applied a total of 194 rules in 36 ms. Remains 95 /193 variables (removed 98) and now considering 335/431 (removed 96) transitions.
[2021-05-18 02:39:09] [INFO ] Flow matrix only has 133 transitions (discarded 202 similar events)
// Phase 1: matrix 133 rows 95 cols
[2021-05-18 02:39:09] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-18 02:39:09] [INFO ] Implicit Places using invariants in 67 ms returned [10, 17, 25, 29, 35, 38, 45, 52, 66, 78, 84]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 68 ms to find 11 implicit places.
[2021-05-18 02:39:09] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-18 02:39:09] [INFO ] Flow matrix only has 133 transitions (discarded 202 similar events)
// Phase 1: matrix 133 rows 84 cols
[2021-05-18 02:39:09] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:39:10] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Starting structural reductions, iteration 1 : 84/193 places, 335/431 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 62 transition count 313
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 62 transition count 313
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 59 transition count 310
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 59 transition count 310
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 56 transition count 307
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 56 transition count 307
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 49 transition count 300
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 47 transition count 298
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 47 transition count 298
Applied a total of 74 rules in 16 ms. Remains 47 /84 variables (removed 37) and now considering 298/335 (removed 37) transitions.
[2021-05-18 02:39:10] [INFO ] Flow matrix only has 52 transitions (discarded 246 similar events)
// Phase 1: matrix 52 rows 47 cols
[2021-05-18 02:39:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:39:10] [INFO ] Implicit Places using invariants in 37 ms returned []
[2021-05-18 02:39:10] [INFO ] Flow matrix only has 52 transitions (discarded 246 similar events)
// Phase 1: matrix 52 rows 47 cols
[2021-05-18 02:39:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:39:10] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 47/193 places, 298/431 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s39 1)), p1:(OR (LT s34 1) (LT s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C4-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-05 finished in 404 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 431/431 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 169 transition count 407
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 169 transition count 407
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 152 transition count 390
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 152 transition count 390
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 86 place count 148 transition count 390
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 98 place count 136 transition count 378
Iterating global reduction 1 with 12 rules applied. Total rules applied 110 place count 136 transition count 378
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 114 place count 132 transition count 378
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 124 place count 122 transition count 368
Iterating global reduction 2 with 10 rules applied. Total rules applied 134 place count 122 transition count 368
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 142 place count 114 transition count 360
Iterating global reduction 2 with 8 rules applied. Total rules applied 150 place count 114 transition count 360
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 158 place count 106 transition count 352
Iterating global reduction 2 with 8 rules applied. Total rules applied 166 place count 106 transition count 352
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 186 place count 86 transition count 332
Iterating global reduction 2 with 20 rules applied. Total rules applied 206 place count 86 transition count 332
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 221 place count 71 transition count 317
Iterating global reduction 2 with 15 rules applied. Total rules applied 236 place count 71 transition count 317
Applied a total of 236 rules in 12 ms. Remains 71 /193 variables (removed 122) and now considering 317/431 (removed 114) transitions.
[2021-05-18 02:39:10] [INFO ] Flow matrix only has 71 transitions (discarded 246 similar events)
// Phase 1: matrix 71 rows 71 cols
[2021-05-18 02:39:10] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-18 02:39:10] [INFO ] Implicit Places using invariants in 74 ms returned [18, 35, 53, 57, 63]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 75 ms to find 5 implicit places.
[2021-05-18 02:39:10] [INFO ] Flow matrix only has 71 transitions (discarded 246 similar events)
// Phase 1: matrix 71 rows 66 cols
[2021-05-18 02:39:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 02:39:10] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Starting structural reductions, iteration 1 : 66/193 places, 317/431 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 58 transition count 309
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 58 transition count 309
Applied a total of 16 rules in 2 ms. Remains 58 /66 variables (removed 8) and now considering 309/317 (removed 8) transitions.
[2021-05-18 02:39:10] [INFO ] Flow matrix only has 60 transitions (discarded 249 similar events)
// Phase 1: matrix 60 rows 58 cols
[2021-05-18 02:39:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:39:10] [INFO ] Implicit Places using invariants in 42 ms returned []
[2021-05-18 02:39:10] [INFO ] Flow matrix only has 60 transitions (discarded 249 similar events)
// Phase 1: matrix 60 rows 58 cols
[2021-05-18 02:39:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 02:39:10] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 58/193 places, 309/431 transitions.
Stuttering acceptance computed with spot in 4390 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s22 1) (GEQ s24 1) (LT s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C4-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-06 finished in 4723 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X((G(p1)&&X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 431/431 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 168 transition count 406
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 168 transition count 406
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 151 transition count 389
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 151 transition count 389
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 87 place count 148 transition count 389
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 98 place count 137 transition count 378
Iterating global reduction 1 with 11 rules applied. Total rules applied 109 place count 137 transition count 378
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 113 place count 133 transition count 378
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 122 place count 124 transition count 369
Iterating global reduction 2 with 9 rules applied. Total rules applied 131 place count 124 transition count 369
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 138 place count 117 transition count 362
Iterating global reduction 2 with 7 rules applied. Total rules applied 145 place count 117 transition count 362
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 152 place count 110 transition count 355
Iterating global reduction 2 with 7 rules applied. Total rules applied 159 place count 110 transition count 355
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 175 place count 94 transition count 339
Iterating global reduction 2 with 16 rules applied. Total rules applied 191 place count 94 transition count 339
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 206 place count 79 transition count 324
Iterating global reduction 2 with 15 rules applied. Total rules applied 221 place count 79 transition count 324
Applied a total of 221 rules in 12 ms. Remains 79 /193 variables (removed 114) and now considering 324/431 (removed 107) transitions.
[2021-05-18 02:39:14] [INFO ] Flow matrix only has 84 transitions (discarded 240 similar events)
// Phase 1: matrix 84 rows 79 cols
[2021-05-18 02:39:14] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-18 02:39:15] [INFO ] Implicit Places using invariants in 55 ms returned [18, 28, 34, 60, 64, 70]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 56 ms to find 6 implicit places.
[2021-05-18 02:39:15] [INFO ] Flow matrix only has 84 transitions (discarded 240 similar events)
// Phase 1: matrix 84 rows 73 cols
[2021-05-18 02:39:15] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:39:15] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Starting structural reductions, iteration 1 : 73/193 places, 324/431 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 61 transition count 312
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 61 transition count 312
Applied a total of 24 rules in 7 ms. Remains 61 /73 variables (removed 12) and now considering 312/324 (removed 12) transitions.
[2021-05-18 02:39:15] [INFO ] Flow matrix only has 68 transitions (discarded 244 similar events)
// Phase 1: matrix 68 rows 61 cols
[2021-05-18 02:39:15] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:39:15] [INFO ] Implicit Places using invariants in 38 ms returned []
[2021-05-18 02:39:15] [INFO ] Flow matrix only has 68 transitions (discarded 244 similar events)
// Phase 1: matrix 68 rows 61 cols
[2021-05-18 02:39:15] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:39:15] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 61/193 places, 312/431 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (AND (NOT p1) p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 8}], [{ cond=(OR p0 p1), acceptance={} source=8 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s33 1) (GEQ s35 1)), p1:(OR (LT s43 1) (LT s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C4-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-07 finished in 527 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||G(p1)||X((p2 U (p3||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 431/431 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 169 transition count 407
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 169 transition count 407
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 152 transition count 390
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 152 transition count 390
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 85 place count 149 transition count 390
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 95 place count 139 transition count 380
Iterating global reduction 1 with 10 rules applied. Total rules applied 105 place count 139 transition count 380
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 109 place count 135 transition count 380
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 118 place count 126 transition count 371
Iterating global reduction 2 with 9 rules applied. Total rules applied 127 place count 126 transition count 371
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 134 place count 119 transition count 364
Iterating global reduction 2 with 7 rules applied. Total rules applied 141 place count 119 transition count 364
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 148 place count 112 transition count 357
Iterating global reduction 2 with 7 rules applied. Total rules applied 155 place count 112 transition count 357
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 171 place count 96 transition count 341
Iterating global reduction 2 with 16 rules applied. Total rules applied 187 place count 96 transition count 341
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 202 place count 81 transition count 326
Iterating global reduction 2 with 15 rules applied. Total rules applied 217 place count 81 transition count 326
Applied a total of 217 rules in 11 ms. Remains 81 /193 variables (removed 112) and now considering 326/431 (removed 105) transitions.
[2021-05-18 02:39:15] [INFO ] Flow matrix only has 87 transitions (discarded 239 similar events)
// Phase 1: matrix 87 rows 81 cols
[2021-05-18 02:39:15] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-18 02:39:15] [INFO ] Implicit Places using invariants in 43 ms returned [18, 28, 34, 66, 72]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 44 ms to find 5 implicit places.
[2021-05-18 02:39:15] [INFO ] Flow matrix only has 87 transitions (discarded 239 similar events)
// Phase 1: matrix 87 rows 76 cols
[2021-05-18 02:39:15] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-18 02:39:15] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Starting structural reductions, iteration 1 : 76/193 places, 326/431 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 66 transition count 316
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 66 transition count 316
Applied a total of 20 rules in 8 ms. Remains 66 /76 variables (removed 10) and now considering 316/326 (removed 10) transitions.
[2021-05-18 02:39:15] [INFO ] Flow matrix only has 74 transitions (discarded 242 similar events)
// Phase 1: matrix 74 rows 66 cols
[2021-05-18 02:39:15] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 02:39:15] [INFO ] Implicit Places using invariants in 40 ms returned []
[2021-05-18 02:39:15] [INFO ] Flow matrix only has 74 transitions (discarded 242 similar events)
// Phase 1: matrix 74 rows 66 cols
[2021-05-18 02:39:15] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-18 02:39:15] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 66/193 places, 316/431 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p1), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-08 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=(OR (AND p0 p1 p3) (AND p0 p1 p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), acceptance={} source=1 dest: 5}, { cond=(OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1 p3), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p3) p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p1 p3), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) (NOT p3) p2)), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p0) p1 p3) (AND p1 (NOT p3) p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 p1 p3), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p3) p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=6 dest: 5}, { cond=(OR (AND p0 (NOT p1) p3) (AND p0 (NOT p3) p2)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={} source=7 dest: 3}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 3}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s43 1) (GEQ s46 1)), p1:(AND (GEQ s48 1) (GEQ s55 1)), p3:(AND (OR (LT s48 1) (LT s55 1)) (OR (LT s27 1) (LT s50 1))), p2:(OR (LT s27 1) (LT s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 629 steps with 19 reset in 2 ms.
FORMULA LeafsetExtension-PT-S16C4-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-08 finished in 516 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0)||(F(p1)&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 431/431 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 170 transition count 408
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 170 transition count 408
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 61 place count 155 transition count 393
Iterating global reduction 0 with 15 rules applied. Total rules applied 76 place count 155 transition count 393
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 80 place count 151 transition count 393
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 90 place count 141 transition count 383
Iterating global reduction 1 with 10 rules applied. Total rules applied 100 place count 141 transition count 383
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 139 transition count 383
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 109 place count 132 transition count 376
Iterating global reduction 2 with 7 rules applied. Total rules applied 116 place count 132 transition count 376
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 122 place count 126 transition count 370
Iterating global reduction 2 with 6 rules applied. Total rules applied 128 place count 126 transition count 370
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 134 place count 120 transition count 364
Iterating global reduction 2 with 6 rules applied. Total rules applied 140 place count 120 transition count 364
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 158 place count 102 transition count 346
Iterating global reduction 2 with 18 rules applied. Total rules applied 176 place count 102 transition count 346
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 183 place count 95 transition count 339
Iterating global reduction 2 with 7 rules applied. Total rules applied 190 place count 95 transition count 339
Applied a total of 190 rules in 10 ms. Remains 95 /193 variables (removed 98) and now considering 339/431 (removed 92) transitions.
[2021-05-18 02:39:15] [INFO ] Flow matrix only has 107 transitions (discarded 232 similar events)
// Phase 1: matrix 107 rows 95 cols
[2021-05-18 02:39:15] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-18 02:39:16] [INFO ] Implicit Places using invariants in 53 ms returned [18, 30, 36, 63, 79, 85]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 53 ms to find 6 implicit places.
[2021-05-18 02:39:16] [INFO ] Flow matrix only has 107 transitions (discarded 232 similar events)
// Phase 1: matrix 107 rows 89 cols
[2021-05-18 02:39:16] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 02:39:16] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Starting structural reductions, iteration 1 : 89/193 places, 339/431 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 74 transition count 324
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 74 transition count 324
Applied a total of 30 rules in 5 ms. Remains 74 /89 variables (removed 15) and now considering 324/339 (removed 15) transitions.
[2021-05-18 02:39:16] [INFO ] Flow matrix only has 88 transitions (discarded 236 similar events)
// Phase 1: matrix 88 rows 74 cols
[2021-05-18 02:39:16] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 02:39:16] [INFO ] Implicit Places using invariants in 45 ms returned []
[2021-05-18 02:39:16] [INFO ] Flow matrix only has 88 transitions (discarded 236 similar events)
// Phase 1: matrix 88 rows 74 cols
[2021-05-18 02:39:16] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-18 02:39:16] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 74/193 places, 324/431 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LT s34 1), p2:(LT s15 1), p0:(GEQ s57 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 204 ms.
Product exploration explored 100000 steps with 50000 reset in 227 ms.
Graph (complete) has 460 edges and 74 vertex of which 55 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Knowledge obtained : [p1, p2, (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Support contains 3 out of 74 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 74/74 places, 324/324 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 74 transition count 324
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 9 place count 74 transition count 326
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 74 transition count 326
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 72 transition count 324
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 72 transition count 324
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 25 place count 72 transition count 324
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 65 transition count 317
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 65 transition count 317
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 39 rules in 24 ms. Remains 65 /74 variables (removed 9) and now considering 317/324 (removed 7) transitions.
[2021-05-18 02:39:18] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-18 02:39:18] [INFO ] Flow matrix only has 80 transitions (discarded 237 similar events)
// Phase 1: matrix 80 rows 65 cols
[2021-05-18 02:39:18] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 02:39:18] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 65/74 places, 317/324 transitions.
Product exploration explored 100000 steps with 50000 reset in 234 ms.
Product exploration explored 100000 steps with 50000 reset in 263 ms.
[2021-05-18 02:39:18] [INFO ] Flatten gal took : 14 ms
[2021-05-18 02:39:18] [INFO ] Flatten gal took : 23 ms
[2021-05-18 02:39:18] [INFO ] Time to serialize gal into /tmp/LTL3119991528615418394.gal : 3 ms
[2021-05-18 02:39:18] [INFO ] Time to serialize properties into /tmp/LTL4812791691220250826.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3119991528615418394.gal, -t, CGAL, -LTL, /tmp/LTL4812791691220250826.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3119991528615418394.gal -t CGAL -LTL /tmp/LTL4812791691220250826.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X("(Node14HasTheLeafSetOfLxToReplaceNode1>=1)"))||((F("(Node7HasTheLeafSetOfLxToReplaceNode6<1)"))&&(F("(Node1ManageTheBreakDownOfNode2<1)"))))))
Formula 0 simplified : !X(X"(Node14HasTheLeafSetOfLxToReplaceNode1>=1)" | (F"(Node7HasTheLeafSetOfLxToReplaceNode6<1)" & F"(Node1ManageTheBreakDownOfNode2<1)"))
Detected timeout of ITS tools.
[2021-05-18 02:39:37] [INFO ] Flatten gal took : 21 ms
[2021-05-18 02:39:37] [INFO ] Applying decomposition
[2021-05-18 02:39:37] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8062155756829442234.txt, -o, /tmp/graph8062155756829442234.bin, -w, /tmp/graph8062155756829442234.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8062155756829442234.bin, -l, -1, -v, -w, /tmp/graph8062155756829442234.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 02:39:37] [INFO ] Decomposing Gal with order
[2021-05-18 02:39:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 02:39:37] [INFO ] Removed a total of 283 redundant transitions.
[2021-05-18 02:39:37] [INFO ] Flatten gal took : 74 ms
[2021-05-18 02:39:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 3 ms.
[2021-05-18 02:39:37] [INFO ] Time to serialize gal into /tmp/LTL6240517589506201473.gal : 14 ms
[2021-05-18 02:39:37] [INFO ] Time to serialize properties into /tmp/LTL11207460138259843123.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6240517589506201473.gal, -t, CGAL, -LTL, /tmp/LTL11207460138259843123.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6240517589506201473.gal -t CGAL -LTL /tmp/LTL11207460138259843123.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X("(i3.u16.Node14HasTheLeafSetOfLxToReplaceNode1>=1)"))||((F("(i3.u16.Node7HasTheLeafSetOfLxToReplaceNode6<1)"))&&(F("(i2.u6.Node1ManageTheBreakDownOfNode2<1)"))))))
Formula 0 simplified : !X(X"(i3.u16.Node14HasTheLeafSetOfLxToReplaceNode1>=1)" | (F"(i3.u16.Node7HasTheLeafSetOfLxToReplaceNode6<1)" & F"(i2.u6.Node1ManageTheBreakDownOfNode2<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5370758387059133439
[2021-05-18 02:39:52] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5370758387059133439
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5370758387059133439]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5370758387059133439] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5370758387059133439] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property LeafsetExtension-PT-S16C4-09 finished in 37862 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (F(p1) U X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 431/431 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 169 transition count 407
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 169 transition count 407
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 152 transition count 390
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 152 transition count 390
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 86 place count 148 transition count 390
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 98 place count 136 transition count 378
Iterating global reduction 1 with 12 rules applied. Total rules applied 110 place count 136 transition count 378
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 114 place count 132 transition count 378
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 124 place count 122 transition count 368
Iterating global reduction 2 with 10 rules applied. Total rules applied 134 place count 122 transition count 368
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 142 place count 114 transition count 360
Iterating global reduction 2 with 8 rules applied. Total rules applied 150 place count 114 transition count 360
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 158 place count 106 transition count 352
Iterating global reduction 2 with 8 rules applied. Total rules applied 166 place count 106 transition count 352
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 186 place count 86 transition count 332
Iterating global reduction 2 with 20 rules applied. Total rules applied 206 place count 86 transition count 332
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 221 place count 71 transition count 317
Iterating global reduction 2 with 15 rules applied. Total rules applied 236 place count 71 transition count 317
Applied a total of 236 rules in 10 ms. Remains 71 /193 variables (removed 122) and now considering 317/431 (removed 114) transitions.
[2021-05-18 02:39:53] [INFO ] Flow matrix only has 71 transitions (discarded 246 similar events)
// Phase 1: matrix 71 rows 71 cols
[2021-05-18 02:39:53] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-18 02:39:53] [INFO ] Implicit Places using invariants in 50 ms returned [28, 34, 53, 57, 63]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 50 ms to find 5 implicit places.
[2021-05-18 02:39:53] [INFO ] Flow matrix only has 71 transitions (discarded 246 similar events)
// Phase 1: matrix 71 rows 66 cols
[2021-05-18 02:39:53] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:39:54] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Starting structural reductions, iteration 1 : 66/193 places, 317/431 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 57 transition count 308
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 57 transition count 308
Applied a total of 18 rules in 2 ms. Remains 57 /66 variables (removed 9) and now considering 308/317 (removed 9) transitions.
[2021-05-18 02:39:54] [INFO ] Flow matrix only has 58 transitions (discarded 250 similar events)
// Phase 1: matrix 58 rows 57 cols
[2021-05-18 02:39:54] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 02:39:54] [INFO ] Implicit Places using invariants in 44 ms returned []
[2021-05-18 02:39:54] [INFO ] Flow matrix only has 58 transitions (discarded 250 similar events)
// Phase 1: matrix 58 rows 57 cols
[2021-05-18 02:39:54] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-18 02:39:54] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 57/193 places, 308/431 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s40 1) (LT s47 1)), p2:(AND (GEQ s13 1) (GEQ s36 1)), p1:(GEQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C4-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-10 finished in 456 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&F((p1||X(F((F(p3)&&p2)))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 431/431 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 170 transition count 408
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 170 transition count 408
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 62 place count 154 transition count 392
Iterating global reduction 0 with 16 rules applied. Total rules applied 78 place count 154 transition count 392
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 82 place count 150 transition count 392
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 94 place count 138 transition count 380
Iterating global reduction 1 with 12 rules applied. Total rules applied 106 place count 138 transition count 380
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 110 place count 134 transition count 380
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 120 place count 124 transition count 370
Iterating global reduction 2 with 10 rules applied. Total rules applied 130 place count 124 transition count 370
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 138 place count 116 transition count 362
Iterating global reduction 2 with 8 rules applied. Total rules applied 146 place count 116 transition count 362
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 154 place count 108 transition count 354
Iterating global reduction 2 with 8 rules applied. Total rules applied 162 place count 108 transition count 354
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 182 place count 88 transition count 334
Iterating global reduction 2 with 20 rules applied. Total rules applied 202 place count 88 transition count 334
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 217 place count 73 transition count 319
Iterating global reduction 2 with 15 rules applied. Total rules applied 232 place count 73 transition count 319
Applied a total of 232 rules in 9 ms. Remains 73 /193 variables (removed 120) and now considering 319/431 (removed 112) transitions.
[2021-05-18 02:39:54] [INFO ] Flow matrix only has 74 transitions (discarded 245 similar events)
// Phase 1: matrix 74 rows 73 cols
[2021-05-18 02:39:54] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-18 02:39:54] [INFO ] Implicit Places using invariants in 46 ms returned [18, 28, 34, 50, 65]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 46 ms to find 5 implicit places.
[2021-05-18 02:39:54] [INFO ] Flow matrix only has 74 transitions (discarded 245 similar events)
// Phase 1: matrix 74 rows 68 cols
[2021-05-18 02:39:54] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:39:54] [INFO ] Dead Transitions using invariants and state equation in 121 ms returned []
Starting structural reductions, iteration 1 : 68/193 places, 319/431 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 311
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 311
Applied a total of 16 rules in 2 ms. Remains 60 /68 variables (removed 8) and now considering 311/319 (removed 8) transitions.
[2021-05-18 02:39:54] [INFO ] Flow matrix only has 63 transitions (discarded 248 similar events)
// Phase 1: matrix 63 rows 60 cols
[2021-05-18 02:39:54] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 02:39:54] [INFO ] Implicit Places using invariants in 44 ms returned []
[2021-05-18 02:39:54] [INFO ] Flow matrix only has 63 transitions (discarded 248 similar events)
// Phase 1: matrix 63 rows 60 cols
[2021-05-18 02:39:54] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:39:54] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 60/193 places, 311/431 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : LeafsetExtension-PT-S16C4-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s50 1), p1:(AND (LT s45 1) (GEQ s50 1) (OR (LT s42 1) (LT s46 1))), p2:(AND (LT s45 1) (GEQ s50 1) (OR (LT s42 1) (LT s46 1))), p3:(AND (GEQ s24 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C4-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-12 finished in 419 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 431/431 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 168 transition count 406
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 168 transition count 406
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 151 transition count 389
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 151 transition count 389
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 87 place count 148 transition count 389
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 97 place count 138 transition count 379
Iterating global reduction 1 with 10 rules applied. Total rules applied 107 place count 138 transition count 379
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 111 place count 134 transition count 379
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 120 place count 125 transition count 370
Iterating global reduction 2 with 9 rules applied. Total rules applied 129 place count 125 transition count 370
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 136 place count 118 transition count 363
Iterating global reduction 2 with 7 rules applied. Total rules applied 143 place count 118 transition count 363
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 150 place count 111 transition count 356
Iterating global reduction 2 with 7 rules applied. Total rules applied 157 place count 111 transition count 356
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 173 place count 95 transition count 340
Iterating global reduction 2 with 16 rules applied. Total rules applied 189 place count 95 transition count 340
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 204 place count 80 transition count 325
Iterating global reduction 2 with 15 rules applied. Total rules applied 219 place count 80 transition count 325
Applied a total of 219 rules in 10 ms. Remains 80 /193 variables (removed 113) and now considering 325/431 (removed 106) transitions.
[2021-05-18 02:39:54] [INFO ] Flow matrix only has 85 transitions (discarded 240 similar events)
// Phase 1: matrix 85 rows 80 cols
[2021-05-18 02:39:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-18 02:39:54] [INFO ] Implicit Places using invariants in 52 ms returned [18, 39, 45, 61, 65, 71]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 52 ms to find 6 implicit places.
[2021-05-18 02:39:54] [INFO ] Flow matrix only has 85 transitions (discarded 240 similar events)
// Phase 1: matrix 85 rows 74 cols
[2021-05-18 02:39:54] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 02:39:54] [INFO ] Dead Transitions using invariants and state equation in 119 ms returned []
Starting structural reductions, iteration 1 : 74/193 places, 325/431 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 61 transition count 312
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 61 transition count 312
Applied a total of 26 rules in 2 ms. Remains 61 /74 variables (removed 13) and now considering 312/325 (removed 13) transitions.
[2021-05-18 02:39:54] [INFO ] Flow matrix only has 68 transitions (discarded 244 similar events)
// Phase 1: matrix 68 rows 61 cols
[2021-05-18 02:39:54] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:39:54] [INFO ] Implicit Places using invariants in 44 ms returned []
[2021-05-18 02:39:54] [INFO ] Flow matrix only has 68 transitions (discarded 244 similar events)
// Phase 1: matrix 68 rows 61 cols
[2021-05-18 02:39:54] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:39:55] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 61/193 places, 312/431 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-13 automaton TGBA [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 (GEQ s18 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C4-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-13 finished in 367 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 431/431 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 193 transition count 408
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 170 transition count 408
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 46 place count 170 transition count 401
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 60 place count 163 transition count 401
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 79 place count 144 transition count 382
Iterating global reduction 2 with 19 rules applied. Total rules applied 98 place count 144 transition count 382
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 102 place count 140 transition count 378
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 140 transition count 378
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 138 transition count 378
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 108 place count 138 transition count 376
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 136 transition count 376
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 134 transition count 374
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 134 transition count 374
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 118 place count 132 transition count 372
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 132 transition count 372
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 126 place count 126 transition count 366
Iterating global reduction 3 with 6 rules applied. Total rules applied 132 place count 126 transition count 366
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 178 place count 103 transition count 343
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 186 place count 95 transition count 335
Iterating global reduction 3 with 8 rules applied. Total rules applied 194 place count 95 transition count 335
Applied a total of 194 rules in 28 ms. Remains 95 /193 variables (removed 98) and now considering 335/431 (removed 96) transitions.
[2021-05-18 02:39:55] [INFO ] Flow matrix only has 133 transitions (discarded 202 similar events)
// Phase 1: matrix 133 rows 95 cols
[2021-05-18 02:39:55] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-18 02:39:55] [INFO ] Implicit Places using invariants in 75 ms returned [10, 28, 32, 38, 41, 48, 55, 69, 72, 78, 84]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 98 ms to find 11 implicit places.
[2021-05-18 02:39:55] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-18 02:39:55] [INFO ] Flow matrix only has 133 transitions (discarded 202 similar events)
// Phase 1: matrix 133 rows 84 cols
[2021-05-18 02:39:55] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:39:55] [INFO ] Dead Transitions using invariants and state equation in 111 ms returned []
Starting structural reductions, iteration 1 : 84/193 places, 335/431 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 84 transition count 334
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 83 transition count 334
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 23 place count 62 transition count 313
Iterating global reduction 0 with 21 rules applied. Total rules applied 44 place count 62 transition count 313
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 59 transition count 310
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 59 transition count 310
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 56 transition count 307
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 56 transition count 307
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 49 transition count 300
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 47 transition count 298
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 47 transition count 298
Applied a total of 74 rules in 17 ms. Remains 47 /84 variables (removed 37) and now considering 298/335 (removed 37) transitions.
[2021-05-18 02:39:55] [INFO ] Flow matrix only has 52 transitions (discarded 246 similar events)
// Phase 1: matrix 52 rows 47 cols
[2021-05-18 02:39:55] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:39:55] [INFO ] Implicit Places using invariants in 37 ms returned []
[2021-05-18 02:39:55] [INFO ] Flow matrix only has 52 transitions (discarded 246 similar events)
// Phase 1: matrix 52 rows 47 cols
[2021-05-18 02:39:55] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 02:39:55] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 47/193 places, 298/431 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s14 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 10 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C4-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-14 finished in 392 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 431/431 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 193 transition count 407
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 169 transition count 407
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 48 place count 169 transition count 399
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 64 place count 161 transition count 399
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 83 place count 142 transition count 380
Iterating global reduction 2 with 19 rules applied. Total rules applied 102 place count 142 transition count 380
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 138 transition count 376
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 138 transition count 376
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 136 transition count 376
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 112 place count 136 transition count 374
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 134 transition count 374
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 118 place count 132 transition count 372
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 132 transition count 372
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 130 transition count 370
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 130 transition count 370
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 130 place count 124 transition count 364
Iterating global reduction 3 with 6 rules applied. Total rules applied 136 place count 124 transition count 364
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 182 place count 101 transition count 341
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 190 place count 93 transition count 333
Iterating global reduction 3 with 8 rules applied. Total rules applied 198 place count 93 transition count 333
Applied a total of 198 rules in 21 ms. Remains 93 /193 variables (removed 100) and now considering 333/431 (removed 98) transitions.
[2021-05-18 02:39:55] [INFO ] Flow matrix only has 132 transitions (discarded 201 similar events)
// Phase 1: matrix 132 rows 93 cols
[2021-05-18 02:39:55] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-18 02:39:55] [INFO ] Implicit Places using invariants in 70 ms returned [10, 17, 25, 29, 36, 39, 46, 53, 67, 70, 76]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 71 ms to find 11 implicit places.
[2021-05-18 02:39:55] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-18 02:39:55] [INFO ] Flow matrix only has 132 transitions (discarded 201 similar events)
// Phase 1: matrix 132 rows 82 cols
[2021-05-18 02:39:55] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 02:39:55] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned []
Starting structural reductions, iteration 1 : 82/193 places, 333/431 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 63 transition count 314
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 63 transition count 314
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 59 transition count 310
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 59 transition count 310
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 53 transition count 304
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 53 transition count 304
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 47 transition count 298
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 45 transition count 296
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 45 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 44 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 44 transition count 295
Applied a total of 76 rules in 15 ms. Remains 44 /82 variables (removed 38) and now considering 295/333 (removed 38) transitions.
[2021-05-18 02:39:55] [INFO ] Flow matrix only has 42 transitions (discarded 253 similar events)
// Phase 1: matrix 42 rows 44 cols
[2021-05-18 02:39:55] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 02:39:55] [INFO ] Implicit Places using invariants in 34 ms returned []
[2021-05-18 02:39:55] [INFO ] Flow matrix only has 42 transitions (discarded 253 similar events)
// Phase 1: matrix 42 rows 44 cols
[2021-05-18 02:39:55] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 02:39:55] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 44/193 places, 295/431 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s17 1) (LT s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7421 reset in 176 ms.
Product exploration explored 100000 steps with 7409 reset in 196 ms.
Graph (complete) has 405 edges and 44 vertex of which 42 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7430 reset in 176 ms.
Product exploration explored 100000 steps with 7434 reset in 190 ms.
[2021-05-18 02:39:56] [INFO ] Flatten gal took : 8 ms
[2021-05-18 02:39:56] [INFO ] Flatten gal took : 8 ms
[2021-05-18 02:39:56] [INFO ] Time to serialize gal into /tmp/LTL8843712140771778511.gal : 2 ms
[2021-05-18 02:39:56] [INFO ] Time to serialize properties into /tmp/LTL3208781709202962011.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8843712140771778511.gal, -t, CGAL, -LTL, /tmp/LTL3208781709202962011.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8843712140771778511.gal -t CGAL -LTL /tmp/LTL3208781709202962011.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((Node6WantsToManageTheBreakDownOfNode16<1)||(NoNodeManageTheBreakDownOfNode16<1))"))))
Formula 0 simplified : !GF"((Node6WantsToManageTheBreakDownOfNode16<1)||(NoNodeManageTheBreakDownOfNode16<1))"
Reverse transition relation is NOT exact ! Due to transitions t61, t304, t308, t34.t3, t150.t3, t225.t3, t259.t3, t1.t2.t3, t6.t2.t3, t7.t2.t3, t10.t2.t3, t14.t2.t3, t37.t2.t3, t39.t2.t3, t42.t2.t3, t54.t2.t3, t55.t2.t3, t57.t2.t3, t59.t2.t3, t80.t2.t3, t81.t2.t3, t83.t2.t3, t85.t2.t3, t130.t2.t3, t131.t2.t3, t132.t2.t3, t136.t2.t3, t148.t2.t3, t149.t2.t3, t155.t2.t3, t156.t2.t3, t197.t2.t3, t198.t2.t3, t199.t2.t3, t201.t2.t3, t204.t2.t3, t223.t2.t3, t224.t2.t3, t229.t2.t3, t231.t2.t3, t252.t2.t3, t253.t2.t3, t254.t2.t3, t256.t2.t3, t273.t2.t3, t274.t2.t3, t275.t2.t3, t278.t2.t3, t280.t2.t3, t293.t2.t3, t294.t2.t3, t295.t2.t3, t297.t2.t3, t299.t2.t3, t322.t2.t3, t323.t2.t3, t324.t2.t3, t327.t2.t3, t329.t2.t3, t371.t2.t3, t372.t2.t3, t373.t2.t3, t375.t2.t3, t377.t2.t3, t391.t2.t3, t392.t2.t3, t393.t2.t3, t395.t2.t3, t397.t2.t3, t30.t18, t65.t18, t69.t18, t70.t18, t75.t18, t166.t18, t312.t18, t317.t18, t382.t18, t399.t18, t16.t17.t18, t21.t17.t18, t22.t17.t18, t23.t17.t18, t28.t17.t18, t44.t17.t18, t45.t17.t18, t46.t17.t18, t47.t17.t18, t50.t17.t18, t120.t17.t18, t121.t17.t18, t122.t17.t18, t123.t17.t18, t126.t17.t18, t138.t17.t18, t139.t17.t18, t140.t17.t18, t141.t17.t18, t144.t17.t18, t158.t17.t18, t159.t17.t18, t160.t17.t18, t161.t17.t18, t164.t17.t18, t186.t17.t18, t187.t17.t18, t188.t17.t18, t189.t17.t18, t193.t17.t18, t263.t17.t18, t264.t17.t18, t265.t17.t18, t268.t17.t18, t282.t17.t18, t283.t17.t18, t284.t17.t18, t289.t17.t18, t331.t17.t18, t332.t17.t18, t333.t17.t18, t334.t17.t18, t336.t17.t18, t361.t17.t18, t362.t17.t18, t363.t17.t18, t364.t17.t18, t367.t17.t18, t379.t17.t18, t380.t17.t18, t381.t17.t18, t402.t17.t18, t403.t17.t18, t404.t17.t18, t408.t17.t18, t87.t88.t89, t91.t88.t89, t92.t88.t89, t93.t88.t89, t100.t88.t89, t109.t110.t111, t113.t110.t111, t114.t110.t111, t115.t110.t111, t118.t110.t111, t173.t174.t171, t175.t174.t171, t176.t174.t171, t179.t174.t171, t185.t174.t171, t205.t206.t207, t209.t206.t207, t210.t206.t207, t211.t206.t207, t218.t206.t207, t232.t233.t234, t236.t233.t234, t237.t233.t234, t238.t233.t234, t243.t244.t245, t348.t341, t343.t344.t345, t352.t353.t341, t356.t353.t341, t359.t353.t341, t15.t2.t3.t168, t43.t2.t3.t168, t60.t2.t3.t168, t86.t2.t3.t168, t137.t2.t3.t168, t157.t2.t3.t168, t300.t18.t168, t262.t17.t18.t168, t281.t17.t18.t168, t330.t17.t18.t168, t360.t17.t18.t168, t378.t17.t18.t168, t398.t17.t18.t168, t119.t110.t111.t168, t8.t9.t3, t11.t9.t3, t32.t9.t3, t38.t9.t3, t40.t9.t3, t53.t9.t3, t56.t9.t3, t58.t9.t3, t79.t9.t3, t82.t9.t3, t84.t9.t3, t129.t9.t3, t133.t9.t3, t135.t9.t3, t147.t9.t3, t153.t9.t3, t196.t9.t3, t200.t9.t3, t202.t9.t3, t222.t9.t3, t228.t9.t3, t230.t9.t3, t251.t9.t3, t255.t9.t3, t257.t9.t3, t271.t9.t3, t276.t9.t3, t279.t9.t3, t292.t9.t3, t296.t9.t3, t298.t9.t3, t321.t9.t3, t325.t9.t3, t328.t9.t3, t370.t9.t3, t374.t9.t3, t376.t9.t3, t390.t9.t3, t394.t9.t3, t396.t9.t3, t24.t25.t18, t26.t25.t18, t48.t25.t18, t49.t25.t18, t71.t25.t18, t73.t25.t18, t124.t25.t18, t125.t25.t18, t142.t25.t18, t143.t25.t18, t162.t25.t18, t163.t25.t18, t190.t25.t18, t192.t25.t18, t266.t25.t18, t267.t25.t18, t285.t25.t18, t286.t25.t18, t313.t25.t18, t315.t25.t18, t335.t25.t18, t365.t25.t18, t385.t25.t18, t386.t25.t18, t405.t25.t18, t406.t25.t18, t94.t95.t89, t96.t95.t89, t212.t95.t89, t214.t95.t89, t239.t95.t89, t241.t95.t89, t104.t105.t106, t116.t105.t106, t169.t105.t106, t177.t105.t106, t180.t105.t106, t339.t105.t106, t354.t105.t106, t357.t105.t106, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/37/258/295
Computing Next relation with stutter on 10304 deadlock states
28 unique states visited
0 strongly connected components in search stack
30 transitions explored
16 items max in DFS search stack
206 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.09541,76308,1,0,900,505664,620,357,2977,339760,809
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S16C4-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property LeafsetExtension-PT-S16C4-15 finished in 3596 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6993243513371298436
[2021-05-18 02:40:03] [INFO ] Computing symmetric may disable matrix : 431 transitions.
[2021-05-18 02:40:03] [INFO ] Applying decomposition
[2021-05-18 02:40:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 02:40:03] [INFO ] Computing symmetric may enable matrix : 431 transitions.
[2021-05-18 02:40:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 02:40:03] [INFO ] Flatten gal took : 15 ms
[2021-05-18 02:40:03] [INFO ] Computing Do-Not-Accords matrix : 431 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10940777764615781798.txt, -o, /tmp/graph10940777764615781798.bin, -w, /tmp/graph10940777764615781798.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10940777764615781798.bin, -l, -1, -v, -w, /tmp/graph10940777764615781798.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 02:40:03] [INFO ] Decomposing Gal with order
[2021-05-18 02:40:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 02:40:03] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 02:40:03] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6993243513371298436
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6993243513371298436]
[2021-05-18 02:40:03] [INFO ] Removed a total of 453 redundant transitions.
[2021-05-18 02:40:03] [INFO ] Flatten gal took : 43 ms
[2021-05-18 02:40:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 7 ms.
[2021-05-18 02:40:09] [INFO ] Time to serialize gal into /tmp/LTLFireability8225493206385636571.gal : 5686 ms
[2021-05-18 02:40:09] [INFO ] Time to serialize properties into /tmp/LTLFireability10833916822811886918.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability8225493206385636571.gal, -t, CGAL, -LTL, /tmp/LTLFireability10833916822811886918.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability8225493206385636571.gal -t CGAL -LTL /tmp/LTLFireability10833916822811886918.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X("(i10.u14.Node14HasTheLeafSetOfLxToReplaceNode1>=1)"))||((F("(i10.u14.Node7HasTheLeafSetOfLxToReplaceNode6<1)"))&&(F("(i4.u5.Node1ManageTheBreakDownOfNode2<1)"))))))
Formula 0 simplified : !X(X"(i10.u14.Node14HasTheLeafSetOfLxToReplaceNode1>=1)" | (F"(i10.u14.Node7HasTheLeafSetOfLxToReplaceNode6<1)" & F"(i4.u5.Node1ManageTheBreakDownOfNode2<1)"))
Compilation finished in 6576 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6993243513371298436]
Link finished in 55 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((X((LTLAPp0==true))||(<>((LTLAPp1==true))&&<>((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6993243513371298436]
LTSmin run took 388 ms.
FORMULA LeafsetExtension-PT-S16C4-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621305612138

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S16C4"
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 LeafsetExtension-PT-S16C4, 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 r292-tall-162124156600517"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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