fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r292-tall-162124156600509
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for LeafsetExtension-PT-S16C3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
693.128 49458.00 73434.00 633.20 FFFFFTFTFFFFTFFT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 50K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 190K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.7K May 11 18:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 11 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 15:49 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-S16C3-00
FORMULA_NAME LeafsetExtension-PT-S16C3-01
FORMULA_NAME LeafsetExtension-PT-S16C3-02
FORMULA_NAME LeafsetExtension-PT-S16C3-03
FORMULA_NAME LeafsetExtension-PT-S16C3-04
FORMULA_NAME LeafsetExtension-PT-S16C3-05
FORMULA_NAME LeafsetExtension-PT-S16C3-06
FORMULA_NAME LeafsetExtension-PT-S16C3-07
FORMULA_NAME LeafsetExtension-PT-S16C3-08
FORMULA_NAME LeafsetExtension-PT-S16C3-09
FORMULA_NAME LeafsetExtension-PT-S16C3-10
FORMULA_NAME LeafsetExtension-PT-S16C3-11
FORMULA_NAME LeafsetExtension-PT-S16C3-12
FORMULA_NAME LeafsetExtension-PT-S16C3-13
FORMULA_NAME LeafsetExtension-PT-S16C3-14
FORMULA_NAME LeafsetExtension-PT-S16C3-15

=== Now, execution of the tool begins

BK_START 1621303648183

