Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 7.0K Jun 7 17:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 7 17:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 7 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 7 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 7.3K Jun 7 17:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 7 17:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 7 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 6 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 5.8M Jun 6 12:11 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 RingSingleMessageInMbox-PT-d1m080-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654933983504

Running Version 202205111006
[2022-06-11 07:53:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 07:53:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 07:53:05] [INFO ] Load time of PNML (sax parser for PT used): 468 ms
[2022-06-11 07:53:05] [INFO ] Transformed 6690 places.
[2022-06-11 07:53:05] [INFO ] Transformed 11934 transitions.
[2022-06-11 07:53:05] [INFO ] Parsed PT model containing 6690 places and 11934 transitions in 637 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4305 places in 39 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1087 places :
Symmetric choice reduction at 1 with 1087 rule applications. Total rules 1206 place count 1281 transition count 6530
Iterating global reduction 1 with 1087 rules applied. Total rules applied 2293 place count 1281 transition count 6530
Ensure Unique test removed 261 transitions
Reduce isomorphic transitions removed 261 transitions.
Iterating post reduction 1 with 261 rules applied. Total rules applied 2554 place count 1281 transition count 6269
Discarding 922 places :
Symmetric choice reduction at 2 with 922 rule applications. Total rules 3476 place count 359 transition count 5347
Iterating global reduction 2 with 922 rules applied. Total rules applied 4398 place count 359 transition count 5347
Ensure Unique test removed 4239 transitions
Reduce isomorphic transitions removed 4239 transitions.
Iterating post reduction 2 with 4239 rules applied. Total rules applied 8637 place count 359 transition count 1108
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 8704 place count 292 transition count 1041
Iterating global reduction 3 with 67 rules applied. Total rules applied 8771 place count 292 transition count 1041
Ensure Unique test removed 158 transitions
Reduce isomorphic transitions removed 158 transitions.
Iterating post reduction 3 with 158 rules applied. Total rules applied 8929 place count 292 transition count 883
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 8934 place count 287 transition count 878
Iterating global reduction 4 with 5 rules applied. Total rules applied 8939 place count 287 transition count 878
Applied a total of 8939 rules in 465 ms. Remains 287 /2385 variables (removed 2098) and now considering 878/11934 (removed 11056) transitions.
// Phase 1: matrix 878 rows 287 cols
[2022-06-11 07:53:06] [INFO ] Computed 3 place invariants in 49 ms
[2022-06-11 07:53:06] [INFO ] Implicit Places using invariants in 343 ms returned []
// Phase 1: matrix 878 rows 287 cols
[2022-06-11 07:53:06] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 07:53:07] [INFO ] State equation strengthened by 623 read => feed constraints.
[2022-06-11 07:53:08] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 2363 ms to find 0 implicit places.
// Phase 1: matrix 878 rows 287 cols
[2022-06-11 07:53:08] [INFO ] Computed 3 place invariants in 15 ms
[2022-06-11 07:53:08] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 287/2385 places, 878/11934 transitions.
Finished structural reductions, in 1 iterations. Remains : 287/2385 places, 878/11934 transitions.
Support contains 25 out of 287 places after structural reductions.
[2022-06-11 07:53:08] [INFO ] Flatten gal took : 86 ms
[2022-06-11 07:53:08] [INFO ] Flatten gal took : 51 ms
[2022-06-11 07:53:08] [INFO ] Input system was already deterministic with 878 transitions.
Incomplete random walk after 10000 steps, including 1790 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 27) seen :23
Incomplete Best-First random walk after 10001 steps, including 205 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 233 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 226 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 216 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 878 rows 287 cols
[2022-06-11 07:53:09] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 07:53:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 07:53:09] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 07:53:10] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-06-11 07:53:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 07:53:10] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 07:53:10] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-06-11 07:53:10] [INFO ] State equation strengthened by 623 read => feed constraints.
[2022-06-11 07:53:11] [INFO ] After 534ms SMT Verify possible using 623 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2022-06-11 07:53:11] [INFO ] After 913ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 416 ms.
[2022-06-11 07:53:12] [INFO ] After 1948ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 287 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 287/287 places, 878/878 transitions.
Graph (complete) has 1389 edges and 287 vertex of which 286 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 286 transition count 869
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 28 place count 268 transition count 417
Iterating global reduction 1 with 18 rules applied. Total rules applied 46 place count 268 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 268 transition count 416
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 64 place count 251 transition count 399
Iterating global reduction 2 with 17 rules applied. Total rules applied 81 place count 251 transition count 399
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 251 transition count 397
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 143 place count 191 transition count 337
Iterating global reduction 3 with 60 rules applied. Total rules applied 203 place count 191 transition count 337
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 263 place count 191 transition count 277
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 266 place count 188 transition count 238
Iterating global reduction 4 with 3 rules applied. Total rules applied 269 place count 188 transition count 238
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 271 place count 186 transition count 236
Iterating global reduction 4 with 2 rules applied. Total rules applied 273 place count 186 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 274 place count 186 transition count 235
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 278 place count 182 transition count 231
Iterating global reduction 5 with 4 rules applied. Total rules applied 282 place count 182 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 286 place count 182 transition count 227
Applied a total of 286 rules in 86 ms. Remains 182 /287 variables (removed 105) and now considering 227/878 (removed 651) transitions.
Finished structural reductions, in 1 iterations. Remains : 182/287 places, 227/878 transitions.
Incomplete random walk after 10000 steps, including 2083 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 383 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 358 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 357 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 635704 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{2=1}
Probabilistic random walk after 635704 steps, saw 279261 distinct states, run finished after 3002 ms. (steps per millisecond=211 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 227 rows 182 cols
[2022-06-11 07:53:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 07:53:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-11 07:53:16] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 07:53:16] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-11 07:53:16] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 07:53:16] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-11 07:53:16] [INFO ] After 96ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 07:53:16] [INFO ] Deduced a trap composed of 97 places in 55 ms of which 1 ms to minimize.
[2022-06-11 07:53:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2022-06-11 07:53:16] [INFO ] After 262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-06-11 07:53:16] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 182/182 places, 227/227 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 181 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 181 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 180 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 180 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 179 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 179 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 178 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 178 transition count 223
Applied a total of 8 rules in 34 ms. Remains 178 /182 variables (removed 4) and now considering 223/227 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 178/182 places, 223/227 transitions.
Incomplete random walk after 10000 steps, including 2121 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 370 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 380 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 702126 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :{}
Probabilistic random walk after 702126 steps, saw 313280 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 223 rows 178 cols
[2022-06-11 07:53:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 07:53:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-11 07:53:19] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 07:53:19] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 07:53:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-11 07:53:19] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 07:53:20] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 07:53:20] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-06-11 07:53:20] [INFO ] After 106ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 07:53:20] [INFO ] Deduced a trap composed of 91 places in 58 ms of which 1 ms to minimize.
[2022-06-11 07:53:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-06-11 07:53:20] [INFO ] After 310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-06-11 07:53:20] [INFO ] After 552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 178/178 places, 223/223 transitions.
Applied a total of 0 rules in 8 ms. Remains 178 /178 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 178/178 places, 223/223 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 178/178 places, 223/223 transitions.
Applied a total of 0 rules in 8 ms. Remains 178 /178 variables (removed 0) and now considering 223/223 (removed 0) transitions.
// Phase 1: matrix 223 rows 178 cols
[2022-06-11 07:53:20] [INFO ] Computed 4 place invariants in 10 ms
[2022-06-11 07:53:20] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 223 rows 178 cols
[2022-06-11 07:53:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 07:53:20] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-06-11 07:53:20] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2022-06-11 07:53:20] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 223 rows 178 cols
[2022-06-11 07:53:20] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-11 07:53:21] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 178/178 places, 223/223 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 178 transition count 219
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 175 transition count 219
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 7 place count 175 transition count 182
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 81 place count 138 transition count 182
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 91 place count 133 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 132 transition count 183
Applied a total of 93 rules in 20 ms. Remains 132 /178 variables (removed 46) and now considering 183/223 (removed 40) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 183 rows 132 cols
[2022-06-11 07:53:21] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 07:53:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 07:53:21] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 07:53:21] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 07:53:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 07:53:21] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 07:53:21] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 07:53:21] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2022-06-11 07:53:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2022-06-11 07:53:21] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 1 ms to minimize.
[2022-06-11 07:53:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-06-11 07:53:21] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-11 07:53:21] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
[2022-06-11 07:53:21] [INFO ] Flatten gal took : 12 ms
[2022-06-11 07:53:21] [INFO ] Flatten gal took : 11 ms
[2022-06-11 07:53:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15661286965124451754.gal : 3 ms
[2022-06-11 07:53:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8728028539859526939.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms7754026949600151527;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15661286965124451754.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8728028539859526939.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8728028539859526939.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 35
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :35 after 99
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :99 after 177
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :177 after 209
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :209 after 415
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :415 after 997
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :997 after 1851
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1851 after 3719
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3719 after 7597
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7597 after 15047
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :15047 after 186216
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :186216 after 1.09159e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.09159e+09 after 1.39425e+09
Reachability property AtomicPropp20 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.71417e+09,5.27515,111128,2,63237,19,462188,6,0,712,469292,0
Total reachable state count : 2714174574

Verifying 1 reachability properties.
Reachability property AtomicPropp20 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp20,6,5.27922,111128,2,160,19,462188,7,0,716,469292,0
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 50 stabilizing places and 308 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(p0))&&X(X(p1))))||G(F(p2))))'
Support contains 4 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 878/878 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 269 transition count 512
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 269 transition count 512
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 269 transition count 511
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 54 place count 252 transition count 494
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 252 transition count 494
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 75 place count 252 transition count 490
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 126 place count 201 transition count 439
Iterating global reduction 2 with 51 rules applied. Total rules applied 177 place count 201 transition count 439
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 253 place count 201 transition count 363
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 257 place count 197 transition count 347
Iterating global reduction 3 with 4 rules applied. Total rules applied 261 place count 197 transition count 347
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 262 place count 196 transition count 346
Iterating global reduction 3 with 1 rules applied. Total rules applied 263 place count 196 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 264 place count 196 transition count 345
Applied a total of 264 rules in 23 ms. Remains 196 /287 variables (removed 91) and now considering 345/878 (removed 533) transitions.
// Phase 1: matrix 345 rows 196 cols
[2022-06-11 07:53:27] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:53:27] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 345 rows 196 cols
[2022-06-11 07:53:27] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 07:53:27] [INFO ] State equation strengthened by 162 read => feed constraints.
[2022-06-11 07:53:28] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
// Phase 1: matrix 345 rows 196 cols
[2022-06-11 07:53:28] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 07:53:28] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/287 places, 345/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 196/287 places, 345/878 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s164 1)), p1:(OR (LT s1 1) (LT s162 1)), p2:(AND (GEQ s1 1) (GEQ s163 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 625 steps with 117 reset in 15 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-00 finished in 1425 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&X((F((p0 U p1))||G(p2)))))'
Support contains 4 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 878/878 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 269 transition count 512
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 269 transition count 512
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 269 transition count 511
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 54 place count 252 transition count 494
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 252 transition count 494
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 75 place count 252 transition count 490
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 126 place count 201 transition count 439
Iterating global reduction 2 with 51 rules applied. Total rules applied 177 place count 201 transition count 439
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 257 place count 201 transition count 359
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 261 place count 197 transition count 343
Iterating global reduction 3 with 4 rules applied. Total rules applied 265 place count 197 transition count 343
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 196 transition count 342
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 196 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 268 place count 196 transition count 341
Applied a total of 268 rules in 25 ms. Remains 196 /287 variables (removed 91) and now considering 341/878 (removed 537) transitions.
// Phase 1: matrix 341 rows 196 cols
[2022-06-11 07:53:28] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:53:28] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 341 rows 196 cols
[2022-06-11 07:53:28] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:53:29] [INFO ] State equation strengthened by 158 read => feed constraints.
[2022-06-11 07:53:29] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
// Phase 1: matrix 341 rows 196 cols
[2022-06-11 07:53:29] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-11 07:53:29] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/287 places, 341/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 196/287 places, 341/878 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s164 1)), p1:(AND (GEQ s1 1) (GEQ s162 1)), p2:(OR (LT s1 1) (LT s163 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-01 finished in 1188 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((X(!(p1 U p1))&&X(!p1)&&!p1))||p0))))'
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 878/878 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 266 transition count 423
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 266 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 266 transition count 422
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 63 place count 246 transition count 402
Iterating global reduction 1 with 20 rules applied. Total rules applied 83 place count 246 transition count 402
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 246 transition count 400
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 148 place count 183 transition count 337
Iterating global reduction 2 with 63 rules applied. Total rules applied 211 place count 183 transition count 337
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 271 place count 183 transition count 277
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 276 place count 178 transition count 248
Iterating global reduction 3 with 5 rules applied. Total rules applied 281 place count 178 transition count 248
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 282 place count 177 transition count 247
Iterating global reduction 3 with 1 rules applied. Total rules applied 283 place count 177 transition count 247
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 287 place count 173 transition count 243
Iterating global reduction 3 with 4 rules applied. Total rules applied 291 place count 173 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 299 place count 173 transition count 235
Applied a total of 299 rules in 24 ms. Remains 173 /287 variables (removed 114) and now considering 235/878 (removed 643) transitions.
// Phase 1: matrix 235 rows 173 cols
[2022-06-11 07:53:30] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 07:53:30] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 235 rows 173 cols
[2022-06-11 07:53:30] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-11 07:53:30] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-11 07:53:30] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
// Phase 1: matrix 235 rows 173 cols
[2022-06-11 07:53:30] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 07:53:30] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 173/287 places, 235/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 173/287 places, 235/878 transitions.
Stuttering acceptance computed with spot in 174 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 0}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (GEQ s1 1) (GEQ s83 1)), p0:(OR (LT s1 1) (LT s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 355 ms.
Product exploration explored 100000 steps with 33333 reset in 282 ms.
Computed a total of 6 stabilizing places and 15 stable transitions
Computed a total of 6 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) p1))))
Knowledge based reduction with 3 factoid took 337 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-02 finished in 1787 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(F(p0)) U X(p0))||X(X(X(X(X(X(p1)))))))))'
Support contains 4 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 878/878 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 267 transition count 424
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 267 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 267 transition count 423
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 248 transition count 404
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 248 transition count 404
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 248 transition count 403
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 143 place count 185 transition count 340
Iterating global reduction 2 with 63 rules applied. Total rules applied 206 place count 185 transition count 340
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 266 place count 185 transition count 280
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 270 place count 181 transition count 264
Iterating global reduction 3 with 4 rules applied. Total rules applied 274 place count 181 transition count 264
Applied a total of 274 rules in 20 ms. Remains 181 /287 variables (removed 106) and now considering 264/878 (removed 614) transitions.
// Phase 1: matrix 264 rows 181 cols
[2022-06-11 07:53:31] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:53:31] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 264 rows 181 cols
[2022-06-11 07:53:31] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-11 07:53:31] [INFO ] State equation strengthened by 93 read => feed constraints.
[2022-06-11 07:53:32] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
// Phase 1: matrix 264 rows 181 cols
[2022-06-11 07:53:32] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 07:53:32] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/287 places, 264/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 181/287 places, 264/878 transitions.
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s85 1)), p1:(AND (GEQ s11 1) (GEQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-04 finished in 969 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 878/878 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 267 transition count 454
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 267 transition count 454
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 267 transition count 453
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 248 transition count 434
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 248 transition count 434
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 83 place count 248 transition count 430
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 142 place count 189 transition count 371
Iterating global reduction 2 with 59 rules applied. Total rules applied 201 place count 189 transition count 371
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 273 place count 189 transition count 299
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 278 place count 184 transition count 270
Iterating global reduction 3 with 5 rules applied. Total rules applied 283 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 284 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 285 place count 183 transition count 269
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 289 place count 179 transition count 265
Iterating global reduction 3 with 4 rules applied. Total rules applied 293 place count 179 transition count 265
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 305 place count 179 transition count 253
Applied a total of 305 rules in 25 ms. Remains 179 /287 variables (removed 108) and now considering 253/878 (removed 625) transitions.
// Phase 1: matrix 253 rows 179 cols
[2022-06-11 07:53:32] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 07:53:32] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 253 rows 179 cols
[2022-06-11 07:53:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 07:53:32] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-06-11 07:53:33] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
// Phase 1: matrix 253 rows 179 cols
[2022-06-11 07:53:33] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 07:53:33] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/287 places, 253/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 179/287 places, 253/878 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 350 ms.
Product exploration explored 100000 steps with 50000 reset in 353 ms.
Computed a total of 12 stabilizing places and 33 stable transitions
Computed a total of 12 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-05 finished in 1500 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0) U (false U p0))) U G(X(p0))))'
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 878/878 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 267 transition count 452
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 267 transition count 452
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 267 transition count 451
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 248 transition count 432
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 248 transition count 432
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 248 transition count 430
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 140 place count 189 transition count 371
Iterating global reduction 2 with 59 rules applied. Total rules applied 199 place count 189 transition count 371
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 267 place count 189 transition count 303
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 272 place count 184 transition count 274
Iterating global reduction 3 with 5 rules applied. Total rules applied 277 place count 184 transition count 274
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 278 place count 183 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 183 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 280 place count 183 transition count 272
Applied a total of 280 rules in 21 ms. Remains 183 /287 variables (removed 104) and now considering 272/878 (removed 606) transitions.
// Phase 1: matrix 272 rows 183 cols
[2022-06-11 07:53:34] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:53:34] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 272 rows 183 cols
[2022-06-11 07:53:34] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 07:53:34] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-06-11 07:53:34] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
// Phase 1: matrix 272 rows 183 cols
[2022-06-11 07:53:34] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 07:53:34] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 183/287 places, 272/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/287 places, 272/878 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s151 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-06 finished in 794 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(X(F((F(G(p1))||p0))))))))'
Support contains 4 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 878/878 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 268 transition count 455
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 268 transition count 455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 268 transition count 454
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 250 transition count 436
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 250 transition count 436
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 77 place count 250 transition count 434
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 136 place count 191 transition count 375
Iterating global reduction 2 with 59 rules applied. Total rules applied 195 place count 191 transition count 375
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 267 place count 191 transition count 303
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 271 place count 187 transition count 287
Iterating global reduction 3 with 4 rules applied. Total rules applied 275 place count 187 transition count 287
Applied a total of 275 rules in 20 ms. Remains 187 /287 variables (removed 100) and now considering 287/878 (removed 591) transitions.
// Phase 1: matrix 287 rows 187 cols
[2022-06-11 07:53:35] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:53:35] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 287 rows 187 cols
[2022-06-11 07:53:35] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 07:53:35] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-06-11 07:53:35] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
// Phase 1: matrix 287 rows 187 cols
[2022-06-11 07:53:35] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 07:53:35] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/287 places, 287/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 187/287 places, 287/878 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s1 1) (GEQ s155 1)), p0:(OR (LT s11 1) (LT s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 27279 reset in 284 ms.
Product exploration explored 100000 steps with 27235 reset in 284 ms.
Computed a total of 12 stabilizing places and 42 stable transitions
Computed a total of 12 stabilizing places and 42 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 2609 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1833 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 272 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 287 rows 187 cols
[2022-06-11 07:53:39] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 07:53:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 07:53:39] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 07:53:39] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), true, (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 187 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 287/287 transitions.
Applied a total of 0 rules in 4 ms. Remains 187 /187 variables (removed 0) and now considering 287/287 (removed 0) transitions.
// Phase 1: matrix 287 rows 187 cols
[2022-06-11 07:53:39] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 07:53:39] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 287 rows 187 cols
[2022-06-11 07:53:39] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 07:53:40] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-06-11 07:53:40] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
// Phase 1: matrix 287 rows 187 cols
[2022-06-11 07:53:40] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 07:53:40] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 187/187 places, 287/287 transitions.
Computed a total of 12 stabilizing places and 42 stable transitions
Computed a total of 12 stabilizing places and 42 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 7612 steps, including 1382 resets, run visited all 1 properties in 31 ms. (steps per millisecond=245 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 27283 reset in 299 ms.
Product exploration explored 100000 steps with 27275 reset in 238 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 287/287 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 186 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 186 transition count 273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 185 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 185 transition count 272
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 8 place count 181 transition count 268
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 181 transition count 268
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 180 transition count 251
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 180 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 179 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 179 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 179 transition count 249
Applied a total of 21 rules in 52 ms. Remains 179 /187 variables (removed 8) and now considering 249/287 (removed 38) transitions.
[2022-06-11 07:53:42] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 249 rows 179 cols
[2022-06-11 07:53:42] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 07:53:42] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/187 places, 249/287 transitions.
Finished structural reductions, in 1 iterations. Remains : 179/187 places, 249/287 transitions.
Product exploration explored 100000 steps with 27262 reset in 478 ms.
Product exploration explored 100000 steps with 27266 reset in 440 ms.
Built C files in :
/tmp/ltsmin10508004443130264165
[2022-06-11 07:53:43] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10508004443130264165
Running compilation step : cd /tmp/ltsmin10508004443130264165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 500 ms.
Running link step : cd /tmp/ltsmin10508004443130264165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10508004443130264165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7261481341816572498.hoa' '--buchi-type=spotba'
LTSmin run took 186 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-07 finished in 9142 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 3 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 878/878 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 268 transition count 483
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 268 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 268 transition count 482
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 250 transition count 464
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 250 transition count 464
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 250 transition count 460
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 134 place count 195 transition count 405
Iterating global reduction 2 with 55 rules applied. Total rules applied 189 place count 195 transition count 405
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 273 place count 195 transition count 321
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 278 place count 190 transition count 292
Iterating global reduction 3 with 5 rules applied. Total rules applied 283 place count 190 transition count 292
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 284 place count 189 transition count 291
Iterating global reduction 3 with 1 rules applied. Total rules applied 285 place count 189 transition count 291
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 289 place count 185 transition count 287
Iterating global reduction 3 with 4 rules applied. Total rules applied 293 place count 185 transition count 287
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 309 place count 185 transition count 271
Applied a total of 309 rules in 30 ms. Remains 185 /287 variables (removed 102) and now considering 271/878 (removed 607) transitions.
// Phase 1: matrix 271 rows 185 cols
[2022-06-11 07:53:44] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:53:44] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 271 rows 185 cols
[2022-06-11 07:53:44] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 07:53:44] [INFO ] State equation strengthened by 97 read => feed constraints.
[2022-06-11 07:53:44] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
// Phase 1: matrix 271 rows 185 cols
[2022-06-11 07:53:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 07:53:44] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/287 places, 271/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/287 places, 271/878 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s153 1)), p0:(AND (GEQ s1 1) (GEQ s152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-08 finished in 882 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(((F(p0) U !p1) U G(X(p2)))))&&X(p3)))'
Support contains 5 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 878/878 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 269 transition count 484
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 269 transition count 484
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 251 transition count 466
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 251 transition count 466
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 76 place count 251 transition count 462
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 131 place count 196 transition count 407
Iterating global reduction 1 with 55 rules applied. Total rules applied 186 place count 196 transition count 407
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 266 place count 196 transition count 327
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 269 place count 193 transition count 324
Iterating global reduction 2 with 3 rules applied. Total rules applied 272 place count 193 transition count 324
Applied a total of 272 rules in 34 ms. Remains 193 /287 variables (removed 94) and now considering 324/878 (removed 554) transitions.
// Phase 1: matrix 324 rows 193 cols
[2022-06-11 07:53:45] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 07:53:45] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 324 rows 193 cols
[2022-06-11 07:53:45] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 07:53:45] [INFO ] State equation strengthened by 144 read => feed constraints.
[2022-06-11 07:53:45] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
// Phase 1: matrix 324 rows 193 cols
[2022-06-11 07:53:45] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 07:53:45] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 193/287 places, 324/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/287 places, 324/878 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2)), (NOT p0), p1]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=p3, acceptance={} source=1 dest: 3}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p3 p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s161 1)), p1:(OR (LT s1 1) (LT s160 1)), p0:(AND (GEQ s1 1) (GEQ s104 1)), p2:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][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 RingSingleMessageInMbox-PT-d1m080-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-09 finished in 1181 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p1)))&&p0)))'
Support contains 3 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 878/878 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 268 transition count 483
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 268 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 268 transition count 482
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 250 transition count 464
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 250 transition count 464
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 250 transition count 460
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 134 place count 195 transition count 405
Iterating global reduction 2 with 55 rules applied. Total rules applied 189 place count 195 transition count 405
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 269 place count 195 transition count 325
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 273 place count 191 transition count 309
Iterating global reduction 3 with 4 rules applied. Total rules applied 277 place count 191 transition count 309
Applied a total of 277 rules in 22 ms. Remains 191 /287 variables (removed 96) and now considering 309/878 (removed 569) transitions.
// Phase 1: matrix 309 rows 191 cols
[2022-06-11 07:53:46] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 07:53:46] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 309 rows 191 cols
[2022-06-11 07:53:46] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 07:53:46] [INFO ] State equation strengthened by 130 read => feed constraints.
[2022-06-11 07:53:46] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
// Phase 1: matrix 309 rows 191 cols
[2022-06-11 07:53:46] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:53:47] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/287 places, 309/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 191/287 places, 309/878 transitions.
Stuttering acceptance computed with spot in 463 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (GEQ s1 1) (GEQ s159 1)), p0:(AND (GEQ s1 1) (GEQ s158 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-10 finished in 1321 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 878/878 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 267 transition count 452
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 267 transition count 452
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 267 transition count 451
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 248 transition count 432
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 248 transition count 432
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 248 transition count 430
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 140 place count 189 transition count 371
Iterating global reduction 2 with 59 rules applied. Total rules applied 199 place count 189 transition count 371
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 267 place count 189 transition count 303
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 272 place count 184 transition count 274
Iterating global reduction 3 with 5 rules applied. Total rules applied 277 place count 184 transition count 274
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 278 place count 183 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 183 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 280 place count 183 transition count 272
Applied a total of 280 rules in 41 ms. Remains 183 /287 variables (removed 104) and now considering 272/878 (removed 606) transitions.
// Phase 1: matrix 272 rows 183 cols
[2022-06-11 07:53:47] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:53:47] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 272 rows 183 cols
[2022-06-11 07:53:47] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-11 07:53:47] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-06-11 07:53:48] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2022-06-11 07:53:48] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 272 rows 183 cols
[2022-06-11 07:53:48] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:53:48] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/287 places, 272/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/287 places, 272/878 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s151 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-11 finished in 786 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(X(p0))||!((G(p1)||X(p2)) U !p1)))))'
Support contains 4 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 878/878 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 269 transition count 482
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 269 transition count 482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 269 transition count 481
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 54 place count 252 transition count 464
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 252 transition count 464
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 252 transition count 462
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 127 place count 198 transition count 408
Iterating global reduction 2 with 54 rules applied. Total rules applied 181 place count 198 transition count 408
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 265 place count 198 transition count 324
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 268 place count 195 transition count 309
Iterating global reduction 3 with 3 rules applied. Total rules applied 271 place count 195 transition count 309
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 272 place count 194 transition count 308
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 194 transition count 308
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 277 place count 190 transition count 304
Iterating global reduction 3 with 4 rules applied. Total rules applied 281 place count 190 transition count 304
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 301 place count 190 transition count 284
Applied a total of 301 rules in 24 ms. Remains 190 /287 variables (removed 97) and now considering 284/878 (removed 594) transitions.
// Phase 1: matrix 284 rows 190 cols
[2022-06-11 07:53:48] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:53:48] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 284 rows 190 cols
[2022-06-11 07:53:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 07:53:48] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-06-11 07:53:49] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
// Phase 1: matrix 284 rows 190 cols
[2022-06-11 07:53:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 07:53:49] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/287 places, 284/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 190/287 places, 284/878 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND p1 p0) (AND p1 (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(AND (GEQ s1 1) (GEQ s155 1)), p0:(OR (LT s1 1) (LT s175 1)), p2:(AND (GEQ s1 1) (GEQ s154 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 18439 reset in 209 ms.
Product exploration explored 100000 steps with 18430 reset in 213 ms.
Computed a total of 19 stabilizing places and 60 stable transitions
Computed a total of 19 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (X (NOT (OR (AND p1 p0) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 329 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1850 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 300 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1404505 steps, run timeout after 3001 ms. (steps per millisecond=468 ) properties seen :{}
Probabilistic random walk after 1404505 steps, saw 622883 distinct states, run finished after 3002 ms. (steps per millisecond=467 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 284 rows 190 cols
[2022-06-11 07:53:53] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 07:53:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 07:53:53] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 07:53:53] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 07:53:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 07:53:53] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 07:53:53] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 07:53:53] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-06-11 07:53:53] [INFO ] After 53ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 07:53:53] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-06-11 07:53:53] [INFO ] After 285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 190/190 places, 284/284 transitions.
Graph (complete) has 635 edges and 190 vertex of which 189 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 189 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 187 transition count 257
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 187 transition count 257
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 185 transition count 255
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 185 transition count 255
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 177 transition count 247
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 177 transition count 247
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 42 place count 177 transition count 239
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 175 transition count 221
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 175 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 174 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 174 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 174 transition count 219
Applied a total of 49 rules in 19 ms. Remains 174 /190 variables (removed 16) and now considering 219/284 (removed 65) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/190 places, 219/284 transitions.
Incomplete random walk after 10000 steps, including 2123 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 354 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1610531 steps, run timeout after 3001 ms. (steps per millisecond=536 ) properties seen :{}
Probabilistic random walk after 1610531 steps, saw 711723 distinct states, run finished after 3001 ms. (steps per millisecond=536 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 174 cols
[2022-06-11 07:53:56] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 07:53:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-11 07:53:56] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 07:53:56] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-11 07:53:57] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 07:53:57] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-06-11 07:53:57] [INFO ] After 43ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 07:53:57] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-06-11 07:53:57] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 174/174 places, 219/219 transitions.
Applied a total of 0 rules in 7 ms. Remains 174 /174 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 219/219 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 174/174 places, 219/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 174 /174 variables (removed 0) and now considering 219/219 (removed 0) transitions.
// Phase 1: matrix 219 rows 174 cols
[2022-06-11 07:53:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 07:53:57] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 219 rows 174 cols
[2022-06-11 07:53:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 07:53:57] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-06-11 07:53:57] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2022-06-11 07:53:57] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 219 rows 174 cols
[2022-06-11 07:53:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 07:53:57] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 219/219 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 174 transition count 215
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 171 transition count 215
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 7 place count 171 transition count 179
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 79 place count 135 transition count 179
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 130 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 129 transition count 180
Applied a total of 91 rules in 10 ms. Remains 129 /174 variables (removed 45) and now considering 180/219 (removed 39) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 180 rows 129 cols
[2022-06-11 07:53:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 07:53:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 07:53:57] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 07:53:57] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 07:53:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 07:53:57] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 07:53:57] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 07:53:58] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 0 ms to minimize.
[2022-06-11 07:53:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2022-06-11 07:53:58] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-11 07:53:58] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 07:53:58] [INFO ] Flatten gal took : 12 ms
[2022-06-11 07:53:58] [INFO ] Flatten gal took : 11 ms
[2022-06-11 07:53:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14257716102037902101.gal : 12 ms
[2022-06-11 07:53:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14120708901235450545.prop : 6 ms
Invoking ITS tools like this :cd /tmp/redAtoms17717592570714068357;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14257716102037902101.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14120708901235450545.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality14120708901235450545.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :40 after 107
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :107 after 152
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :152 after 203
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :203 after 403
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :403 after 783
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :783 after 1507
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1507 after 2839
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2839 after 5657
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5657 after 11291
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :11291 after 644926
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :644926 after 1.0915e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.0915e+09 after 1.38951e+09
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (X (NOT (OR (AND p1 p0) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 709 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 190 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 284/284 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 284/284 (removed 0) transitions.
// Phase 1: matrix 284 rows 190 cols
[2022-06-11 07:54:14] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 07:54:14] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 284 rows 190 cols
[2022-06-11 07:54:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 07:54:14] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-06-11 07:54:14] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
// Phase 1: matrix 284 rows 190 cols
[2022-06-11 07:54:14] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:54:14] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 190/190 places, 284/284 transitions.
Computed a total of 19 stabilizing places and 60 stable transitions
Computed a total of 19 stabilizing places and 60 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1838 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 296 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1362494 steps, run timeout after 3001 ms. (steps per millisecond=454 ) properties seen :{}
Probabilistic random walk after 1362494 steps, saw 603772 distinct states, run finished after 3001 ms. (steps per millisecond=454 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 284 rows 190 cols
[2022-06-11 07:54:18] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 07:54:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 07:54:18] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 07:54:18] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 07:54:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 07:54:18] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 07:54:18] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 07:54:18] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-06-11 07:54:18] [INFO ] After 52ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 07:54:18] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-06-11 07:54:18] [INFO ] After 287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 190/190 places, 284/284 transitions.
Graph (complete) has 635 edges and 190 vertex of which 189 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 189 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 187 transition count 257
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 187 transition count 257
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 185 transition count 255
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 185 transition count 255
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 177 transition count 247
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 177 transition count 247
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 42 place count 177 transition count 239
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 175 transition count 221
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 175 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 174 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 174 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 174 transition count 219
Applied a total of 49 rules in 19 ms. Remains 174 /190 variables (removed 16) and now considering 219/284 (removed 65) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/190 places, 219/284 transitions.
Incomplete random walk after 10000 steps, including 2132 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 373 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1653163 steps, run timeout after 3001 ms. (steps per millisecond=550 ) properties seen :{}
Probabilistic random walk after 1653163 steps, saw 730437 distinct states, run finished after 3001 ms. (steps per millisecond=550 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 174 cols
[2022-06-11 07:54:21] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 07:54:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-11 07:54:21] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 07:54:21] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-11 07:54:21] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 07:54:21] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-06-11 07:54:21] [INFO ] After 43ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 07:54:21] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-06-11 07:54:21] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 174/174 places, 219/219 transitions.
Applied a total of 0 rules in 7 ms. Remains 174 /174 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 219/219 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 174/174 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 174 /174 variables (removed 0) and now considering 219/219 (removed 0) transitions.
// Phase 1: matrix 219 rows 174 cols
[2022-06-11 07:54:22] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 07:54:22] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 219 rows 174 cols
[2022-06-11 07:54:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 07:54:22] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-06-11 07:54:22] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2022-06-11 07:54:22] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 219 rows 174 cols
[2022-06-11 07:54:22] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 07:54:22] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 219/219 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 174 transition count 215
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 171 transition count 215
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 7 place count 171 transition count 179
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 79 place count 135 transition count 179
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 130 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 129 transition count 180
Applied a total of 91 rules in 7 ms. Remains 129 /174 variables (removed 45) and now considering 180/219 (removed 39) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 180 rows 129 cols
[2022-06-11 07:54:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 07:54:22] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 07:54:22] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-11 07:54:22] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 07:54:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 07:54:22] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 07:54:22] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 07:54:22] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 0 ms to minimize.
[2022-06-11 07:54:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2022-06-11 07:54:22] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-11 07:54:22] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 07:54:22] [INFO ] Flatten gal took : 11 ms
[2022-06-11 07:54:22] [INFO ] Flatten gal took : 10 ms
[2022-06-11 07:54:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17770820733437439941.gal : 3 ms
[2022-06-11 07:54:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6826231597094969536.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13909174036622176131;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17770820733437439941.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6826231597094969536.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality6826231597094969536.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :40 after 107
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :107 after 152
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :152 after 203
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :203 after 403
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :403 after 783
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :783 after 1507
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1507 after 2839
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2839 after 5657
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5657 after 11291
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :11291 after 644926
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :644926 after 1.0915e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.0915e+09 after 1.38951e+09
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18351 reset in 205 ms.
Product exploration explored 100000 steps with 18541 reset in 206 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 284/284 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 188 transition count 266
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 188 transition count 266
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 186 transition count 264
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 186 transition count 264
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 16 place count 178 transition count 256
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 178 transition count 256
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 178 transition count 248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 176 transition count 230
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 176 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 175 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 175 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 175 transition count 228
Applied a total of 39 rules in 23 ms. Remains 175 /190 variables (removed 15) and now considering 228/284 (removed 56) transitions.
[2022-06-11 07:54:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 228 rows 175 cols
[2022-06-11 07:54:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 07:54:39] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 175/190 places, 228/284 transitions.
Finished structural reductions, in 1 iterations. Remains : 175/190 places, 228/284 transitions.
Product exploration explored 100000 steps with 18855 reset in 382 ms.
Product exploration explored 100000 steps with 18852 reset in 390 ms.
Built C files in :
/tmp/ltsmin5958122745909690739
[2022-06-11 07:54:39] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5958122745909690739
Running compilation step : cd /tmp/ltsmin5958122745909690739;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 425 ms.
Running link step : cd /tmp/ltsmin5958122745909690739;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5958122745909690739;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9703025781119939107.hoa' '--buchi-type=spotba'
LTSmin run took 3848 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-12 finished in 55988 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(!(F(p0) U F((X((false U p2))&&p1)))))'
Support contains 3 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 878/878 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 268 transition count 483
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 268 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 268 transition count 482
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 250 transition count 464
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 250 transition count 464
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 250 transition count 460
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 134 place count 195 transition count 405
Iterating global reduction 2 with 55 rules applied. Total rules applied 189 place count 195 transition count 405
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 265 place count 195 transition count 329
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 270 place count 190 transition count 300
Iterating global reduction 3 with 5 rules applied. Total rules applied 275 place count 190 transition count 300
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 276 place count 189 transition count 299
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 189 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 278 place count 189 transition count 298
Applied a total of 278 rules in 15 ms. Remains 189 /287 variables (removed 98) and now considering 298/878 (removed 580) transitions.
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:54:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 07:54:44] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:54:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 07:54:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-06-11 07:54:44] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:54:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 07:54:45] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/287 places, 298/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/287 places, 298/878 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (AND p1 p2), p2]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s157 1)), p2:(AND (GEQ s1 1) (GEQ s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 20497 reset in 211 ms.
Product exploration explored 100000 steps with 20635 reset in 266 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 389 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[true, (AND p1 p2), p2]
Finished random walk after 2325 steps, including 485 resets, run visited all 4 properties in 33 ms. (steps per millisecond=70 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2)]
Knowledge based reduction with 10 factoid took 450 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[true, (AND p1 p2), p2]
Stuttering acceptance computed with spot in 82 ms :[true, (AND p1 p2), p2]
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 298/298 transitions.
Applied a total of 0 rules in 3 ms. Remains 189 /189 variables (removed 0) and now considering 298/298 (removed 0) transitions.
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:54:46] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 07:54:46] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:54:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 07:54:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-06-11 07:54:47] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:54:47] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:54:47] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/189 places, 298/298 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 358 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 82 ms :[true, (AND p1 p2), p2]
Finished random walk after 233 steps, including 50 resets, run visited all 4 properties in 4 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2)]
Knowledge based reduction with 10 factoid took 464 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[true, (AND p1 p2), p2]
Stuttering acceptance computed with spot in 81 ms :[true, (AND p1 p2), p2]
Stuttering acceptance computed with spot in 118 ms :[true, (AND p1 p2), p2]
Product exploration explored 100000 steps with 20516 reset in 230 ms.
Product exploration explored 100000 steps with 20562 reset in 236 ms.
Built C files in :
/tmp/ltsmin79126570843740457
[2022-06-11 07:54:49] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin79126570843740457
Running compilation step : cd /tmp/ltsmin79126570843740457;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 460 ms.
Running link step : cd /tmp/ltsmin79126570843740457;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin79126570843740457;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2876174076787524460.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 298/298 transitions.
Applied a total of 0 rules in 5 ms. Remains 189 /189 variables (removed 0) and now considering 298/298 (removed 0) transitions.
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:55:04] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 07:55:04] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:55:04] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:55:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-06-11 07:55:05] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:55:05] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 07:55:05] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/189 places, 298/298 transitions.
Built C files in :
/tmp/ltsmin14668815608463909039
[2022-06-11 07:55:05] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14668815608463909039
Running compilation step : cd /tmp/ltsmin14668815608463909039;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 456 ms.
Running link step : cd /tmp/ltsmin14668815608463909039;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14668815608463909039;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7224732359634061726.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 07:55:20] [INFO ] Flatten gal took : 14 ms
[2022-06-11 07:55:20] [INFO ] Flatten gal took : 16 ms
[2022-06-11 07:55:20] [INFO ] Time to serialize gal into /tmp/LTL10146301448865228943.gal : 3 ms
[2022-06-11 07:55:20] [INFO ] Time to serialize properties into /tmp/LTL2754080527032932785.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10146301448865228943.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2754080527032932785.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1014630...267
Read 1 LTL properties
Checking formula 0 : !((G(!((F("((s1>=1)&&(l3928>=1))"))U(F(((X("((s1>=1)&&(l3916>=1))"))&&("(s1>=1)"))&&("(l3928>=1)")))))))
Formula 0 simplified : !G!(F"((s1>=1)&&(l3928>=1))" U F("(l3928>=1)" & "(s1>=1)" & X"((s1>=1)&&(l3916>=1))"))
Detected timeout of ITS tools.
[2022-06-11 07:55:35] [INFO ] Flatten gal took : 15 ms
[2022-06-11 07:55:35] [INFO ] Applying decomposition
[2022-06-11 07:55:35] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16746443213245597178.txt' '-o' '/tmp/graph16746443213245597178.bin' '-w' '/tmp/graph16746443213245597178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16746443213245597178.bin' '-l' '-1' '-v' '-w' '/tmp/graph16746443213245597178.weights' '-q' '0' '-e' '0.001'
[2022-06-11 07:55:35] [INFO ] Decomposing Gal with order
[2022-06-11 07:55:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 07:55:35] [INFO ] Removed a total of 304 redundant transitions.
[2022-06-11 07:55:36] [INFO ] Flatten gal took : 90 ms
[2022-06-11 07:55:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 203 labels/synchronizations in 12 ms.
[2022-06-11 07:55:36] [INFO ] Time to serialize gal into /tmp/LTL6662934806540825600.gal : 5 ms
[2022-06-11 07:55:36] [INFO ] Time to serialize properties into /tmp/LTL7598560304840569923.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6662934806540825600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7598560304840569923.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6662934...245
Read 1 LTL properties
Checking formula 0 : !((G(!((F("((i2.i1.u0.s1>=1)&&(u20.l3928>=1))"))U(F(((X("((i2.i1.u0.s1>=1)&&(u20.l3916>=1))"))&&("(i2.i1.u0.s1>=1)"))&&("(u20.l3928>=1...164
Formula 0 simplified : !G!(F"((i2.i1.u0.s1>=1)&&(u20.l3928>=1))" U F("(i2.i1.u0.s1>=1)" & "(u20.l3928>=1)" & X"((i2.i1.u0.s1>=1)&&(u20.l3916>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14363912972308483859
[2022-06-11 07:55:51] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14363912972308483859
Running compilation step : cd /tmp/ltsmin14363912972308483859;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 452 ms.
Running link step : cd /tmp/ltsmin14363912972308483859;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14363912972308483859;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](!(<>((LTLAPp0==true)) U <>((X((false U (LTLAPp2==true)))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-13 finished in 81915 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F(X(G(F((G(p1)&&p0)))))))))'
Support contains 3 out of 287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 878/878 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 268 transition count 455
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 268 transition count 455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 268 transition count 454
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 250 transition count 436
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 250 transition count 436
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 250 transition count 432
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 137 place count 192 transition count 374
Iterating global reduction 2 with 58 rules applied. Total rules applied 195 place count 192 transition count 374
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 263 place count 192 transition count 306
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 267 place count 188 transition count 278
Iterating global reduction 3 with 4 rules applied. Total rules applied 271 place count 188 transition count 278
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 272 place count 187 transition count 277
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 187 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 274 place count 187 transition count 276
Applied a total of 274 rules in 32 ms. Remains 187 /287 variables (removed 100) and now considering 276/878 (removed 602) transitions.
// Phase 1: matrix 276 rows 187 cols
[2022-06-11 07:56:06] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 07:56:06] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 276 rows 187 cols
[2022-06-11 07:56:06] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 07:56:06] [INFO ] State equation strengthened by 101 read => feed constraints.
[2022-06-11 07:56:06] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2022-06-11 07:56:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 276 rows 187 cols
[2022-06-11 07:56:06] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:56:06] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 187/287 places, 276/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 187/287 places, 276/878 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s171 1)), p1:(AND (GEQ s1 1) (GEQ s152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-15 finished in 883 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(!(F(p0) U F((X((false U p2))&&p1)))))'
Found a SL insensitive property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-13
Stuttering acceptance computed with spot in 78 ms :[true, (AND p1 p2), p2]
Support contains 3 out of 287 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 287/287 places, 878/878 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 268 transition count 483
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 268 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 268 transition count 482
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 250 transition count 464
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 250 transition count 464
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 250 transition count 460
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 134 place count 195 transition count 405
Iterating global reduction 2 with 55 rules applied. Total rules applied 189 place count 195 transition count 405
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 265 place count 195 transition count 329
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 270 place count 190 transition count 300
Iterating global reduction 3 with 5 rules applied. Total rules applied 275 place count 190 transition count 300
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 276 place count 189 transition count 299
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 189 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 278 place count 189 transition count 298
Applied a total of 278 rules in 30 ms. Remains 189 /287 variables (removed 98) and now considering 298/878 (removed 580) transitions.
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:56:07] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:56:07] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:56:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 07:56:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-06-11 07:56:07] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:56:07] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 07:56:08] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 189/287 places, 298/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/287 places, 298/878 transitions.
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s157 1)), p2:(AND (GEQ s1 1) (GEQ s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 20689 reset in 222 ms.
Product exploration explored 100000 steps with 20712 reset in 227 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 300 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[true, (AND p1 p2), p2]
Finished random walk after 175 steps, including 34 resets, run visited all 4 properties in 9 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2)]
Knowledge based reduction with 10 factoid took 360 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[true, (AND p1 p2), p2]
Stuttering acceptance computed with spot in 72 ms :[true, (AND p1 p2), p2]
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 298/298 transitions.
Applied a total of 0 rules in 5 ms. Remains 189 /189 variables (removed 0) and now considering 298/298 (removed 0) transitions.
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:56:09] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 07:56:09] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:56:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 07:56:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-06-11 07:56:10] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:56:10] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 07:56:10] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/189 places, 298/298 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 290 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[true, (AND p1 p2), p2]
Finished random walk after 1514 steps, including 297 resets, run visited all 4 properties in 13 ms. (steps per millisecond=116 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2)]
Knowledge based reduction with 10 factoid took 335 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[true, (AND p1 p2), p2]
Stuttering acceptance computed with spot in 80 ms :[true, (AND p1 p2), p2]
Stuttering acceptance computed with spot in 82 ms :[true, (AND p1 p2), p2]
Product exploration explored 100000 steps with 20355 reset in 224 ms.
Product exploration explored 100000 steps with 20637 reset in 246 ms.
Built C files in :
/tmp/ltsmin4606883229003207730
[2022-06-11 07:56:11] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4606883229003207730
Running compilation step : cd /tmp/ltsmin4606883229003207730;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 437 ms.
Running link step : cd /tmp/ltsmin4606883229003207730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4606883229003207730;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased803815223893163377.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 298/298 transitions.
Applied a total of 0 rules in 5 ms. Remains 189 /189 variables (removed 0) and now considering 298/298 (removed 0) transitions.
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:56:26] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 07:56:26] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:56:26] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 07:56:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-06-11 07:56:27] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
// Phase 1: matrix 298 rows 189 cols
[2022-06-11 07:56:27] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 07:56:27] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/189 places, 298/298 transitions.
Built C files in :
/tmp/ltsmin5603903912400335761
[2022-06-11 07:56:27] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5603903912400335761
Running compilation step : cd /tmp/ltsmin5603903912400335761;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 431 ms.
Running link step : cd /tmp/ltsmin5603903912400335761;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5603903912400335761;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15289222903762756458.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 07:56:42] [INFO ] Flatten gal took : 14 ms
[2022-06-11 07:56:42] [INFO ] Flatten gal took : 13 ms
[2022-06-11 07:56:42] [INFO ] Time to serialize gal into /tmp/LTL15020156407205694284.gal : 2 ms
[2022-06-11 07:56:42] [INFO ] Time to serialize properties into /tmp/LTL10837034576331816135.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15020156407205694284.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10837034576331816135.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1502015...268
Read 1 LTL properties
Checking formula 0 : !((G(!((F("((s1>=1)&&(l3928>=1))"))U(F(((X("((s1>=1)&&(l3916>=1))"))&&("(s1>=1)"))&&("(l3928>=1)")))))))
Formula 0 simplified : !G!(F"((s1>=1)&&(l3928>=1))" U F("(l3928>=1)" & "(s1>=1)" & X"((s1>=1)&&(l3916>=1))"))
Detected timeout of ITS tools.
[2022-06-11 07:56:57] [INFO ] Flatten gal took : 15 ms
[2022-06-11 07:56:57] [INFO ] Applying decomposition
[2022-06-11 07:56:57] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3977644337713178003.txt' '-o' '/tmp/graph3977644337713178003.bin' '-w' '/tmp/graph3977644337713178003.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3977644337713178003.bin' '-l' '-1' '-v' '-w' '/tmp/graph3977644337713178003.weights' '-q' '0' '-e' '0.001'
[2022-06-11 07:56:57] [INFO ] Decomposing Gal with order
[2022-06-11 07:56:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 07:56:57] [INFO ] Removed a total of 342 redundant transitions.
[2022-06-11 07:56:57] [INFO ] Flatten gal took : 27 ms
[2022-06-11 07:56:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 190 labels/synchronizations in 10 ms.
[2022-06-11 07:56:57] [INFO ] Time to serialize gal into /tmp/LTL2054159361501784507.gal : 3 ms
[2022-06-11 07:56:57] [INFO ] Time to serialize properties into /tmp/LTL15348877318391190675.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2054159361501784507.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15348877318391190675.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2054159...246
Read 1 LTL properties
Checking formula 0 : !((G(!((F("((u0.s1>=1)&&(u0.l3928>=1))"))U(F(((X("((u0.s1>=1)&&(u0.l3916>=1))"))&&("(u0.s1>=1)"))&&("(u0.l3928>=1)")))))))
Formula 0 simplified : !G!(F"((u0.s1>=1)&&(u0.l3928>=1))" U F("(u0.l3928>=1)" & "(u0.s1>=1)" & X"((u0.s1>=1)&&(u0.l3916>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9293564363507373196
[2022-06-11 07:57:12] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9293564363507373196
Running compilation step : cd /tmp/ltsmin9293564363507373196;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 451 ms.
Running link step : cd /tmp/ltsmin9293564363507373196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9293564363507373196;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](!(<>((LTLAPp0==true)) U <>((X((false U (LTLAPp2==true)))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-13 finished in 80984 ms.
[2022-06-11 07:57:28] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3828207935592707100
[2022-06-11 07:57:28] [INFO ] Computing symmetric may disable matrix : 878 transitions.
[2022-06-11 07:57:28] [INFO ] Applying decomposition
[2022-06-11 07:57:28] [INFO ] Computation of Complete disable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 07:57:28] [INFO ] Flatten gal took : 25 ms
[2022-06-11 07:57:28] [INFO ] Computing symmetric may enable matrix : 878 transitions.
[2022-06-11 07:57:28] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12254543415093077158.txt' '-o' '/tmp/graph12254543415093077158.bin' '-w' '/tmp/graph12254543415093077158.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12254543415093077158.bin' '-l' '-1' '-v' '-w' '/tmp/graph12254543415093077158.weights' '-q' '0' '-e' '0.001'
[2022-06-11 07:57:28] [INFO ] Decomposing Gal with order
[2022-06-11 07:57:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 07:57:28] [INFO ] Computing Do-Not-Accords matrix : 878 transitions.
[2022-06-11 07:57:28] [INFO ] Removed a total of 892 redundant transitions.
[2022-06-11 07:57:28] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 07:57:28] [INFO ] Built C files in 268ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3828207935592707100
Running compilation step : cd /tmp/ltsmin3828207935592707100;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 07:57:28] [INFO ] Flatten gal took : 139 ms
[2022-06-11 07:57:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 625 labels/synchronizations in 51 ms.
[2022-06-11 07:57:28] [INFO ] Time to serialize gal into /tmp/LTLFireability5055081259507322296.gal : 4 ms
[2022-06-11 07:57:28] [INFO ] Time to serialize properties into /tmp/LTLFireability11724844349604114761.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5055081259507322296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11724844349604114761.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((G(!((F("((u0.s1>=1)&&(u24.l3928>=1))"))U(F(((X("((u0.s1>=1)&&(u0.l3916>=1))"))&&("(u0.s1>=1)"))&&("(u24.l3928>=1)")))))))
Formula 0 simplified : !G!(F"((u0.s1>=1)&&(u24.l3928>=1))" U F("(u0.s1>=1)" & "(u24.l3928>=1)" & X"((u0.s1>=1)&&(u0.l3916>=1))"))
Compilation finished in 2731 ms.
Running link step : cd /tmp/ltsmin3828207935592707100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin3828207935592707100;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](!(<>((LTLAPp0==true)) U <>((X((false U (LTLAPp2==true)))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-11 08:18:56] [INFO ] Flatten gal took : 82 ms
[2022-06-11 08:18:56] [INFO ] Time to serialize gal into /tmp/LTLFireability13654353904701715055.gal : 24 ms
[2022-06-11 08:18:56] [INFO ] Time to serialize properties into /tmp/LTLFireability14089468217933887672.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13654353904701715055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14089468217933887672.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...290
Read 1 LTL properties
Checking formula 0 : !((G(!((F("((s1>=1)&&(l3928>=1))"))U(F(((X("((s1>=1)&&(l3916>=1))"))&&("(s1>=1)"))&&("(l3928>=1)")))))))
Formula 0 simplified : !G!(F"((s1>=1)&&(l3928>=1))" U F("(l3928>=1)" & "(s1>=1)" & X"((s1>=1)&&(l3916>=1))"))
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.052: LTL layer: formula: [](!(<>((LTLAPp0==true)) U <>((X((false U (LTLAPp2==true)))&&(LTLAPp1==true)))))
pins2lts-mc-linux64( 3/ 8), 0.052: "[](!(<>((LTLAPp0==true)) U <>((X((false U (LTLAPp2==true)))&&(LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.052: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.076: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.145: DFS-FIFO for weak LTL, using special progress label 882
pins2lts-mc-linux64( 0/ 8), 0.145: There are 883 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.145: State length is 288, there are 884 groups
pins2lts-mc-linux64( 0/ 8), 0.145: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.145: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.145: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.145: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.179: ~1 levels ~960 states ~2512 transitions
pins2lts-mc-linux64( 0/ 8), 0.221: ~1 levels ~1920 states ~9008 transitions
pins2lts-mc-linux64( 0/ 8), 0.296: ~1 levels ~3840 states ~18344 transitions
pins2lts-mc-linux64( 4/ 8), 0.406: ~1 levels ~7680 states ~25976 transitions
pins2lts-mc-linux64( 4/ 8), 0.644: ~1 levels ~15360 states ~58208 transitions
pins2lts-mc-linux64( 0/ 8), 1.134: ~1 levels ~30720 states ~174744 transitions
pins2lts-mc-linux64( 0/ 8), 1.939: ~1 levels ~61440 states ~305248 transitions
pins2lts-mc-linux64( 0/ 8), 3.476: ~1 levels ~122880 states ~642024 transitions
pins2lts-mc-linux64( 0/ 8), 6.432: ~1 levels ~245760 states ~1229816 transitions
pins2lts-mc-linux64( 6/ 8), 11.476: ~1 levels ~491520 states ~2040456 transitions
pins2lts-mc-linux64( 7/ 8), 20.825: ~1 levels ~983040 states ~4051408 transitions
pins2lts-mc-linux64( 7/ 8), 37.806: ~1 levels ~1966080 states ~7300152 transitions
pins2lts-mc-linux64( 2/ 8), 75.660: ~1 levels ~3932160 states ~15401792 transitions
pins2lts-mc-linux64( 3/ 8), 147.061: ~1 levels ~7864320 states ~29185088 transitions
pins2lts-mc-linux64( 7/ 8), 295.532: ~1 levels ~15728640 states ~61630928 transitions
pins2lts-mc-linux64( 7/ 8), 574.179: ~1 levels ~31457280 states ~114847272 transitions
pins2lts-mc-linux64( 2/ 8), 1134.942: ~1 levels ~62914560 states ~222533472 transitions
pins2lts-mc-linux64( 5/ 8), 1735.097: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1735.281:
pins2lts-mc-linux64( 0/ 8), 1735.281: mean standard work distribution: 2.2% (states) 4.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 1735.281:
pins2lts-mc-linux64( 0/ 8), 1735.281: Explored 91949682 states 370104444 transitions, fanout: 4.025
pins2lts-mc-linux64( 0/ 8), 1735.281: Total exploration time 1735.120 sec (1734.930 sec minimum, 1734.972 sec on average)
pins2lts-mc-linux64( 0/ 8), 1735.281: States per second: 52993, Transitions per second: 213302
pins2lts-mc-linux64( 0/ 8), 1735.281:
pins2lts-mc-linux64( 0/ 8), 1735.281: Progress states detected: 123699144
pins2lts-mc-linux64( 0/ 8), 1735.281: Redundant explorations: -25.6668
pins2lts-mc-linux64( 0/ 8), 1735.281:
pins2lts-mc-linux64( 0/ 8), 1735.281: Queue width: 8B, total height: 59337202, memory: 452.71MB
pins2lts-mc-linux64( 0/ 8), 1735.281: Tree memory: 1199.8MB, 10.2 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 1735.281: Tree fill ratio (roots/leafs): 92.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1735.281: Stored 971 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1735.281: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1735.281: Est. total memory use: 1652.5MB (~1476.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3828207935592707100;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](!(<>((LTLAPp0==true)) U <>((X((false U (LTLAPp2==true)))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3828207935592707100;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](!(<>((LTLAPp0==true)) U <>((X((false U (LTLAPp2==true)))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-11 08:40:26] [INFO ] Flatten gal took : 397 ms
[2022-06-11 08:40:27] [INFO ] Input system was already deterministic with 878 transitions.
[2022-06-11 08:40:27] [INFO ] Transformed 287 places.
[2022-06-11 08:40:27] [INFO ] Transformed 878 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-11 08:40:28] [INFO ] Time to serialize gal into /tmp/LTLFireability13122640137146656917.gal : 16 ms
[2022-06-11 08:40:28] [INFO ] Time to serialize properties into /tmp/LTLFireability10523033489227929103.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13122640137146656917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10523033489227929103.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(!((F("((s1>=1)&&(l3928>=1))"))U(F(((X("((s1>=1)&&(l3916>=1))"))&&("(s1>=1)"))&&("(l3928>=1)")))))))
Formula 0 simplified : !G!(F"((s1>=1)&&(l3928>=1))" U F("(l3928>=1)" & "(s1>=1)" & X"((s1>=1)&&(l3916>=1))"))

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

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