Running Version 0
[2021-05-18 02:07:30] [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:07:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 02:07:31] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2021-05-18 02:07:31] [INFO ] Transformed 1542 places.
[2021-05-18 02:07:31] [INFO ] Transformed 1449 transitions.
[2021-05-18 02:07:31] [INFO ] Parsed PT model containing 1542 places and 1449 transitions in 265 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-18 02:07:31] [INFO ] Initial state test concluded for 3 properties.
FORMULA LeafsetExtension-PT-S16C3-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 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 266 places :
Symmetric choice reduction at 1 with 266 rule applications. Total rules 559 place count 983 transition count 1183
Iterating global reduction 1 with 266 rules applied. Total rules applied 825 place count 983 transition count 1183
Discarding 227 places :
Symmetric choice reduction at 1 with 227 rule applications. Total rules 1052 place count 756 transition count 956
Iterating global reduction 1 with 227 rules applied. Total rules applied 1279 place count 756 transition count 956
Discarding 221 places :
Symmetric choice reduction at 1 with 221 rule applications. Total rules 1500 place count 535 transition count 735
Iterating global reduction 1 with 221 rules applied. Total rules applied 1721 place count 535 transition count 735
Discarding 18 places :
Implicit places reduction removed 18 places
Iterating post reduction 1 with 18 rules applied. Total rules applied 1739 place count 517 transition count 735
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1755 place count 501 transition count 719
Iterating global reduction 2 with 16 rules applied. Total rules applied 1771 place count 501 transition count 719
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1787 place count 485 transition count 703
Iterating global reduction 2 with 16 rules applied. Total rules applied 1803 place count 485 transition count 703
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1819 place count 469 transition count 687
Iterating global reduction 2 with 16 rules applied. Total rules applied 1835 place count 469 transition count 687
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1851 place count 453 transition count 671
Iterating global reduction 2 with 16 rules applied. Total rules applied 1867 place count 453 transition count 671
Discarding 114 places :
Symmetric choice reduction at 2 with 114 rule applications. Total rules 1981 place count 339 transition count 557
Iterating global reduction 2 with 114 rules applied. Total rules applied 2095 place count 339 transition count 557
Applied a total of 2095 rules in 373 ms. Remains 339 /1542 variables (removed 1203) and now considering 557/1449 (removed 892) transitions.
[2021-05-18 02:07:31] [INFO ] Flow matrix only has 443 transitions (discarded 114 similar events)
// Phase 1: matrix 443 rows 339 cols
[2021-05-18 02:07:31] [INFO ] Computed 36 place invariants in 32 ms
[2021-05-18 02:07:32] [INFO ] Implicit Places using invariants in 396 ms returned [4, 33, 45, 62, 90, 119, 137, 139, 154, 168, 172, 199, 206, 229, 235, 251, 265, 297, 315]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 424 ms to find 19 implicit places.
[2021-05-18 02:07:32] [INFO ] Flow matrix only has 443 transitions (discarded 114 similar events)
// Phase 1: matrix 443 rows 320 cols
[2021-05-18 02:07:32] [INFO ] Computed 17 place invariants in 7 ms
[2021-05-18 02:07:32] [INFO ] Dead Transitions using invariants and state equation in 338 ms returned []
Starting structural reductions, iteration 1 : 320/1542 places, 557/1449 transitions.
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 89 place count 231 transition count 468
Iterating global reduction 0 with 89 rules applied. Total rules applied 178 place count 231 transition count 468
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 183 place count 226 transition count 463
Iterating global reduction 0 with 5 rules applied. Total rules applied 188 place count 226 transition count 463
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 193 place count 221 transition count 458
Iterating global reduction 0 with 5 rules applied. Total rules applied 198 place count 221 transition count 458
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 203 place count 216 transition count 453
Iterating global reduction 0 with 5 rules applied. Total rules applied 208 place count 216 transition count 453
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 223 place count 201 transition count 438
Iterating global reduction 0 with 15 rules applied. Total rules applied 238 place count 201 transition count 438
Applied a total of 238 rules in 39 ms. Remains 201 /320 variables (removed 119) and now considering 438/557 (removed 119) transitions.
[2021-05-18 02:07:32] [INFO ] Flow matrix only has 284 transitions (discarded 154 similar events)
// Phase 1: matrix 284 rows 201 cols
[2021-05-18 02:07:32] [INFO ] Computed 17 place invariants in 4 ms
[2021-05-18 02:07:32] [INFO ] Implicit Places using invariants in 162 ms returned []
[2021-05-18 02:07:32] [INFO ] Flow matrix only has 284 transitions (discarded 154 similar events)
// Phase 1: matrix 284 rows 201 cols
[2021-05-18 02:07:32] [INFO ] Computed 17 place invariants in 4 ms
[2021-05-18 02:07:33] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 201/1542 places, 438/1449 transitions.
[2021-05-18 02:07:33] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-18 02:07:33] [INFO ] Flatten gal took : 73 ms
FORMULA LeafsetExtension-PT-S16C3-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C3-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C3-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 02:07:33] [INFO ] Flatten gal took : 33 ms
[2021-05-18 02:07:33] [INFO ] Input system was already deterministic with 438 transitions.
Incomplete random walk after 100000 steps, including 3686 resets, run finished after 437 ms. (steps per millisecond=228 ) properties (out of 27) seen :25
Running SMT prover for 2 properties.
[2021-05-18 02:07:33] [INFO ] Flow matrix only has 284 transitions (discarded 154 similar events)
// Phase 1: matrix 284 rows 201 cols
[2021-05-18 02:07:33] [INFO ] Computed 17 place invariants in 5 ms
[2021-05-18 02:07:33] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 5 ms returned sat
[2021-05-18 02:07:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:07:34] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-18 02:07:34] [INFO ] Computed and/alt/rep : 301/480/255 causal constraints (skipped 12 transitions) in 16 ms.
[2021-05-18 02:07:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:07:34] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 10 ms returned sat
[2021-05-18 02:07:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:07:34] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-18 02:07:34] [INFO ] Computed and/alt/rep : 301/480/255 causal constraints (skipped 12 transitions) in 16 ms.
[2021-05-18 02:07:34] [INFO ] Added : 15 causal constraints over 4 iterations in 119 ms. Result :sat
[2021-05-18 02:07:34] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 5 ms returned sat
[2021-05-18 02:07:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:07:34] [INFO ] [Real]Absence check using state equation in 44 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2021-05-18 02:07:34] [INFO ] Initial state test concluded for 1 properties.
FORMULA LeafsetExtension-PT-S16C3-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)&&(X(p1) U ((p2&&X(p1))||X(G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 201 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 201/201 places, 438/438 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 182 transition count 419
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 182 transition count 419
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 53 place count 167 transition count 404
Iterating global reduction 0 with 15 rules applied. Total rules applied 68 place count 167 transition count 404
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 73 place count 162 transition count 404
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 87 place count 148 transition count 390
Iterating global reduction 1 with 14 rules applied. Total rules applied 101 place count 148 transition count 390
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 106 place count 143 transition count 390
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 120 place count 129 transition count 376
Iterating global reduction 2 with 14 rules applied. Total rules applied 134 place count 129 transition count 376
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 144 place count 119 transition count 366
Iterating global reduction 2 with 10 rules applied. Total rules applied 154 place count 119 transition count 366
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 164 place count 109 transition count 356
Iterating global reduction 2 with 10 rules applied. Total rules applied 174 place count 109 transition count 356
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 192 place count 91 transition count 338
Iterating global reduction 2 with 18 rules applied. Total rules applied 210 place count 91 transition count 338
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 224 place count 77 transition count 324
Iterating global reduction 2 with 14 rules applied. Total rules applied 238 place count 77 transition count 324
Applied a total of 238 rules in 27 ms. Remains 77 /201 variables (removed 124) and now considering 324/438 (removed 114) transitions.
[2021-05-18 02:07:34] [INFO ] Flow matrix only has 85 transitions (discarded 239 similar events)
// Phase 1: matrix 85 rows 77 cols
[2021-05-18 02:07:34] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-18 02:07:34] [INFO ] Implicit Places using invariants in 46 ms returned [26, 30, 57]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
[2021-05-18 02:07:34] [INFO ] Flow matrix only has 85 transitions (discarded 239 similar events)
// Phase 1: matrix 85 rows 74 cols
[2021-05-18 02:07:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 02:07:34] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Starting structural reductions, iteration 1 : 74/201 places, 324/438 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 66 transition count 316
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 66 transition count 316
Applied a total of 16 rules in 4 ms. Remains 66 /74 variables (removed 8) and now considering 316/324 (removed 8) transitions.
[2021-05-18 02:07:34] [INFO ] Flow matrix only has 74 transitions (discarded 242 similar events)
// Phase 1: matrix 74 rows 66 cols
[2021-05-18 02:07:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 02:07:34] [INFO ] Implicit Places using invariants in 37 ms returned []
[2021-05-18 02:07:34] [INFO ] Flow matrix only has 74 transitions (discarded 242 similar events)
// Phase 1: matrix 74 rows 66 cols
[2021-05-18 02:07:34] [INFO ] Computed 4 place invariants in 5 ms
[2021-05-18 02:07:34] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 66/201 places, 316/438 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : LeafsetExtension-PT-S16C3-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s28 1)), p2:(LT s42 1), p1:(AND (GEQ s33 1) (GEQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S16C3-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-00 finished in 683 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((p0 U p1) U X((p2 U p3))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 201/201 places, 438/438 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 183 transition count 420
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 183 transition count 420
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 49 place count 170 transition count 407
Iterating global reduction 0 with 13 rules applied. Total rules applied 62 place count 170 transition count 407
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 167 transition count 407
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 75 place count 157 transition count 397
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 157 transition count 397
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 90 place count 152 transition count 397
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 102 place count 140 transition count 385
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 140 transition count 385
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 122 place count 132 transition count 377
Iterating global reduction 2 with 8 rules applied. Total rules applied 130 place count 132 transition count 377
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 138 place count 124 transition count 369
Iterating global reduction 2 with 8 rules applied. Total rules applied 146 place count 124 transition count 369
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 161 place count 109 transition count 354
Iterating global reduction 2 with 15 rules applied. Total rules applied 176 place count 109 transition count 354
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 191 place count 94 transition count 339
Iterating global reduction 2 with 15 rules applied. Total rules applied 206 place count 94 transition count 339
Applied a total of 206 rules in 18 ms. Remains 94 /201 variables (removed 107) and now considering 339/438 (removed 99) transitions.
[2021-05-18 02:07:35] [INFO ] Flow matrix only has 115 transitions (discarded 224 similar events)
// Phase 1: matrix 115 rows 94 cols
[2021-05-18 02:07:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-18 02:07:35] [INFO ] Implicit Places using invariants in 62 ms returned [18, 38, 42, 64, 75]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 65 ms to find 5 implicit places.
[2021-05-18 02:07:35] [INFO ] Flow matrix only has 115 transitions (discarded 224 similar events)
// Phase 1: matrix 115 rows 89 cols
[2021-05-18 02:07:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 02:07:35] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Starting structural reductions, iteration 1 : 89/201 places, 339/438 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 78 transition count 328
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 78 transition count 328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 77 transition count 327
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 77 transition count 327
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 76 transition count 326
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 76 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 75 transition count 325
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 75 transition count 325
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 74 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 74 transition count 324
Applied a total of 30 rules in 8 ms. Remains 74 /89 variables (removed 15) and now considering 324/339 (removed 15) transitions.
[2021-05-18 02:07:35] [INFO ] Flow matrix only has 90 transitions (discarded 234 similar events)
// Phase 1: matrix 90 rows 74 cols
[2021-05-18 02:07:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 02:07:35] [INFO ] Implicit Places using invariants in 58 ms returned []
[2021-05-18 02:07:35] [INFO ] Flow matrix only has 90 transitions (discarded 234 similar events)
// Phase 1: matrix 90 rows 74 cols
[2021-05-18 02:07:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-18 02:07:35] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 74/201 places, 324/438 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p0) (NOT p3) p2)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 3}], [{ cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2)), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 p3), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s23 1) (GEQ s25 1)), p0:(GEQ s61 1), p3:(GEQ s6 1), p2:(AND (GEQ s49 1) (GEQ s51 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 26 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C3-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-01 finished in 546 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 201/201 places, 438/438 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 182 transition count 419
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 182 transition count 419
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 53 place count 167 transition count 404
Iterating global reduction 0 with 15 rules applied. Total rules applied 68 place count 167 transition count 404
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 73 place count 162 transition count 404
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 85 place count 150 transition count 392
Iterating global reduction 1 with 12 rules applied. Total rules applied 97 place count 150 transition count 392
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 101 place count 146 transition count 392
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 113 place count 134 transition count 380
Iterating global reduction 2 with 12 rules applied. Total rules applied 125 place count 134 transition count 380
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 134 place count 125 transition count 371
Iterating global reduction 2 with 9 rules applied. Total rules applied 143 place count 125 transition count 371
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 152 place count 116 transition count 362
Iterating global reduction 2 with 9 rules applied. Total rules applied 161 place count 116 transition count 362
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 180 place count 97 transition count 343
Iterating global reduction 2 with 19 rules applied. Total rules applied 199 place count 97 transition count 343
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 212 place count 84 transition count 330
Iterating global reduction 2 with 13 rules applied. Total rules applied 225 place count 84 transition count 330
Applied a total of 225 rules in 30 ms. Remains 84 /201 variables (removed 117) and now considering 330/438 (removed 108) transitions.
[2021-05-18 02:07:35] [INFO ] Flow matrix only has 97 transitions (discarded 233 similar events)
// Phase 1: matrix 97 rows 84 cols
[2021-05-18 02:07:35] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-18 02:07:35] [INFO ] Implicit Places using invariants in 58 ms returned [16, 26, 30, 44]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
[2021-05-18 02:07:35] [INFO ] Flow matrix only has 97 transitions (discarded 233 similar events)
// Phase 1: matrix 97 rows 80 cols
[2021-05-18 02:07:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-18 02:07:35] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Starting structural reductions, iteration 1 : 80/201 places, 330/438 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 71 transition count 321
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 71 transition count 321
Applied a total of 18 rules in 9 ms. Remains 71 /80 variables (removed 9) and now considering 321/330 (removed 9) transitions.
[2021-05-18 02:07:35] [INFO ] Flow matrix only has 85 transitions (discarded 236 similar events)
// Phase 1: matrix 85 rows 71 cols
[2021-05-18 02:07:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 02:07:35] [INFO ] Implicit Places using invariants in 37 ms returned []
[2021-05-18 02:07:35] [INFO ] Flow matrix only has 85 transitions (discarded 236 similar events)
// Phase 1: matrix 85 rows 71 cols
[2021-05-18 02:07:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 02:07:36] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 71/201 places, 321/438 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S16C3-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (GEQ s58 1) (AND (GEQ s47 1) (GEQ s49 1))) (GEQ s47 1) (GEQ s49 1) (LT s58 1)), p1:(LT s58 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 727 steps with 30 reset in 7 ms.
FORMULA LeafsetExtension-PT-S16C3-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-02 finished in 472 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U (p1||X(((p2&&G(F(p3))) U (G(F(p3))&&p4))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 201 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 201/201 places, 438/438 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 183 transition count 420
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 183 transition count 420
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 52 place count 167 transition count 404
Iterating global reduction 0 with 16 rules applied. Total rules applied 68 place count 167 transition count 404
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 74 place count 161 transition count 404
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 88 place count 147 transition count 390
Iterating global reduction 1 with 14 rules applied. Total rules applied 102 place count 147 transition count 390
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 106 place count 143 transition count 390
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 120 place count 129 transition count 376
Iterating global reduction 2 with 14 rules applied. Total rules applied 134 place count 129 transition count 376
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 144 place count 119 transition count 366
Iterating global reduction 2 with 10 rules applied. Total rules applied 154 place count 119 transition count 366
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 164 place count 109 transition count 356
Iterating global reduction 2 with 10 rules applied. Total rules applied 174 place count 109 transition count 356
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 195 place count 88 transition count 335
Iterating global reduction 2 with 21 rules applied. Total rules applied 216 place count 88 transition count 335
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 227 place count 77 transition count 324
Iterating global reduction 2 with 11 rules applied. Total rules applied 238 place count 77 transition count 324
Applied a total of 238 rules in 14 ms. Remains 77 /201 variables (removed 124) and now considering 324/438 (removed 114) transitions.
[2021-05-18 02:07:36] [INFO ] Flow matrix only has 85 transitions (discarded 239 similar events)
// Phase 1: matrix 85 rows 77 cols
[2021-05-18 02:07:36] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-18 02:07:36] [INFO ] Implicit Places using invariants in 49 ms returned [16, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
[2021-05-18 02:07:36] [INFO ] Flow matrix only has 85 transitions (discarded 239 similar events)
// Phase 1: matrix 85 rows 75 cols
[2021-05-18 02:07:36] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-18 02:07:36] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Starting structural reductions, iteration 1 : 75/201 places, 324/438 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 70 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 70 transition count 319
Applied a total of 10 rules in 2 ms. Remains 70 /75 variables (removed 5) and now considering 319/324 (removed 5) transitions.
[2021-05-18 02:07:36] [INFO ] Flow matrix only has 79 transitions (discarded 240 similar events)
// Phase 1: matrix 79 rows 70 cols
[2021-05-18 02:07:36] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-18 02:07:36] [INFO ] Implicit Places using invariants in 43 ms returned []
[2021-05-18 02:07:36] [INFO ] Flow matrix only has 79 transitions (discarded 240 similar events)
// Phase 1: matrix 79 rows 70 cols
[2021-05-18 02:07:36] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-18 02:07:36] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 70/201 places, 319/438 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), true, (NOT p3), (NOT p3), (OR (NOT p4) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : LeafsetExtension-PT-S16C3-03 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p4) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p4 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p4), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p4) p2), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p4)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p4)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p4), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p1) p4 (NOT p3)), acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p4) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p4 (NOT p3)), acceptance={} source=6 dest: 4}, { cond=p4, acceptance={} source=6 dest: 5}, { cond=(AND (NOT p4) p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(AND (GEQ s28 1) (GEQ s40 1)), p0:(AND (GEQ s32 1) (GEQ s61 1)), p4:(AND (GEQ s56 1) (GEQ s28 1) (GEQ s40 1)), p2:(GEQ s56 1), p3:(OR (LT s23 1) (LT s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C3-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-03 finished in 633 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((p0 U (p1||G(p0)))&&(F(p2)||X(p3))))))], workingDir=/home/mcc/execution]
Support contains 9 out of 201 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 201/201 places, 438/438 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 183 transition count 420
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 183 transition count 420
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 51 place count 168 transition count 405
Iterating global reduction 0 with 15 rules applied. Total rules applied 66 place count 168 transition count 405
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 71 place count 163 transition count 405
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 83 place count 151 transition count 393
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 151 transition count 393
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 99 place count 147 transition count 393
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 111 place count 135 transition count 381
Iterating global reduction 2 with 12 rules applied. Total rules applied 123 place count 135 transition count 381
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 132 place count 126 transition count 372
Iterating global reduction 2 with 9 rules applied. Total rules applied 141 place count 126 transition count 372
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 150 place count 117 transition count 363
Iterating global reduction 2 with 9 rules applied. Total rules applied 159 place count 117 transition count 363
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 176 place count 100 transition count 346
Iterating global reduction 2 with 17 rules applied. Total rules applied 193 place count 100 transition count 346
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 205 place count 88 transition count 334
Iterating global reduction 2 with 12 rules applied. Total rules applied 217 place count 88 transition count 334
Applied a total of 217 rules in 10 ms. Remains 88 /201 variables (removed 113) and now considering 334/438 (removed 104) transitions.
[2021-05-18 02:07:36] [INFO ] Flow matrix only has 102 transitions (discarded 232 similar events)
// Phase 1: matrix 102 rows 88 cols
[2021-05-18 02:07:36] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-18 02:07:36] [INFO ] Implicit Places using invariants in 46 ms returned [16, 27, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
[2021-05-18 02:07:36] [INFO ] Flow matrix only has 102 transitions (discarded 232 similar events)
// Phase 1: matrix 102 rows 85 cols
[2021-05-18 02:07:36] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-18 02:07:37] [INFO ] Dead Transitions using invariants and state equation in 141 ms returned []
Starting structural reductions, iteration 1 : 85/201 places, 334/438 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 76 transition count 325
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 76 transition count 325
Applied a total of 18 rules in 2 ms. Remains 76 /85 variables (removed 9) and now considering 325/334 (removed 9) transitions.
[2021-05-18 02:07:37] [INFO ] Flow matrix only has 91 transitions (discarded 234 similar events)
// Phase 1: matrix 91 rows 76 cols
[2021-05-18 02:07:37] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-18 02:07:37] [INFO ] Implicit Places using invariants in 80 ms returned []
[2021-05-18 02:07:37] [INFO ] Flow matrix only has 91 transitions (discarded 234 similar events)
// Phase 1: matrix 91 rows 76 cols
[2021-05-18 02:07:37] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-18 02:07:37] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 76/201 places, 325/438 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S16C3-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p0 (NOT p3))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={0, 1} source=1 dest: 3}, { cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p0 (NOT p3))), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={1} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p1:(AND (OR (LT s30 1) (LT s19 1) (LT s34 1)) (OR (LT s58 1) (LT s61 1))), p0:(OR (LT s58 1) (LT s61 1)), p2:(OR (LT s1 1) (LT s64 1)), p3:(OR (LT s44 1) (LT s49 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4321 reset in 342 ms.
Product exploration explored 100000 steps with 4382 reset in 292 ms.
Graph (complete) has 480 edges and 76 vertex of which 58 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.7 ms
Knowledge obtained : [p1, p0, p2, p3]
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 4390 reset in 244 ms.
Product exploration explored 100000 steps with 4378 reset in 275 ms.
Applying partial POR strategy [true, true, true, true, true]
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 9 out of 76 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 76/76 places, 325/325 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 76 transition count 325
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 6 place count 76 transition count 326
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 76 transition count 326
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 74 transition count 324
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 74 transition count 324
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 23 place count 74 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 69 transition count 319
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 69 transition count 319
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 33 rules in 31 ms. Remains 69 /76 variables (removed 7) and now considering 319/325 (removed 6) transitions.
[2021-05-18 02:07:39] [INFO ] Redundant transitions in 18 ms returned []
[2021-05-18 02:07:39] [INFO ] Flow matrix only has 83 transitions (discarded 236 similar events)
// Phase 1: matrix 83 rows 69 cols
[2021-05-18 02:07:39] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-18 02:07:39] [INFO ] Dead Transitions using invariants and state equation in 119 ms returned []
Finished structural reductions, in 1 iterations. Remains : 69/76 places, 319/325 transitions.
Product exploration explored 100000 steps with 8684 reset in 341 ms.
Product exploration explored 100000 steps with 8685 reset in 364 ms.
[2021-05-18 02:07:40] [INFO ] Flatten gal took : 18 ms
[2021-05-18 02:07:40] [INFO ] Flatten gal took : 18 ms
[2021-05-18 02:07:40] [INFO ] Time to serialize gal into /tmp/LTL10684215257804228265.gal : 8 ms
[2021-05-18 02:07:40] [INFO ] Time to serialize properties into /tmp/LTL12813086375868824439.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/LTL10684215257804228265.gal, -t, CGAL, -LTL, /tmp/LTL12813086375868824439.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/LTL10684215257804228265.gal -t CGAL -LTL /tmp/LTL12813086375868824439.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G((("((Node14HasAskedItsLeafSetToLxToReplaceNode2<1)||(LeafSetOfLxIsSentToNode14<1))")U(("((((Node5HasTheLeafSetOfLxToReplaceNode2<1)||(Node3WantsToManageTheBreakDownOfNode5<1))||(NoNodeManageTheBreakDownOfNode5<1))&&((Node14HasAskedItsLeafSetToLxToReplaceNode2<1)||(LeafSetOfLxIsSentToNode14<1)))")||(G("((Node14HasAskedItsLeafSetToLxToReplaceNode2<1)||(LeafSetOfLxIsSentToNode14<1))"))))&&((F("((Node0IsActive<1)||(Node15DontAnswerToAnyNode<1))"))||(X("((Node10IsActive<1)||(Node12DontAnswerToAnyNode<1))")))))))
Formula 0 simplified : !FG(("((Node14HasAskedItsLeafSetToLxToReplaceNode2<1)||(LeafSetOfLxIsSentToNode14<1))" U ("((((Node5HasTheLeafSetOfLxToReplaceNode2<1)||(Node3WantsToManageTheBreakDownOfNode5<1))||(NoNodeManageTheBreakDownOfNode5<1))&&((Node14HasAskedItsLeafSetToLxToReplaceNode2<1)||(LeafSetOfLxIsSentToNode14<1)))" | G"((Node14HasAskedItsLeafSetToLxToReplaceNode2<1)||(LeafSetOfLxIsSentToNode14<1))")) & (F"((Node0IsActive<1)||(Node15DontAnswerToAnyNode<1))" | X"((Node10IsActive<1)||(Node12DontAnswerToAnyNode<1))"))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t6, t7, t8, t11, t12, t15, t16, t17, t22, t23, t25, t26, t27, t28, t29, t31, t33, t36, t37, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t51, t55, t57, t58, t64, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, t76, t77, t78, t79, t81, t82, t83, t84, t85, t89, t90, t92, t93, t94, t98, t99, t101, t102, t103, t104, t106, t107, t108, t109, t110, t111, t112, t113, t114, t115, t116, t118, t121, t122, t128, t129, t130, t132, t133, t134, t135, t136, t137, t138, t139, t140, t141, t142, t144, t145, t146, t147, t148, t151, t152, t153, t154, t155, t156, t158, t159, t160, t161, t162, t164, t165, t169, t171, t172, t173, t177, t182, t183, t184, t185, t186, t187, t188, t189, t190, t192, t196, t200, t201, t202, t206, t207, t208, t211, t212, t213, t214, t215, t216, t217, t219, t220, t221, t222, t225, t227, t228, t229, t233, t234, t236, t237, t242, t243, t244, t246, t247, t248, t249, t250, t252, t253, t254, t255, t256, t257, t258, t259, t260, t261, t263, t264, t265, t266, t267, t269, t270, t271, t275, t276, t277, t278, t279, t282, t286, t288, t289, t290, t291, t292, t294, t295, t296, t297, t298, t299, t301, t302, t303, t304, t306, t307, t308, t309, t310, t313, t314, t315, t316, t317, t318, t320, t321, t322, t323, t325, t326, t328, t329, t334, t335, t336, t339, t340, t341, t342, t343, t344, t345, t346, t347, t348, t351, t353, t357, t359, t360, t361, t368, t369, t370, t374, t375, t376, t378, t379, t380, t381, t386, t387, t388, t389, t390, t392, t393, t394, t398, t399, t400, t402, t403, t404, t405, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/60/265/325
Computing Next relation with stutter on 3323 deadlock states
Detected timeout of ITS tools.
[2021-05-18 02:07:55] [INFO ] Flatten gal took : 17 ms
[2021-05-18 02:07:55] [INFO ] Applying decomposition
[2021-05-18 02:07:55] [INFO ] Flatten gal took : 15 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/graph11023391234409230876.txt, -o, /tmp/graph11023391234409230876.bin, -w, /tmp/graph11023391234409230876.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/graph11023391234409230876.bin, -l, -1, -v, -w, /tmp/graph11023391234409230876.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 02:07:55] [INFO ] Decomposing Gal with order
[2021-05-18 02:07:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 02:07:55] [INFO ] Removed a total of 301 redundant transitions.
[2021-05-18 02:07:55] [INFO ] Flatten gal took : 59 ms
[2021-05-18 02:07:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 7 ms.
[2021-05-18 02:07:55] [INFO ] Time to serialize gal into /tmp/LTL5017848550949068802.gal : 3 ms
[2021-05-18 02:07:55] [INFO ] Time to serialize properties into /tmp/LTL11944050641815379072.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/LTL5017848550949068802.gal, -t, CGAL, -LTL, /tmp/LTL11944050641815379072.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/LTL5017848550949068802.gal -t CGAL -LTL /tmp/LTL11944050641815379072.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G((("((i6.u11.Node14HasAskedItsLeafSetToLxToReplaceNode2<1)||(i4.i1.u12.LeafSetOfLxIsSentToNode14<1))")U(("((((i4.i1.u16.Node5HasTheLeafSetOfLxToReplaceNode2<1)||(i5.u7.Node3WantsToManageTheBreakDownOfNode5<1))||(i5.u7.NoNodeManageTheBreakDownOfNode5<1))&&((i6.u11.Node14HasAskedItsLeafSetToLxToReplaceNode2<1)||(i4.i1.u12.LeafSetOfLxIsSentToNode14<1)))")||(G("((i6.u11.Node14HasAskedItsLeafSetToLxToReplaceNode2<1)||(i4.i1.u12.LeafSetOfLxIsSentToNode14<1))"))))&&((F("((u0.Node0IsActive<1)||(u1.Node15DontAnswerToAnyNode<1))"))||(X("((u1.Node10IsActive<1)||(u1.Node12DontAnswerToAnyNode<1))")))))))
Formula 0 simplified : !FG(("((i6.u11.Node14HasAskedItsLeafSetToLxToReplaceNode2<1)||(i4.i1.u12.LeafSetOfLxIsSentToNode14<1))" U ("((((i4.i1.u16.Node5HasTheLeafSetOfLxToReplaceNode2<1)||(i5.u7.Node3WantsToManageTheBreakDownOfNode5<1))||(i5.u7.NoNodeManageTheBreakDownOfNode5<1))&&((i6.u11.Node14HasAskedItsLeafSetToLxToReplaceNode2<1)||(i4.i1.u12.LeafSetOfLxIsSentToNode14<1)))" | G"((i6.u11.Node14HasAskedItsLeafSetToLxToReplaceNode2<1)||(i4.i1.u12.LeafSetOfLxIsSentToNode14<1))")) & (F"((u0.Node0IsActive<1)||(u1.Node15DontAnswerToAnyNode<1))" | X"((u1.Node10IsActive<1)||(u1.Node12DontAnswerToAnyNode<1))"))
Reverse transition relation is NOT exact ! Due to transitions t2, t22, t27, t89, t94, t132, t134, t136, t140, t153, t182, t184, t188, t229, t307, t315, t334, t339, t340, t342, t344, u0.t1, u0.t6, u0.t7, u0.t8, u0.t12, u0.t15, u0.t31, u0.t33, u0.t36, u0.t37, u0.t39, u0.t40, u0.t51, u0.t55, u0.t57, u0.t58, u0.t64, u0.t65, u0.t76, u0.t77, u0.t78, u0.t79, u0.t82, u0.t83, u0.t101, u0.t102, u0.t103, u0.t104, u0.t106, u0.t107, u0.t144, u0.t145, u0.t146, u0.t147, u0.t148, u0.t152, u0.t165, u0.t169, u0.t171, u0.t172, u0.t173, u0.t177, u0.t192, u0.t196, u0.t200, u0.t201, u0.t202, u0.t206, u0.t207, u1.t233, u1.t234, u1.t236, u1.t237, u1.t242, u1.t243, u1.t244, u1.t255, u1.t256, u1.t257, u1.t258, u1.t259, u1.t260, u1.t261, u1.t275, u1.t276, u1.t277, u1.t278, u1.t279, u1.t282, u1.t286, u1.t297, u1.t298, u1.t299, u1.t301, u1.t302, u1.t303, u1.t304, u1.t316, u1.t317, u1.t318, u1.t320, u1.t321, u1.t322, u1.t323, u1.t374, u1.t375, u1.t376, u1.t378, u1.t379, u1.t380, u1.t381, u1.t398, u1.t399, u1.t400, u1.t402, u1.t403, u1.t404, u1.t405, u13.t164, i4.t121, i4.i1.u16.t128, i5.t151, i5.u7.t81, i6.t326, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/43/125/168
Computing Next relation with stutter on 3323 deadlock states
850 unique states visited
0 strongly connected components in search stack
1569 transitions explored
28 items max in DFS search stack
1096 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,10.9785,263656,1,0,422103,90693,1801,1.01283e+06,1376,399854,734915
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S16C3-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property LeafsetExtension-PT-S16C3-05 finished in 31427 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 201/201 places, 438/438 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 201 transition count 414
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 177 transition count 414
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 177 transition count 402
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 165 transition count 402
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 87 place count 150 transition count 387
Iterating global reduction 2 with 15 rules applied. Total rules applied 102 place count 150 transition count 387
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 146 transition count 383
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 146 transition count 383
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 114 place count 142 transition count 383
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 114 place count 142 transition count 379
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 122 place count 138 transition count 379
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 126 place count 134 transition count 375
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 134 transition count 375
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 134 place count 130 transition count 371
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 130 transition count 371
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 144 place count 124 transition count 365
Iterating global reduction 3 with 6 rules applied. Total rules applied 150 place count 124 transition count 365
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 202 place count 98 transition count 339
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 209 place count 91 transition count 332
Iterating global reduction 3 with 7 rules applied. Total rules applied 216 place count 91 transition count 332
Applied a total of 216 rules in 73 ms. Remains 91 /201 variables (removed 110) and now considering 332/438 (removed 106) transitions.
[2021-05-18 02:08:08] [INFO ] Flow matrix only has 138 transitions (discarded 194 similar events)
// Phase 1: matrix 138 rows 91 cols
[2021-05-18 02:08:08] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-18 02:08:08] [INFO ] Implicit Places using invariants in 92 ms returned [8, 14, 23, 26, 30, 37, 44, 52, 60, 70, 76]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 93 ms to find 11 implicit places.
[2021-05-18 02:08:08] [INFO ] Redundant transitions in 5 ms returned []
[2021-05-18 02:08:08] [INFO ] Flow matrix only has 138 transitions (discarded 194 similar events)
// Phase 1: matrix 138 rows 80 cols
[2021-05-18 02:08:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 02:08:08] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Starting structural reductions, iteration 1 : 80/201 places, 332/438 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 61 transition count 313
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 61 transition count 313
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 56 transition count 308
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 56 transition count 308
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 51 transition count 303
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 51 transition count 303
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 45 transition count 297
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 43 transition count 295
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 43 transition count 295
Applied a total of 74 rules in 18 ms. Remains 43 /80 variables (removed 37) and now considering 295/332 (removed 37) transitions.
[2021-05-18 02:08:08] [INFO ] Flow matrix only has 42 transitions (discarded 253 similar events)
// Phase 1: matrix 42 rows 43 cols
[2021-05-18 02:08:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 02:08:08] [INFO ] Implicit Places using invariants in 37 ms returned []
[2021-05-18 02:08:08] [INFO ] Flow matrix only has 42 transitions (discarded 253 similar events)
// Phase 1: matrix 42 rows 43 cols
[2021-05-18 02:08:08] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 02:08:08] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 43/201 places, 295/438 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8956 reset in 266 ms.
Product exploration explored 100000 steps with 8954 reset in 219 ms.
Graph (complete) has 387 edges and 43 vertex of which 41 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8957 reset in 190 ms.
Product exploration explored 100000 steps with 8957 reset in 179 ms.
[2021-05-18 02:08:09] [INFO ] Flatten gal took : 12 ms
[2021-05-18 02:08:09] [INFO ] Flatten gal took : 11 ms
[2021-05-18 02:08:09] [INFO ] Time to serialize gal into /tmp/LTL16196385751694526736.gal : 1 ms
[2021-05-18 02:08:09] [INFO ] Time to serialize properties into /tmp/LTL8219477490184484269.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/LTL16196385751694526736.gal, -t, CGAL, -LTL, /tmp/LTL8219477490184484269.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/LTL16196385751694526736.gal -t CGAL -LTL /tmp/LTL8219477490184484269.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(Node8ManageTheBreakDownOfNode9<1)"))))
Formula 0 simplified : !FG"(Node8ManageTheBreakDownOfNode9<1)"
Reverse transition relation is NOT exact ! Due to transitions t12, t33, t94, t210, t222, t275, t276, t277, t278, t279, t282, t286, t331, t381, t1.t2, t6.t2, t7.t2, t15.t2, t36.t2, t39.t2, t40.t2, t77.t2, t78.t2, t82.t2, t83.t2, t102.t2, t103.t2, t104.t2, t106.t2, t107.t2, t145.t2, t146.t2, t147.t2, t152.t2, t220.t2, t221.t2, t227.t2, t228.t2, t247.t2, t248.t2, t249.t2, t252.t2, t253.t2, t264.t2, t265.t2, t266.t2, t269.t2, t270.t2, t289.t2, t290.t2, t291.t2, t294.t2, t295.t2, t307.t2, t308.t2, t309.t2, t313.t2, t314.t2, t329.t2, t335.t2, t340.t2, t341.t2, t387.t2, t388.t2, t389.t2, t392.t2, t393.t2, t85.t19, t89.t19, t92.t19, t93.t19, t98.t19, t99.t19, t348.t19, t374.t19, t375.t19, t378.t19, t379.t19, t380.t19, t17.t18.t19, t22.t18.t19, t25.t18.t19, t26.t18.t19, t27.t18.t19, t28.t18.t19, t29.t18.t19, t42.t18.t19, t43.t18.t19, t45.t18.t19, t46.t18.t19, t47.t18.t19, t48.t18.t19, t49.t18.t19, t67.t18.t19, t68.t18.t19, t70.t18.t19, t71.t18.t19, t72.t18.t19, t73.t18.t19, t74.t18.t19, t109.t18.t19, t110.t18.t19, t112.t18.t19, t113.t18.t19, t114.t18.t19, t115.t18.t19, t116.t18.t19, t135.t18.t19, t136.t18.t19, t138.t18.t19, t139.t18.t19, t140.t18.t19, t141.t18.t19, t142.t18.t19, t154.t18.t19, t155.t18.t19, t158.t18.t19, t159.t18.t19, t160.t18.t19, t161.t18.t19, t162.t18.t19, t183.t18.t19, t184.t18.t19, t186.t18.t19, t187.t18.t19, t188.t18.t19, t189.t18.t19, t190.t18.t19, t211.t18.t19, t213.t18.t19, t214.t18.t19, t215.t18.t19, t216.t18.t19, t217.t18.t19, t255.t18.t19, t257.t18.t19, t258.t18.t19, t259.t18.t19, t260.t18.t19, t261.t18.t19, t297.t18.t19, t298.t18.t19, t301.t18.t19, t302.t18.t19, t303.t18.t19, t304.t18.t19, t316.t18.t19, t317.t18.t19, t320.t18.t19, t321.t18.t19, t322.t18.t19, t323.t18.t19, t343.t18.t19, t344.t18.t19, t346.t18.t19, t347.t18.t19, t351.t18.t19, t55.t56.t53, t57.t56.t53, t64.t56.t53, t65.t56.t53, t122.t123.t120, t129.t123.t120, t132.t123.t120, t133.t123.t120, t124.t125.t126, t169.t170.t167, t171.t170.t167, t172.t170.t167, t182.t170.t167, t177.t178.t179, t196.t197.t198, t200.t197.t198, t201.t197.t198, t206.t197.t198, t207.t197.t198, t229.t230.t231, t233.t230.t231, t236.t230.t231, t242.t230.t231, t243.t230.t231, t244.t230.t231, t237.t238.t239, t357.t358.t355, t359.t358.t355, t360.t358.t355, t368.t358.t355, t369.t358.t355, t398.t395.t396, t399.t395.t396, t402.t395.t396, t403.t395.t396, t404.t395.t396, t405.t406.t407, t271.t164, t16.t2.t164, t41.t2.t164, t84.t2.t164, t108.t2.t164, t153.t2.t164, t370.t19.t164, t254.t18.t19.t164, t296.t18.t19.t164, t315.t18.t19.t164, t342.t18.t19.t164, t66.t56.t53.t164, t134.t123.t120.t164, t394.t395.t396.t164, t8.t9, t10.t9, t31.t9, t37.t9, t38.t9, t76.t9, t79.t9, t80.t9, t101.t9, t105.t9, t144.t9, t148.t9, t150.t9, t219.t9, t225.t9, t226.t9, t246.t9, t250.t9, t251.t9, t263.t9, t267.t9, t268.t9, t288.t9, t292.t9, t293.t9, t306.t9, t310.t9, t312.t9, t325.t9, t336.t9, t338.t9, t386.t9, t390.t9, t391.t9, t23.t24.t19, t44.t24.t19, t69.t24.t19, t90.t24.t19, t111.t24.t19, t137.t24.t19, t156.t24.t19, t185.t24.t19, t212.t24.t19, t256.t24.t19, t299.t24.t19, t318.t24.t19, t345.t24.t19, t376.t24.t19, t51.t52.t53, t58.t52.t53, t60.t52.t53, t118.t52.t53, t130.t52.t53, t165.t52.t53, t173.t52.t53, t175.t52.t53, t192.t52.t53, t202.t52.t53, t204.t52.t53, t353.t52.t53, t361.t52.t53, t366.t52.t53, t234.t235.t231, t400.t235.t231, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/23/272/295
Computing Next relation with stutter on 1768 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
280 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.83249,91608,1,0,951,446559,620,373,2911,386210,794
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S16C3-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property LeafsetExtension-PT-S16C3-07 finished in 4614 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 201/201 places, 438/438 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 201 transition count 414
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 177 transition count 414
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 48 place count 177 transition count 401
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 74 place count 164 transition count 401
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 89 place count 149 transition count 386
Iterating global reduction 2 with 15 rules applied. Total rules applied 104 place count 149 transition count 386
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 108 place count 145 transition count 382
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 145 transition count 382
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 115 place count 142 transition count 382
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 115 place count 142 transition count 379
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 139 transition count 379
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 124 place count 136 transition count 376
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 136 transition count 376
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 130 place count 133 transition count 373
Iterating global reduction 3 with 3 rules applied. Total rules applied 133 place count 133 transition count 373
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 141 place count 125 transition count 365
Iterating global reduction 3 with 8 rules applied. Total rules applied 149 place count 125 transition count 365
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 201 place count 99 transition count 339
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 206 place count 94 transition count 334
Iterating global reduction 3 with 5 rules applied. Total rules applied 211 place count 94 transition count 334
Applied a total of 211 rules in 38 ms. Remains 94 /201 variables (removed 107) and now considering 334/438 (removed 104) transitions.
[2021-05-18 02:08:12] [INFO ] Flow matrix only has 147 transitions (discarded 187 similar events)
// Phase 1: matrix 147 rows 94 cols
[2021-05-18 02:08:12] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-18 02:08:12] [INFO ] Implicit Places using invariants in 71 ms returned [8, 14, 23, 26, 30, 37, 44, 50, 57, 62, 72, 78]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 79 ms to find 12 implicit places.
[2021-05-18 02:08:12] [INFO ] Redundant transitions in 5 ms returned []
[2021-05-18 02:08:12] [INFO ] Flow matrix only has 147 transitions (discarded 187 similar events)
// Phase 1: matrix 147 rows 82 cols
[2021-05-18 02:08:12] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 02:08:13] [INFO ] Dead Transitions using invariants and state equation in 126 ms returned []
Starting structural reductions, iteration 1 : 82/201 places, 334/438 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 62 transition count 314
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 62 transition count 314
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 56 transition count 308
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 56 transition count 308
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 51 transition count 303
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 51 transition count 303
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 74 place count 45 transition count 297
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 43 transition count 295
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 43 transition count 295
Applied a total of 78 rules in 22 ms. Remains 43 /82 variables (removed 39) and now considering 295/334 (removed 39) transitions.
[2021-05-18 02:08:13] [INFO ] Flow matrix only has 42 transitions (discarded 253 similar events)
// Phase 1: matrix 42 rows 43 cols
[2021-05-18 02:08:13] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 02:08:13] [INFO ] Implicit Places using invariants in 40 ms returned []
[2021-05-18 02:08:13] [INFO ] Flow matrix only has 42 transitions (discarded 253 similar events)
// Phase 1: matrix 42 rows 43 cols
[2021-05-18 02:08:13] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 02:08:13] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 43/201 places, 295/438 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s27 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 0 ms.
FORMULA LeafsetExtension-PT-S16C3-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-10 finished in 409 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 201/201 places, 438/438 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 180 transition count 417
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 180 transition count 417
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 59 place count 163 transition count 400
Iterating global reduction 0 with 17 rules applied. Total rules applied 76 place count 163 transition count 400
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 82 place count 157 transition count 400
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 97 place count 142 transition count 385
Iterating global reduction 1 with 15 rules applied. Total rules applied 112 place count 142 transition count 385
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 117 place count 137 transition count 385
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 132 place count 122 transition count 370
Iterating global reduction 2 with 15 rules applied. Total rules applied 147 place count 122 transition count 370
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 158 place count 111 transition count 359
Iterating global reduction 2 with 11 rules applied. Total rules applied 169 place count 111 transition count 359
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 180 place count 100 transition count 348
Iterating global reduction 2 with 11 rules applied. Total rules applied 191 place count 100 transition count 348
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 213 place count 78 transition count 326
Iterating global reduction 2 with 22 rules applied. Total rules applied 235 place count 78 transition count 326
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 250 place count 63 transition count 311
Iterating global reduction 2 with 15 rules applied. Total rules applied 265 place count 63 transition count 311
Applied a total of 265 rules in 15 ms. Remains 63 /201 variables (removed 138) and now considering 311/438 (removed 127) transitions.
[2021-05-18 02:08:13] [INFO ] Flow matrix only has 62 transitions (discarded 249 similar events)
// Phase 1: matrix 62 rows 63 cols
[2021-05-18 02:08:13] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-18 02:08:13] [INFO ] Implicit Places using invariants in 43 ms returned [16, 26, 30, 44]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 44 ms to find 4 implicit places.
[2021-05-18 02:08:13] [INFO ] Flow matrix only has 62 transitions (discarded 249 similar events)
// Phase 1: matrix 62 rows 59 cols
[2021-05-18 02:08:13] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 02:08:13] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Starting structural reductions, iteration 1 : 59/201 places, 311/438 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 52 transition count 304
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 52 transition count 304
Applied a total of 14 rules in 10 ms. Remains 52 /59 variables (removed 7) and now considering 304/311 (removed 7) transitions.
[2021-05-18 02:08:13] [INFO ] Flow matrix only has 52 transitions (discarded 252 similar events)
// Phase 1: matrix 52 rows 52 cols
[2021-05-18 02:08:13] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 02:08:13] [INFO ] Implicit Places using invariants in 39 ms returned []
[2021-05-18 02:08:13] [INFO ] Flow matrix only has 52 transitions (discarded 252 similar events)
// Phase 1: matrix 52 rows 52 cols
[2021-05-18 02:08:13] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 02:08:13] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 52/201 places, 304/438 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s14 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C3-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-11 finished in 363 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 201 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 201/201 places, 438/438 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 180 transition count 417
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 180 transition count 417
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 59 place count 163 transition count 400
Iterating global reduction 0 with 17 rules applied. Total rules applied 76 place count 163 transition count 400
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 82 place count 157 transition count 400
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 97 place count 142 transition count 385
Iterating global reduction 1 with 15 rules applied. Total rules applied 112 place count 142 transition count 385
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 117 place count 137 transition count 385
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 132 place count 122 transition count 370
Iterating global reduction 2 with 15 rules applied. Total rules applied 147 place count 122 transition count 370
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 158 place count 111 transition count 359
Iterating global reduction 2 with 11 rules applied. Total rules applied 169 place count 111 transition count 359
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 180 place count 100 transition count 348
Iterating global reduction 2 with 11 rules applied. Total rules applied 191 place count 100 transition count 348
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 213 place count 78 transition count 326
Iterating global reduction 2 with 22 rules applied. Total rules applied 235 place count 78 transition count 326
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 250 place count 63 transition count 311
Iterating global reduction 2 with 15 rules applied. Total rules applied 265 place count 63 transition count 311
Applied a total of 265 rules in 17 ms. Remains 63 /201 variables (removed 138) and now considering 311/438 (removed 127) transitions.
[2021-05-18 02:08:13] [INFO ] Flow matrix only has 62 transitions (discarded 249 similar events)
// Phase 1: matrix 62 rows 63 cols
[2021-05-18 02:08:13] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-18 02:08:13] [INFO ] Implicit Places using invariants in 43 ms returned [16, 26, 30, 44]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
[2021-05-18 02:08:13] [INFO ] Flow matrix only has 62 transitions (discarded 249 similar events)
// Phase 1: matrix 62 rows 59 cols
[2021-05-18 02:08:13] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-18 02:08:13] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Starting structural reductions, iteration 1 : 59/201 places, 311/438 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 52 transition count 304
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 52 transition count 304
Applied a total of 14 rules in 2 ms. Remains 52 /59 variables (removed 7) and now considering 304/311 (removed 7) transitions.
[2021-05-18 02:08:13] [INFO ] Flow matrix only has 52 transitions (discarded 252 similar events)
// Phase 1: matrix 52 rows 52 cols
[2021-05-18 02:08:13] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 02:08:13] [INFO ] Implicit Places using invariants in 37 ms returned []
[2021-05-18 02:08:13] [INFO ] Flow matrix only has 52 transitions (discarded 252 similar events)
// Phase 1: matrix 52 rows 52 cols
[2021-05-18 02:08:13] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 02:08:13] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 52/201 places, 304/438 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-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:(OR (LT s19 1) (LT s30 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 356 steps with 14 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C3-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-13 finished in 341 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(X((p1&&F(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 201/201 places, 438/438 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 182 transition count 419
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 182 transition count 419
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 54 place count 166 transition count 403
Iterating global reduction 0 with 16 rules applied. Total rules applied 70 place count 166 transition count 403
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 75 place count 161 transition count 403
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 88 place count 148 transition count 390
Iterating global reduction 1 with 13 rules applied. Total rules applied 101 place count 148 transition count 390
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 106 place count 143 transition count 390
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 120 place count 129 transition count 376
Iterating global reduction 2 with 14 rules applied. Total rules applied 134 place count 129 transition count 376
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 144 place count 119 transition count 366
Iterating global reduction 2 with 10 rules applied. Total rules applied 154 place count 119 transition count 366
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 164 place count 109 transition count 356
Iterating global reduction 2 with 10 rules applied. Total rules applied 174 place count 109 transition count 356
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 194 place count 89 transition count 336
Iterating global reduction 2 with 20 rules applied. Total rules applied 214 place count 89 transition count 336
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 229 place count 74 transition count 321
Iterating global reduction 2 with 15 rules applied. Total rules applied 244 place count 74 transition count 321
Applied a total of 244 rules in 12 ms. Remains 74 /201 variables (removed 127) and now considering 321/438 (removed 117) transitions.
[2021-05-18 02:08:13] [INFO ] Flow matrix only has 81 transitions (discarded 240 similar events)
// Phase 1: matrix 81 rows 74 cols
[2021-05-18 02:08:13] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-18 02:08:14] [INFO ] Implicit Places using invariants in 40 ms returned [16, 35, 39]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 41 ms to find 3 implicit places.
[2021-05-18 02:08:14] [INFO ] Flow matrix only has 81 transitions (discarded 240 similar events)
// Phase 1: matrix 81 rows 71 cols
[2021-05-18 02:08:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-18 02:08:14] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Starting structural reductions, iteration 1 : 71/201 places, 321/438 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 316
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 316
Applied a total of 10 rules in 1 ms. Remains 66 /71 variables (removed 5) and now considering 316/321 (removed 5) transitions.
[2021-05-18 02:08:14] [INFO ] Flow matrix only has 74 transitions (discarded 242 similar events)
// Phase 1: matrix 74 rows 66 cols
[2021-05-18 02:08:14] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 02:08:14] [INFO ] Implicit Places using invariants in 40 ms returned []
[2021-05-18 02:08:14] [INFO ] Flow matrix only has 74 transitions (discarded 242 similar events)
// Phase 1: matrix 74 rows 66 cols
[2021-05-18 02:08:14] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 02:08:14] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 66/201 places, 316/438 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s40 1) (GEQ s56 1)), p1:(OR (LT s45 1) (LT s50 1)), p2:(AND (GEQ s25 1) (GEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C3-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-14 finished in 397 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 201/201 places, 438/438 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 201 transition count 414
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 177 transition count 414
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 177 transition count 402
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 165 transition count 402
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 87 place count 150 transition count 387
Iterating global reduction 2 with 15 rules applied. Total rules applied 102 place count 150 transition count 387
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 146 transition count 383
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 146 transition count 383
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 114 place count 142 transition count 383
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 114 place count 142 transition count 379
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 122 place count 138 transition count 379
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 126 place count 134 transition count 375
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 134 transition count 375
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 134 place count 130 transition count 371
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 130 transition count 371
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 144 place count 124 transition count 365
Iterating global reduction 3 with 6 rules applied. Total rules applied 150 place count 124 transition count 365
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 202 place count 98 transition count 339
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 209 place count 91 transition count 332
Iterating global reduction 3 with 7 rules applied. Total rules applied 216 place count 91 transition count 332
Applied a total of 216 rules in 27 ms. Remains 91 /201 variables (removed 110) and now considering 332/438 (removed 106) transitions.
[2021-05-18 02:08:14] [INFO ] Flow matrix only has 138 transitions (discarded 194 similar events)
// Phase 1: matrix 138 rows 91 cols
[2021-05-18 02:08:14] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-18 02:08:14] [INFO ] Implicit Places using invariants in 91 ms returned [8, 14, 23, 26, 30, 37, 44, 50, 58, 70, 76]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 99 ms to find 11 implicit places.
[2021-05-18 02:08:14] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-18 02:08:14] [INFO ] Flow matrix only has 138 transitions (discarded 194 similar events)
// Phase 1: matrix 138 rows 80 cols
[2021-05-18 02:08:14] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-18 02:08:14] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Starting structural reductions, iteration 1 : 80/201 places, 332/438 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 61 transition count 313
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 61 transition count 313
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 56 transition count 308
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 56 transition count 308
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 51 transition count 303
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 51 transition count 303
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 45 transition count 297
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 43 transition count 295
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 43 transition count 295
Applied a total of 74 rules in 17 ms. Remains 43 /80 variables (removed 37) and now considering 295/332 (removed 37) transitions.
[2021-05-18 02:08:14] [INFO ] Flow matrix only has 42 transitions (discarded 253 similar events)
// Phase 1: matrix 42 rows 43 cols
[2021-05-18 02:08:14] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 02:08:14] [INFO ] Implicit Places using invariants in 38 ms returned []
[2021-05-18 02:08:14] [INFO ] Flow matrix only has 42 transitions (discarded 253 similar events)
// Phase 1: matrix 42 rows 43 cols
[2021-05-18 02:08:14] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 02:08:14] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 43/201 places, 295/438 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-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:(LT s33 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 9067 reset in 169 ms.
Product exploration explored 100000 steps with 9042 reset in 204 ms.
Graph (complete) has 387 edges and 43 vertex of which 41 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9067 reset in 171 ms.
Product exploration explored 100000 steps with 9052 reset in 186 ms.
[2021-05-18 02:08:15] [INFO ] Flatten gal took : 11 ms
[2021-05-18 02:08:15] [INFO ] Flatten gal took : 11 ms
[2021-05-18 02:08:15] [INFO ] Time to serialize gal into /tmp/LTL18305511554747390154.gal : 2 ms
[2021-05-18 02:08:15] [INFO ] Time to serialize properties into /tmp/LTL7138532197614657505.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/LTL18305511554747390154.gal, -t, CGAL, -LTL, /tmp/LTL7138532197614657505.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/LTL18305511554747390154.gal -t CGAL -LTL /tmp/LTL7138532197614657505.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node14ManageTheBreakDownOfNode15<1)"))))
Formula 0 simplified : !GF"(Node14ManageTheBreakDownOfNode15<1)"
Reverse transition relation is NOT exact ! Due to transitions t12, t33, t94, t222, t275, t276, t277, t278, t279, t282, t286, t331, t350, t381, t1.t2, t6.t2, t7.t2, t15.t2, t36.t2, t39.t2, t40.t2, t77.t2, t78.t2, t82.t2, t83.t2, t102.t2, t103.t2, t104.t2, t106.t2, t107.t2, t145.t2, t146.t2, t147.t2, t152.t2, t220.t2, t221.t2, t227.t2, t228.t2, t247.t2, t248.t2, t249.t2, t252.t2, t253.t2, t264.t2, t265.t2, t266.t2, t269.t2, t270.t2, t289.t2, t290.t2, t291.t2, t294.t2, t295.t2, t307.t2, t308.t2, t309.t2, t313.t2, t314.t2, t329.t2, t335.t2, t340.t2, t341.t2, t387.t2, t388.t2, t389.t2, t392.t2, t393.t2, t85.t19, t89.t19, t92.t19, t93.t19, t98.t19, t99.t19, t208.t19, t374.t19, t375.t19, t378.t19, t379.t19, t380.t19, t17.t18.t19, t22.t18.t19, t25.t18.t19, t26.t18.t19, t27.t18.t19, t28.t18.t19, t29.t18.t19, t42.t18.t19, t43.t18.t19, t45.t18.t19, t46.t18.t19, t47.t18.t19, t48.t18.t19, t49.t18.t19, t67.t18.t19, t68.t18.t19, t70.t18.t19, t71.t18.t19, t72.t18.t19, t73.t18.t19, t74.t18.t19, t109.t18.t19, t110.t18.t19, t112.t18.t19, t113.t18.t19, t114.t18.t19, t115.t18.t19, t116.t18.t19, t135.t18.t19, t136.t18.t19, t138.t18.t19, t139.t18.t19, t140.t18.t19, t141.t18.t19, t142.t18.t19, t154.t18.t19, t155.t18.t19, t158.t18.t19, t159.t18.t19, t160.t18.t19, t161.t18.t19, t162.t18.t19, t183.t18.t19, t184.t18.t19, t186.t18.t19, t187.t18.t19, t188.t18.t19, t189.t18.t19, t190.t18.t19, t211.t18.t19, t213.t18.t19, t214.t18.t19, t215.t18.t19, t216.t18.t19, t217.t18.t19, t255.t18.t19, t257.t18.t19, t258.t18.t19, t259.t18.t19, t260.t18.t19, t261.t18.t19, t297.t18.t19, t298.t18.t19, t301.t18.t19, t302.t18.t19, t303.t18.t19, t304.t18.t19, t316.t18.t19, t317.t18.t19, t320.t18.t19, t321.t18.t19, t322.t18.t19, t323.t18.t19, t343.t18.t19, t344.t18.t19, t346.t18.t19, t347.t18.t19, t351.t18.t19, t55.t56.t53, t57.t56.t53, t64.t56.t53, t65.t56.t53, t122.t123.t120, t129.t123.t120, t132.t123.t120, t133.t123.t120, t124.t125.t126, t169.t170.t167, t171.t170.t167, t172.t170.t167, t182.t170.t167, t177.t178.t179, t196.t197.t198, t200.t197.t198, t201.t197.t198, t206.t197.t198, t207.t197.t198, t229.t230.t231, t233.t230.t231, t236.t230.t231, t242.t230.t231, t243.t230.t231, t244.t230.t231, t237.t238.t239, t357.t358.t355, t359.t358.t355, t360.t358.t355, t368.t358.t355, t369.t358.t355, t398.t395.t396, t399.t395.t396, t402.t395.t396, t403.t395.t396, t404.t395.t396, t405.t406.t407, t271.t164, t16.t2.t164, t41.t2.t164, t84.t2.t164, t108.t2.t164, t153.t2.t164, t370.t19.t164, t254.t18.t19.t164, t296.t18.t19.t164, t315.t18.t19.t164, t342.t18.t19.t164, t66.t56.t53.t164, t134.t123.t120.t164, t394.t395.t396.t164, t8.t9, t10.t9, t31.t9, t37.t9, t38.t9, t76.t9, t79.t9, t80.t9, t101.t9, t105.t9, t144.t9, t148.t9, t150.t9, t219.t9, t225.t9, t226.t9, t246.t9, t250.t9, t251.t9, t263.t9, t267.t9, t268.t9, t288.t9, t292.t9, t293.t9, t306.t9, t310.t9, t312.t9, t325.t9, t336.t9, t338.t9, t386.t9, t390.t9, t391.t9, t23.t24.t19, t44.t24.t19, t69.t24.t19, t90.t24.t19, t111.t24.t19, t137.t24.t19, t156.t24.t19, t185.t24.t19, t212.t24.t19, t256.t24.t19, t299.t24.t19, t318.t24.t19, t345.t24.t19, t376.t24.t19, t51.t52.t53, t58.t52.t53, t60.t52.t53, t118.t52.t53, t130.t52.t53, t165.t52.t53, t173.t52.t53, t175.t52.t53, t192.t52.t53, t202.t52.t53, t204.t52.t53, t353.t52.t53, t361.t52.t53, t366.t52.t53, t234.t235.t231, t400.t235.t231, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/23/272/295
Computing Next relation with stutter on 1768 deadlock states
23 unique states visited
0 strongly connected components in search stack
26 transitions explored
14 items max in DFS search stack
83 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,0.897409,46276,1,0,906,232161,620,347,2930,156181,772
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S16C3-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property LeafsetExtension-PT-S16C3-15 finished in 2238 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621303697641

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

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