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-165472283000964.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 SieveSingleMsgMbox-PT-d2m36, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472283000964
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.9K Jun 7 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 7 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 17:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 7 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 7 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 SieveSingleMsgMbox-PT-d2m36-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654961978796

Running Version 202205111006
[2022-06-11 15:39:40] [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 15:39:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 15:39:40] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2022-06-11 15:39:40] [INFO ] Transformed 2398 places.
[2022-06-11 15:39:40] [INFO ] Transformed 1954 transitions.
[2022-06-11 15:39:40] [INFO ] Parsed PT model containing 2398 places and 1954 transitions in 325 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1984 places in 17 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 953 place count 289 transition count 629
Iterating global reduction 1 with 100 rules applied. Total rules applied 1053 place count 289 transition count 629
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1064 place count 289 transition count 618
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 1138 place count 215 transition count 544
Iterating global reduction 2 with 74 rules applied. Total rules applied 1212 place count 215 transition count 544
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1248 place count 215 transition count 508
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1271 place count 192 transition count 482
Iterating global reduction 3 with 23 rules applied. Total rules applied 1294 place count 192 transition count 482
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 3 with 69 rules applied. Total rules applied 1363 place count 192 transition count 413
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1369 place count 186 transition count 403
Iterating global reduction 4 with 6 rules applied. Total rules applied 1375 place count 186 transition count 403
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1381 place count 180 transition count 397
Iterating global reduction 4 with 6 rules applied. Total rules applied 1387 place count 180 transition count 397
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1390 place count 177 transition count 393
Iterating global reduction 4 with 3 rules applied. Total rules applied 1393 place count 177 transition count 393
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1395 place count 175 transition count 391
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 175 transition count 391
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1399 place count 173 transition count 389
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 173 transition count 389
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1402 place count 172 transition count 388
Iterating global reduction 4 with 1 rules applied. Total rules applied 1403 place count 172 transition count 388
Applied a total of 1403 rules in 105 ms. Remains 172 /414 variables (removed 242) and now considering 388/1954 (removed 1566) transitions.
// Phase 1: matrix 388 rows 172 cols
[2022-06-11 15:39:40] [INFO ] Computed 5 place invariants in 21 ms
[2022-06-11 15:39:40] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 388 rows 172 cols
[2022-06-11 15:39:40] [INFO ] Computed 5 place invariants in 20 ms
[2022-06-11 15:39:41] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-11 15:39:41] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
// Phase 1: matrix 388 rows 172 cols
[2022-06-11 15:39:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:39:41] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 172/414 places, 388/1954 transitions.
Finished structural reductions, in 1 iterations. Remains : 172/414 places, 388/1954 transitions.
Support contains 30 out of 172 places after structural reductions.
[2022-06-11 15:39:42] [INFO ] Flatten gal took : 54 ms
[2022-06-11 15:39:42] [INFO ] Flatten gal took : 27 ms
[2022-06-11 15:39:42] [INFO ] Input system was already deterministic with 388 transitions.
Incomplete random walk after 10000 steps, including 2230 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 110 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 259515 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 9=1, 10=1, 11=1, 13=1, 14=1, 16=1, 18=1, 21=1, 22=1, 23=1}
Probabilistic random walk after 259515 steps, saw 117039 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :15
Running SMT prover for 9 properties.
// Phase 1: matrix 388 rows 172 cols
[2022-06-11 15:39:45] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 15:39:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 15:39:46] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2022-06-11 15:39:46] [INFO ] After 524ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:7
[2022-06-11 15:39:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:39:46] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2022-06-11 15:39:46] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2022-06-11 15:39:46] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-11 15:39:47] [INFO ] After 487ms SMT Verify possible using 254 Read/Feed constraints in natural domain returned unsat :2 sat :7
[2022-06-11 15:39:47] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 9 ms to minimize.
[2022-06-11 15:39:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2022-06-11 15:39:48] [INFO ] After 1098ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 513 ms.
[2022-06-11 15:39:48] [INFO ] After 2064ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 171 ms.
Support contains 8 out of 172 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 172/172 places, 388/388 transitions.
Graph (complete) has 661 edges and 172 vertex of which 171 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 171 transition count 386
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 18 place count 156 transition count 261
Iterating global reduction 1 with 15 rules applied. Total rules applied 33 place count 156 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 156 transition count 258
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 48 place count 144 transition count 245
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 144 transition count 245
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 65 place count 144 transition count 240
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 73 place count 136 transition count 226
Iterating global reduction 3 with 8 rules applied. Total rules applied 81 place count 136 transition count 226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 86 place count 136 transition count 221
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 135 transition count 219
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 135 transition count 219
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 134 transition count 218
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 134 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 133 transition count 217
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 133 transition count 217
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 132 transition count 216
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 132 transition count 216
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 131 transition count 215
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 131 transition count 215
Applied a total of 96 rules in 72 ms. Remains 131 /172 variables (removed 41) and now considering 215/388 (removed 173) transitions.
Finished structural reductions, in 1 iterations. Remains : 131/172 places, 215/388 transitions.
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 450 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 319463 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{0=1}
Probabilistic random walk after 319463 steps, saw 145738 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :1
Running SMT prover for 6 properties.
// Phase 1: matrix 215 rows 131 cols
[2022-06-11 15:39:52] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-11 15:39:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:39:52] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 6 ms returned sat
[2022-06-11 15:39:52] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-11 15:39:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:39:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 15:39:53] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-11 15:39:53] [INFO ] State equation strengthened by 122 read => feed constraints.
[2022-06-11 15:39:53] [INFO ] After 256ms SMT Verify possible using 122 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-11 15:39:53] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2022-06-11 15:39:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2022-06-11 15:39:53] [INFO ] After 628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 225 ms.
[2022-06-11 15:39:53] [INFO ] After 1113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 88 ms.
Support contains 7 out of 131 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 131/131 places, 215/215 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 130 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 129 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 129 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 128 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 127 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 127 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 126 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 126 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 195
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 18 place count 125 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 124 transition count 189
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 124 transition count 189
Applied a total of 20 rules in 35 ms. Remains 124 /131 variables (removed 7) and now considering 189/215 (removed 26) transitions.
Finished structural reductions, in 1 iterations. Remains : 124/131 places, 189/215 transitions.
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 467 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 464 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 330636 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 330636 steps, saw 145493 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 189 rows 124 cols
[2022-06-11 15:39:57] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-11 15:39:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:39:57] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:39:57] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-11 15:39:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:39:58] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:39:58] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-11 15:39:58] [INFO ] State equation strengthened by 101 read => feed constraints.
[2022-06-11 15:39:58] [INFO ] After 255ms SMT Verify possible using 101 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-11 15:39:58] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2022-06-11 15:39:58] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 1 ms to minimize.
[2022-06-11 15:39:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2022-06-11 15:39:58] [INFO ] After 625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 184 ms.
[2022-06-11 15:39:58] [INFO ] After 1016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 110 ms.
Support contains 7 out of 124 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 124/124 places, 189/189 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 189/189 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 124/124 places, 189/189 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 189/189 (removed 0) transitions.
// Phase 1: matrix 189 rows 124 cols
[2022-06-11 15:39:59] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:39:59] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 189 rows 124 cols
[2022-06-11 15:39:59] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:39:59] [INFO ] State equation strengthened by 101 read => feed constraints.
[2022-06-11 15:39:59] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2022-06-11 15:39:59] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 189 rows 124 cols
[2022-06-11 15:39:59] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-11 15:39:59] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 189/189 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 124 transition count 182
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 118 transition count 182
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 118 transition count 165
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 101 transition count 165
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 65 place count 92 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 67 place count 91 transition count 165
Applied a total of 67 rules in 17 ms. Remains 91 /124 variables (removed 33) and now considering 165/189 (removed 24) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 165 rows 91 cols
[2022-06-11 15:39:59] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:39:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:39:59] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:39:59] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-11 15:39:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:39:59] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:40:00] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-11 15:40:00] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2022-06-11 15:40:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2022-06-11 15:40:00] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2022-06-11 15:40:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2022-06-11 15:40:00] [INFO ] After 419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 119 ms.
[2022-06-11 15:40:00] [INFO ] After 595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2022-06-11 15:40:00] [INFO ] Flatten gal took : 10 ms
[2022-06-11 15:40:00] [INFO ] Flatten gal took : 9 ms
[2022-06-11 15:40:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16245462763723430216.gal : 3 ms
[2022-06-11 15:40:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13257736869902171414.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12946160341485005511;'/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/ReachabilityCardinality16245462763723430216.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13257736869902171414.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/ReachabilityCardinality13257736869902171414.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :28 after 35
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :35 after 67
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :67 after 174
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :174 after 240
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :240 after 888
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :888 after 3300
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :3300 after 29516
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :29516 after 496546
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :496546 after 1.09994e+07
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :1.09994e+07 after 3.18435e+08
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :3.18435e+08 after 3.78167e+09
Detected timeout of ITS tools.
[2022-06-11 15:40:15] [INFO ] Flatten gal took : 10 ms
[2022-06-11 15:40:15] [INFO ] Applying decomposition
[2022-06-11 15:40:15] [INFO ] Flatten gal took : 8 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/graph13452197428081915242.txt' '-o' '/tmp/graph13452197428081915242.bin' '-w' '/tmp/graph13452197428081915242.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13452197428081915242.bin' '-l' '-1' '-v' '-w' '/tmp/graph13452197428081915242.weights' '-q' '0' '-e' '0.001'
[2022-06-11 15:40:15] [INFO ] Decomposing Gal with order
[2022-06-11 15:40:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 15:40:15] [INFO ] Removed a total of 33 redundant transitions.
[2022-06-11 15:40:15] [INFO ] Flatten gal took : 51 ms
[2022-06-11 15:40:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 4 ms.
[2022-06-11 15:40:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11045501167550371284.gal : 3 ms
[2022-06-11 15:40:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16973308823163517731.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12946160341485005511;'/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/ReachabilityCardinality11045501167550371284.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16973308823163517731.prop' '--nowitness'

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...300
Loading property file /tmp/ReachabilityCardinality16973308823163517731.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 12
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :12 after 20
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :20 after 32
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :32 after 80
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :80 after 126
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :126 after 174
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :218 after 252
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1340 after 1467
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :3383 after 5954
Reachability property AtomicPropp8 is true.
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :11225 after 18089
Reachability property AtomicPropp13 is true.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :26093 after 36468
Reachability property AtomicPropp18 is true.
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :41421 after 54056
Reachability property AtomicPropp6 is true.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :89508 after 95361
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :110322 after 148668
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :237520 after 257798
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :397774 after 542688
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16069311801141987536
[2022-06-11 15:40:30] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16069311801141987536
Running compilation step : cd /tmp/ltsmin16069311801141987536;'/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 326 ms.
Running link step : cd /tmp/ltsmin16069311801141987536;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin16069311801141987536;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp16==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 37 stabilizing places and 46 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(X((X(p0)||(F(p0)&&p1))))))))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 388/388 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 151 transition count 207
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 151 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 151 transition count 204
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 63 place count 133 transition count 185
Iterating global reduction 1 with 18 rules applied. Total rules applied 81 place count 133 transition count 185
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 133 transition count 178
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 100 place count 121 transition count 158
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 121 transition count 158
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 121 place count 121 transition count 149
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 125 place count 117 transition count 144
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 117 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 133 place count 113 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 113 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 111 transition count 138
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 111 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 111 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 109 transition count 134
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 109 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 108 transition count 133
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 108 transition count 133
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 150 place count 107 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 151 place count 107 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 152 place count 106 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 154 place count 105 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 105 transition count 128
Applied a total of 155 rules in 12 ms. Remains 105 /172 variables (removed 67) and now considering 128/388 (removed 260) transitions.
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 15:40:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:40:46] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 15:40:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:40:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 15:40:46] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 15:40:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:40:46] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/172 places, 128/388 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/172 places, 128/388 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s17 1) (GEQ s50 1)), p0:(AND (GEQ s1 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 finished in 744 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F(X(p0))))))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 388/388 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 151 transition count 207
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 151 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 151 transition count 204
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 63 place count 133 transition count 185
Iterating global reduction 1 with 18 rules applied. Total rules applied 81 place count 133 transition count 185
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 133 transition count 178
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 100 place count 121 transition count 158
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 121 transition count 158
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 121 place count 121 transition count 149
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 125 place count 117 transition count 144
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 117 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 133 place count 113 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 113 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 111 transition count 138
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 111 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 111 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 109 transition count 134
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 109 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 108 transition count 133
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 108 transition count 133
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 150 place count 107 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 151 place count 107 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 152 place count 106 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 154 place count 105 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 105 transition count 128
Applied a total of 155 rules in 33 ms. Remains 105 /172 variables (removed 67) and now considering 128/388 (removed 260) transitions.
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 15:40:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:40:46] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 15:40:46] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-11 15:40:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 15:40:47] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2022-06-11 15:40:47] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 15:40:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:40:47] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/172 places, 128/388 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/172 places, 128/388 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22390 reset in 253 ms.
Product exploration explored 100000 steps with 22458 reset in 170 ms.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2212 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16074 steps, run visited all 1 properties in 64 ms. (steps per millisecond=251 )
Probabilistic random walk after 16074 steps, saw 8113 distinct states, run finished after 64 ms. (steps per millisecond=251 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 10 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 15:40:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:40:48] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 15:40:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:40:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 15:40:48] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2022-06-11 15:40:48] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 15:40:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:40:48] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 128/128 transitions.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 487 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16074 steps, run visited all 1 properties in 27 ms. (steps per millisecond=595 )
Probabilistic random walk after 16074 steps, saw 8113 distinct states, run finished after 27 ms. (steps per millisecond=595 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22528 reset in 123 ms.
Product exploration explored 100000 steps with 22453 reset in 192 ms.
Built C files in :
/tmp/ltsmin5067991602528455818
[2022-06-11 15:40:49] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2022-06-11 15:40:49] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:40:49] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2022-06-11 15:40:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:40:49] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2022-06-11 15:40:49] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:40:49] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5067991602528455818
Running compilation step : cd /tmp/ltsmin5067991602528455818;'/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 261 ms.
Running link step : cd /tmp/ltsmin5067991602528455818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin5067991602528455818;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16206061132193244841.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 15:41:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:41:04] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 15:41:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:41:04] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 15:41:04] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2022-06-11 15:41:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 15:41:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:41:05] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 128/128 transitions.
Built C files in :
/tmp/ltsmin13246984368911039914
[2022-06-11 15:41:05] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2022-06-11 15:41:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:41:05] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2022-06-11 15:41:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:41:05] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2022-06-11 15:41:05] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:41:05] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13246984368911039914
Running compilation step : cd /tmp/ltsmin13246984368911039914;'/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 268 ms.
Running link step : cd /tmp/ltsmin13246984368911039914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13246984368911039914;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6581604381357070244.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 15:41:20] [INFO ] Flatten gal took : 8 ms
[2022-06-11 15:41:20] [INFO ] Flatten gal took : 7 ms
[2022-06-11 15:41:20] [INFO ] Time to serialize gal into /tmp/LTL9838568496830823083.gal : 1 ms
[2022-06-11 15:41:20] [INFO ] Time to serialize properties into /tmp/LTL15369762540689089083.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/LTL9838568496830823083.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15369762540689089083.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/LTL9838568...267
Read 1 LTL properties
Checking formula 0 : !((X(G(X(F(X("((s1<1)||(l2240<1))")))))))
Formula 0 simplified : !XGXFX"((s1<1)||(l2240<1))"
Detected timeout of ITS tools.
[2022-06-11 15:41:35] [INFO ] Flatten gal took : 7 ms
[2022-06-11 15:41:35] [INFO ] Applying decomposition
[2022-06-11 15:41:35] [INFO ] Flatten gal took : 7 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/graph1971126770417556236.txt' '-o' '/tmp/graph1971126770417556236.bin' '-w' '/tmp/graph1971126770417556236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1971126770417556236.bin' '-l' '-1' '-v' '-w' '/tmp/graph1971126770417556236.weights' '-q' '0' '-e' '0.001'
[2022-06-11 15:41:35] [INFO ] Decomposing Gal with order
[2022-06-11 15:41:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 15:41:35] [INFO ] Removed a total of 102 redundant transitions.
[2022-06-11 15:41:35] [INFO ] Flatten gal took : 14 ms
[2022-06-11 15:41:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 3 ms.
[2022-06-11 15:41:35] [INFO ] Time to serialize gal into /tmp/LTL17043488454852955180.gal : 2 ms
[2022-06-11 15:41:35] [INFO ] Time to serialize properties into /tmp/LTL820916815190572376.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/LTL17043488454852955180.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL820916815190572376.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/LTL1704348...245
Read 1 LTL properties
Checking formula 0 : !((X(G(X(F(X("((u0.s1<1)||(u0.l2240<1))")))))))
Formula 0 simplified : !XGXFX"((u0.s1<1)||(u0.l2240<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9174705582032309053
[2022-06-11 15:41:50] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9174705582032309053
Running compilation step : cd /tmp/ltsmin9174705582032309053;'/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 200 ms.
Running link step : cd /tmp/ltsmin9174705582032309053;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin9174705582032309053;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X(<>(X((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 finished in 78713 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(F(p0) U (G(p2)&&p1)))))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 388/388 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 152 transition count 209
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 152 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 152 transition count 207
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 60 place count 134 transition count 188
Iterating global reduction 1 with 18 rules applied. Total rules applied 78 place count 134 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 84 place count 134 transition count 182
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 96 place count 122 transition count 162
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 122 transition count 162
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 117 place count 122 transition count 153
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 119 transition count 149
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 119 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 116 transition count 146
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 116 transition count 146
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 114 transition count 144
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 114 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 135 place count 114 transition count 142
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 137 place count 112 transition count 140
Iterating global reduction 4 with 2 rules applied. Total rules applied 139 place count 112 transition count 140
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 111 transition count 139
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 111 transition count 139
Applied a total of 141 rules in 8 ms. Remains 111 /172 variables (removed 61) and now considering 139/388 (removed 249) transitions.
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:42:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:42:05] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:42:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:42:05] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-11 15:42:05] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:42:05] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-11 15:42:05] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/172 places, 139/388 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/172 places, 139/388 transitions.
Stuttering acceptance computed with spot in 387 ms :[(AND p1 p2), (AND p1 p2), (AND p0 p1 p2), (AND p1 p2), (AND p0 p1 p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s105 1)), p1:(AND (GEQ s1 1) (GEQ s105 1)), p2:(AND (GEQ s1 1) (GEQ s107 1) (NOT (AND (GEQ s1 1) (GEQ s61 1))))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22482 reset in 204 ms.
Product exploration explored 100000 steps with 22343 reset in 142 ms.
Computed a total of 27 stabilizing places and 31 stable transitions
Computed a total of 27 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 401 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 206 ms :[(AND p1 p2), (AND p1 p2), (AND p0 p1 p2), (AND p1 p2), (AND p0 p1 p2)]
Incomplete random walk after 10000 steps, including 2255 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 352760 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{0=1, 5=1}
Probabilistic random walk after 352760 steps, saw 158679 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :2
Running SMT prover for 4 properties.
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:42:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:42:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:42:10] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2022-06-11 15:42:10] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2022-06-11 15:42:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:42:11] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 15:42:11] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-06-11 15:42:11] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-11 15:42:11] [INFO ] After 48ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2022-06-11 15:42:11] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2022-06-11 15:42:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2022-06-11 15:42:11] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-06-11 15:42:11] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 111/111 places, 139/139 transitions.
Graph (complete) has 327 edges and 111 vertex of which 110 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 110 transition count 137
Applied a total of 3 rules in 5 ms. Remains 110 /111 variables (removed 1) and now considering 137/139 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 110/111 places, 137/139 transitions.
Incomplete random walk after 10000 steps, including 2251 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 491 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 603380 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 603380 steps, saw 267541 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 137 rows 110 cols
[2022-06-11 15:42:14] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:42:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:42:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:42:14] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 15:42:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:42:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:42:14] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 15:42:14] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-11 15:42:14] [INFO ] After 56ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 15:42:14] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2022-06-11 15:42:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2022-06-11 15:42:15] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2022-06-11 15:42:15] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 42 ms.
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 110/110 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 137/137 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 110/110 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 110 cols
[2022-06-11 15:42:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:42:15] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 137 rows 110 cols
[2022-06-11 15:42:15] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-11 15:42:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-11 15:42:15] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2022-06-11 15:42:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 137 rows 110 cols
[2022-06-11 15:42:15] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 15:42:15] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 137/137 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 110 transition count 131
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 105 transition count 131
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 11 place count 105 transition count 114
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 45 place count 88 transition count 114
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 59 place count 81 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 61 place count 80 transition count 116
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 80 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 79 transition count 115
Applied a total of 63 rules in 9 ms. Remains 79 /110 variables (removed 31) and now considering 115/137 (removed 22) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 115 rows 79 cols
[2022-06-11 15:42:15] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:42:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:42:15] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:42:15] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 15:42:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:42:15] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:42:15] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 15:42:15] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2022-06-11 15:42:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-06-11 15:42:15] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-06-11 15:42:15] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-11 15:42:15] [INFO ] Flatten gal took : 8 ms
[2022-06-11 15:42:15] [INFO ] Flatten gal took : 6 ms
[2022-06-11 15:42:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9313659367061947182.gal : 2 ms
[2022-06-11 15:42:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14931229645200848076.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10475973182509812592;'/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/ReachabilityCardinality9313659367061947182.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14931229645200848076.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/ReachabilityCardinality14931229645200848076.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :28 after 37
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :37 after 123
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :123 after 232
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :232 after 368
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :368 after 2620
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2620 after 23938
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :23938 after 354220
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :354220 after 6.51835e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6.51835e+06 after 1.32087e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.32087e+08 after 2.00529e+09
Detected timeout of ITS tools.
[2022-06-11 15:42:30] [INFO ] Flatten gal took : 9 ms
[2022-06-11 15:42:30] [INFO ] Applying decomposition
[2022-06-11 15:42:30] [INFO ] Flatten gal took : 5 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/graph14165975838812854737.txt' '-o' '/tmp/graph14165975838812854737.bin' '-w' '/tmp/graph14165975838812854737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14165975838812854737.bin' '-l' '-1' '-v' '-w' '/tmp/graph14165975838812854737.weights' '-q' '0' '-e' '0.001'
[2022-06-11 15:42:30] [INFO ] Decomposing Gal with order
[2022-06-11 15:42:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 15:42:30] [INFO ] Removed a total of 91 redundant transitions.
[2022-06-11 15:42:30] [INFO ] Flatten gal took : 13 ms
[2022-06-11 15:42:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 4 ms.
[2022-06-11 15:42:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12255408651993536425.gal : 2 ms
[2022-06-11 15:42:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8062510538942336647.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10475973182509812592;'/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/ReachabilityCardinality12255408651993536425.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8062510538942336647.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality8062510538942336647.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :6 after 58
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :58 after 158
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :220 after 338
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :416 after 2326
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3978 after 4552
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :17044 after 20746
Reachability property apf2 is true.
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 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\_mod\_flat,62598,2.53181,81608,1943,1499,47982,30244,367,595910,153,368827,0
Total reachable state count : 62598

Verifying 2 reachability properties.
Reachability property apf1 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
apf1,1,2.53484,81872,36,32,47982,30244,390,595910,160,368827,0
Reachability property apf2 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
apf2,1,2.53534,81872,36,32,47982,30244,390,595910,160,368827,0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p0))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND p1 p2 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0))), (F p0)]
Knowledge based reduction with 11 factoid took 454 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 127 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 139/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 139/139 (removed 0) transitions.
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:42:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:42:34] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:42:34] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:42:34] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-11 15:42:34] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2022-06-11 15:42:34] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:42:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:42:34] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/111 places, 139/139 transitions.
Computed a total of 27 stabilizing places and 31 stable transitions
Computed a total of 27 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND p0 p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 2245 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1899535 steps, run timeout after 3001 ms. (steps per millisecond=632 ) properties seen :{1=1}
Probabilistic random walk after 1899535 steps, saw 824534 distinct states, run finished after 3001 ms. (steps per millisecond=632 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:42:38] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:42:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 15:42:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 15:42:38] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:42:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:42:38] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 15:42:38] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:42:38] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-11 15:42:38] [INFO ] After 29ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:42:38] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-06-11 15:42:38] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 111/111 places, 139/139 transitions.
Graph (complete) has 327 edges and 111 vertex of which 110 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 110 transition count 137
Applied a total of 3 rules in 4 ms. Remains 110 /111 variables (removed 1) and now considering 137/139 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 110/111 places, 137/139 transitions.
Incomplete random walk after 10000 steps, including 2252 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1923320 steps, run timeout after 3001 ms. (steps per millisecond=640 ) properties seen :{}
Probabilistic random walk after 1923320 steps, saw 834528 distinct states, run finished after 3001 ms. (steps per millisecond=640 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 137 rows 110 cols
[2022-06-11 15:42:41] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 15:42:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:42:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:42:41] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:42:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 15:42:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:42:41] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:42:41] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-11 15:42:41] [INFO ] After 26ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:42:41] [INFO ] Deduced a trap composed of 37 places in 25 ms of which 0 ms to minimize.
[2022-06-11 15:42:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-06-11 15:42:41] [INFO ] After 97ms 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 15:42:41] [INFO ] After 228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 110/110 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 110 /110 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 137/137 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 110/110 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 110 cols
[2022-06-11 15:42:41] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:42:41] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 137 rows 110 cols
[2022-06-11 15:42:41] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 15:42:41] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-11 15:42:41] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2022-06-11 15:42:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 137 rows 110 cols
[2022-06-11 15:42:41] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 15:42:42] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 137/137 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 110 transition count 131
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 105 transition count 131
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 11 place count 105 transition count 114
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 45 place count 88 transition count 114
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 59 place count 81 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 61 place count 80 transition count 116
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 80 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 79 transition count 115
Applied a total of 63 rules in 7 ms. Remains 79 /110 variables (removed 31) and now considering 115/137 (removed 22) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 115 rows 79 cols
[2022-06-11 15:42:42] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:42:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:42:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:42:42] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:42:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 15:42:42] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 15:42:42] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:42:42] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-06-11 15:42:42] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:42:42] [INFO ] Flatten gal took : 5 ms
[2022-06-11 15:42:42] [INFO ] Flatten gal took : 9 ms
[2022-06-11 15:42:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10959153577030870541.gal : 1 ms
[2022-06-11 15:42:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5541841067976822724.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms68432756939738265;'/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/ReachabilityCardinality10959153577030870541.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5541841067976822724.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/ReachabilityCardinality5541841067976822724.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 123
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :123 after 232
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :232 after 368
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :368 after 2620
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2620 after 23938
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :23938 after 354220
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :354220 after 6.51835e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.51835e+06 after 1.32087e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.32087e+08 after 2.00529e+09
Detected timeout of ITS tools.
[2022-06-11 15:42:57] [INFO ] Flatten gal took : 17 ms
[2022-06-11 15:42:57] [INFO ] Applying decomposition
[2022-06-11 15:42: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/graph11093760536352236889.txt' '-o' '/tmp/graph11093760536352236889.bin' '-w' '/tmp/graph11093760536352236889.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11093760536352236889.bin' '-l' '-1' '-v' '-w' '/tmp/graph11093760536352236889.weights' '-q' '0' '-e' '0.001'
[2022-06-11 15:42:57] [INFO ] Decomposing Gal with order
[2022-06-11 15:42:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 15:42:57] [INFO ] Removed a total of 72 redundant transitions.
[2022-06-11 15:42:57] [INFO ] Flatten gal took : 16 ms
[2022-06-11 15:42:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 4 ms.
[2022-06-11 15:42:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15106578019019522586.gal : 2 ms
[2022-06-11 15:42:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13153816636338228457.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms68432756939738265;'/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/ReachabilityCardinality15106578019019522586.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13153816636338228457.prop' '--nowitness'

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...300
Loading property file /tmp/ReachabilityCardinality13153816636338228457.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 15
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :15 after 23
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :23 after 32
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :32 after 46
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :46 after 128
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :282 after 324
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :324 after 1209
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3054 after 3509
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3509 after 10478
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 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\_mod\_flat,43407,2.53454,80904,1204,4675,50285,117136,325,166588,194,704144,0
Total reachable state count : 43407

Verifying 1 reachability properties.
Reachability property apf0 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
apf0,7,2.53732,80904,41,82,50285,117136,347,166588,202,704144,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND p0 p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2))]
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 90 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 115 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 22334 reset in 137 ms.
Product exploration explored 100000 steps with 22486 reset in 124 ms.
Built C files in :
/tmp/ltsmin14564278829595914666
[2022-06-11 15:43:00] [INFO ] Computing symmetric may disable matrix : 139 transitions.
[2022-06-11 15:43:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:43:00] [INFO ] Computing symmetric may enable matrix : 139 transitions.
[2022-06-11 15:43:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:43:00] [INFO ] Computing Do-Not-Accords matrix : 139 transitions.
[2022-06-11 15:43:00] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:43:00] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14564278829595914666
Running compilation step : cd /tmp/ltsmin14564278829595914666;'/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 264 ms.
Running link step : cd /tmp/ltsmin14564278829595914666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14564278829595914666;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17365930059822088517.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 139/139 transitions.
Applied a total of 0 rules in 10 ms. Remains 111 /111 variables (removed 0) and now considering 139/139 (removed 0) transitions.
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:43:15] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:43:15] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:43:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:43:15] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-11 15:43:16] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2022-06-11 15:43:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:43:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:43:16] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/111 places, 139/139 transitions.
Built C files in :
/tmp/ltsmin18021053012575847463
[2022-06-11 15:43:16] [INFO ] Computing symmetric may disable matrix : 139 transitions.
[2022-06-11 15:43:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:43:16] [INFO ] Computing symmetric may enable matrix : 139 transitions.
[2022-06-11 15:43:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:43:16] [INFO ] Computing Do-Not-Accords matrix : 139 transitions.
[2022-06-11 15:43:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:43:16] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18021053012575847463
Running compilation step : cd /tmp/ltsmin18021053012575847463;'/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 285 ms.
Running link step : cd /tmp/ltsmin18021053012575847463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin18021053012575847463;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13864922463752921199.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 15:43:31] [INFO ] Flatten gal took : 8 ms
[2022-06-11 15:43:31] [INFO ] Flatten gal took : 5 ms
[2022-06-11 15:43:31] [INFO ] Time to serialize gal into /tmp/LTL7315006131274613154.gal : 1 ms
[2022-06-11 15:43:31] [INFO ] Time to serialize properties into /tmp/LTL15714571287741940198.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/LTL7315006131274613154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15714571287741940198.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/LTL7315006...267
Read 1 LTL properties
Checking formula 0 : !((X(F(!((F("((s1>=1)&&(l2225>=1))"))U(((G("(((s1>=1)&&(l2245>=1))&&(!((s1>=1)&&(l303>=1))))"))&&("(s1>=1)"))&&("(l2225>=1)")))))))
Formula 0 simplified : !XF!(F"((s1>=1)&&(l2225>=1))" U ("(l2225>=1)" & "(s1>=1)" & G"(((s1>=1)&&(l2245>=1))&&(!((s1>=1)&&(l303>=1))))"))
Detected timeout of ITS tools.
[2022-06-11 15:43:46] [INFO ] Flatten gal took : 6 ms
[2022-06-11 15:43:46] [INFO ] Applying decomposition
[2022-06-11 15:43:46] [INFO ] Flatten gal took : 6 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/graph13629924934400311234.txt' '-o' '/tmp/graph13629924934400311234.bin' '-w' '/tmp/graph13629924934400311234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13629924934400311234.bin' '-l' '-1' '-v' '-w' '/tmp/graph13629924934400311234.weights' '-q' '0' '-e' '0.001'
[2022-06-11 15:43:46] [INFO ] Decomposing Gal with order
[2022-06-11 15:43:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 15:43:46] [INFO ] Removed a total of 128 redundant transitions.
[2022-06-11 15:43:46] [INFO ] Flatten gal took : 14 ms
[2022-06-11 15:43:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 5 ms.
[2022-06-11 15:43:46] [INFO ] Time to serialize gal into /tmp/LTL1165244022838796648.gal : 2 ms
[2022-06-11 15:43:46] [INFO ] Time to serialize properties into /tmp/LTL3785693928635180473.ltl : 7 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/LTL1165244022838796648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3785693928635180473.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/LTL1165244...245
Read 1 LTL properties
Checking formula 0 : !((X(F(!((F("((i0.u0.s1>=1)&&(u21.l2225>=1))"))U(((G("(((i0.u0.s1>=1)&&(u11.l2245>=1))&&(!((i0.u0.s1>=1)&&(i1.u6.l303>=1))))"))&&("(i0...194
Formula 0 simplified : !XF!(F"((i0.u0.s1>=1)&&(u21.l2225>=1))" U ("(i0.u0.s1>=1)" & "(u21.l2225>=1)" & G"(((i0.u0.s1>=1)&&(u11.l2245>=1))&&(!((i0.u0.s1>=1)...178
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14356633620348198072
[2022-06-11 15:44:01] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14356633620348198072
Running compilation step : cd /tmp/ltsmin14356633620348198072;'/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 245 ms.
Running link step : cd /tmp/ltsmin14356633620348198072;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14356633620348198072;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(!(<>((LTLAPp0==true)) U ([]((LTLAPp2==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 finished in 131111 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!(p0 U F(p0))||X(p1)) U p2)))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 388/388 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 153 transition count 233
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 153 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 153 transition count 230
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 57 place count 137 transition count 213
Iterating global reduction 1 with 16 rules applied. Total rules applied 73 place count 137 transition count 213
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 78 place count 137 transition count 208
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 127 transition count 192
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 127 transition count 192
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 105 place count 127 transition count 185
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 125 transition count 182
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 125 transition count 182
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 123 transition count 180
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 123 transition count 180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 122 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 122 transition count 179
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 121 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 121 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 120 transition count 177
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 120 transition count 177
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 119 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 119 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 118 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 118 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 117 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 117 transition count 172
Applied a total of 125 rules in 21 ms. Remains 117 /172 variables (removed 55) and now considering 172/388 (removed 216) transitions.
// Phase 1: matrix 172 rows 117 cols
[2022-06-11 15:44:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:44:16] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 172 rows 117 cols
[2022-06-11 15:44:16] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:44:16] [INFO ] State equation strengthened by 90 read => feed constraints.
[2022-06-11 15:44:16] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
// Phase 1: matrix 172 rows 117 cols
[2022-06-11 15:44:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:44:17] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/172 places, 172/388 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/172 places, 172/388 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p2), (NOT p2), (NOT p1), (AND p0 (NOT p1)), true, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s111 1)), p0:(AND (GEQ s1 1) (GEQ s112 1)), p1:(AND (GEQ s1 1) (GEQ s110 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 2 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 finished in 696 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(p0)))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 388/388 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 151 transition count 195
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 151 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 151 transition count 192
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 63 place count 133 transition count 173
Iterating global reduction 1 with 18 rules applied. Total rules applied 81 place count 133 transition count 173
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 133 transition count 166
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 120 transition count 144
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 120 transition count 144
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 124 place count 120 transition count 134
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 129 place count 115 transition count 128
Iterating global reduction 3 with 5 rules applied. Total rules applied 134 place count 115 transition count 128
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 139 place count 110 transition count 123
Iterating global reduction 3 with 5 rules applied. Total rules applied 144 place count 110 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 107 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 107 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 152 place count 107 transition count 118
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 155 place count 104 transition count 115
Iterating global reduction 4 with 3 rules applied. Total rules applied 158 place count 104 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 159 place count 103 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 103 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 161 place count 102 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 102 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 163 place count 101 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 164 place count 101 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 100 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 100 transition count 109
Applied a total of 166 rules in 30 ms. Remains 100 /172 variables (removed 72) and now considering 109/388 (removed 279) transitions.
// Phase 1: matrix 109 rows 100 cols
[2022-06-11 15:44:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:44:17] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 109 rows 100 cols
[2022-06-11 15:44:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:44:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-11 15:44:17] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2022-06-11 15:44:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 109 rows 100 cols
[2022-06-11 15:44:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:44:17] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/172 places, 109/388 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/172 places, 109/388 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 finished in 359 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||!(X(p1) U X(X(p2))))))'
Support contains 5 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 388/388 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 152 transition count 220
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 152 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 152 transition count 217
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 60 place count 135 transition count 199
Iterating global reduction 1 with 17 rules applied. Total rules applied 77 place count 135 transition count 199
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 84 place count 135 transition count 192
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 95 place count 124 transition count 174
Iterating global reduction 2 with 11 rules applied. Total rules applied 106 place count 124 transition count 174
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 114 place count 124 transition count 166
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 121 transition count 162
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 121 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 118 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 118 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 117 transition count 158
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 117 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 116 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 116 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 115 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 115 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 133 place count 114 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 114 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 113 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 113 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 112 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 112 transition count 151
Applied a total of 138 rules in 9 ms. Remains 112 /172 variables (removed 60) and now considering 151/388 (removed 237) transitions.
// Phase 1: matrix 151 rows 112 cols
[2022-06-11 15:44:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:44:17] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 151 rows 112 cols
[2022-06-11 15:44:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:44:17] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-11 15:44:17] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
// Phase 1: matrix 151 rows 112 cols
[2022-06-11 15:44:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:44:18] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/172 places, 151/388 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/172 places, 151/388 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s24 1) (LT s32 1)) (OR (LT s1 1) (LT s106 1))), p1:(AND (GEQ s24 1) (GEQ s32 1)), p2:(AND (GEQ s1 1) (GEQ s107 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]]
Product exploration explored 100000 steps with 50000 reset in 280 ms.
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 finished in 1242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))||(F(p0)&&p1))))'
Support contains 3 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 388/388 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 151 transition count 195
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 151 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 151 transition count 192
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 63 place count 133 transition count 173
Iterating global reduction 1 with 18 rules applied. Total rules applied 81 place count 133 transition count 173
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 133 transition count 166
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 99 place count 122 transition count 146
Iterating global reduction 2 with 11 rules applied. Total rules applied 110 place count 122 transition count 146
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 122 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 124 place count 118 transition count 132
Iterating global reduction 3 with 4 rules applied. Total rules applied 128 place count 118 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 132 place count 114 transition count 128
Iterating global reduction 3 with 4 rules applied. Total rules applied 136 place count 114 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 138 place count 112 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 112 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 142 place count 112 transition count 124
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 144 place count 110 transition count 122
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 110 transition count 122
Applied a total of 146 rules in 15 ms. Remains 110 /172 variables (removed 62) and now considering 122/388 (removed 266) transitions.
// Phase 1: matrix 122 rows 110 cols
[2022-06-11 15:44:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:44:18] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 122 rows 110 cols
[2022-06-11 15:44:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:44:19] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 15:44:19] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 110 cols
[2022-06-11 15:44:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:44:19] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/172 places, 122/388 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/172 places, 122/388 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s64 1)), p0:(AND (GEQ s1 1) (GEQ s97 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][false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-09 finished in 413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F(((G(F(p0)) U F(!p1))&&!p0)))))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 388/388 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 152 transition count 197
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 152 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 152 transition count 195
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 135 transition count 178
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 135 transition count 178
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 135 transition count 171
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 95 place count 123 transition count 150
Iterating global reduction 2 with 12 rules applied. Total rules applied 107 place count 123 transition count 150
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 115 place count 123 transition count 142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 120 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 120 transition count 138
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 124 place count 117 transition count 135
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 117 transition count 135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 115 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 115 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 115 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 134 place count 113 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 113 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 112 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 112 transition count 129
Applied a total of 138 rules in 13 ms. Remains 112 /172 variables (removed 60) and now considering 129/388 (removed 259) transitions.
// Phase 1: matrix 129 rows 112 cols
[2022-06-11 15:44:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:44:19] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 129 rows 112 cols
[2022-06-11 15:44:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:44:19] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-11 15:44:19] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 112 cols
[2022-06-11 15:44:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:44:19] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/172 places, 129/388 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/172 places, 129/388 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR p0 p1), p1, (OR p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s26 1) (GEQ s76 1)), p0:(AND (GEQ s1 1) (GEQ s60 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Computed a total of 30 stabilizing places and 36 stable transitions
Computed a total of 30 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 6 factoid took 156 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 finished in 1056 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(X(X(F(p2)))||p1))))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 388/388 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 153 transition count 222
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 153 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 153 transition count 219
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 57 place count 137 transition count 202
Iterating global reduction 1 with 16 rules applied. Total rules applied 73 place count 137 transition count 202
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 79 place count 137 transition count 196
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 89 place count 127 transition count 179
Iterating global reduction 2 with 10 rules applied. Total rules applied 99 place count 127 transition count 179
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 106 place count 127 transition count 172
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 125 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 125 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 123 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 123 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 122 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 122 transition count 166
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 121 transition count 165
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 121 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 120 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 120 transition count 164
Applied a total of 120 rules in 17 ms. Remains 120 /172 variables (removed 52) and now considering 164/388 (removed 224) transitions.
// Phase 1: matrix 164 rows 120 cols
[2022-06-11 15:44:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:44:20] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 164 rows 120 cols
[2022-06-11 15:44:20] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:44:20] [INFO ] State equation strengthened by 80 read => feed constraints.
[2022-06-11 15:44:20] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
// Phase 1: matrix 164 rows 120 cols
[2022-06-11 15:44:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:44:20] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/172 places, 164/388 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/172 places, 164/388 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=p0, acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(OR (LT s1 1) (LT s114 1)), p1:(OR (LT s1 1) (LT s115 1)), p2:(OR (LT s1 1) (LT s62 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22509 reset in 149 ms.
Product exploration explored 100000 steps with 22469 reset in 147 ms.
Computed a total of 30 stabilizing places and 36 stable transitions
Computed a total of 30 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 215 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1803490 steps, run timeout after 3001 ms. (steps per millisecond=600 ) properties seen :{}
Probabilistic random walk after 1803490 steps, saw 787054 distinct states, run finished after 3001 ms. (steps per millisecond=600 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 164 rows 120 cols
[2022-06-11 15:44:24] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 15:44:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:44:24] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 15:44:24] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:44:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:44:24] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 15:44:24] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:44:24] [INFO ] State equation strengthened by 80 read => feed constraints.
[2022-06-11 15:44:24] [INFO ] After 33ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:44:24] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2022-06-11 15:44:24] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
[2022-06-11 15:44:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2022-06-11 15:44:24] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-06-11 15:44:25] [INFO ] After 285ms 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 120 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 120/120 places, 164/164 transitions.
Graph (complete) has 364 edges and 120 vertex of which 119 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 119 transition count 162
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 117 transition count 147
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 117 transition count 147
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 115 transition count 145
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 115 transition count 145
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 113 transition count 142
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 113 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 113 transition count 140
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 111 transition count 138
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 111 transition count 138
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 109 transition count 136
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 109 transition count 136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 107 transition count 132
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 107 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 107 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 105 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 105 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 104 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 104 transition count 127
Applied a total of 37 rules in 30 ms. Remains 104 /120 variables (removed 16) and now considering 127/164 (removed 37) transitions.
Finished structural reductions, in 1 iterations. Remains : 104/120 places, 127/164 transitions.
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 448 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2178449 steps, run timeout after 3001 ms. (steps per millisecond=725 ) properties seen :{}
Probabilistic random walk after 2178449 steps, saw 914950 distinct states, run finished after 3001 ms. (steps per millisecond=725 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2022-06-11 15:44:28] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:44:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:44:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:44:28] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:44:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:44:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-11 15:44:28] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:44:28] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-11 15:44:28] [INFO ] After 22ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:44:28] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-11 15:44:28] [INFO ] After 133ms 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 104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 104 cols
[2022-06-11 15:44:28] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:44:28] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 127 rows 104 cols
[2022-06-11 15:44:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:44:28] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-11 15:44:28] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2022-06-11 15:44:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 127 rows 104 cols
[2022-06-11 15:44:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:44:28] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 61 place count 74 transition count 106
Applied a total of 61 rules in 5 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2022-06-11 15:44:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:44:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:44:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:44:28] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:44:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 15:44:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 15:44:28] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:44:28] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-11 15:44:28] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:44:28] [INFO ] Flatten gal took : 10 ms
[2022-06-11 15:44:28] [INFO ] Flatten gal took : 5 ms
[2022-06-11 15:44:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17578854680389475916.gal : 1 ms
[2022-06-11 15:44:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality655169605317228125.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16681115639328327428;'/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/ReachabilityCardinality17578854680389475916.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality655169605317228125.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...319
Loading property file /tmp/ReachabilityCardinality655169605317228125.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 116
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :116 after 194
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :194 after 310
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :310 after 1474
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1474 after 3262
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3262 after 67206
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :67206 after 867642
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :867642 after 2.89147e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.89147e+07 after 5.74663e+08
Detected timeout of ITS tools.
[2022-06-11 15:44:43] [INFO ] Flatten gal took : 4 ms
[2022-06-11 15:44:43] [INFO ] Applying decomposition
[2022-06-11 15:44:43] [INFO ] Flatten gal took : 4 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/graph724973453738752090.txt' '-o' '/tmp/graph724973453738752090.bin' '-w' '/tmp/graph724973453738752090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph724973453738752090.bin' '-l' '-1' '-v' '-w' '/tmp/graph724973453738752090.weights' '-q' '0' '-e' '0.001'
[2022-06-11 15:44:43] [INFO ] Decomposing Gal with order
[2022-06-11 15:44:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 15:44:43] [INFO ] Removed a total of 69 redundant transitions.
[2022-06-11 15:44:43] [INFO ] Flatten gal took : 14 ms
[2022-06-11 15:44:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 2 ms.
[2022-06-11 15:44:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3856098641540467232.gal : 1 ms
[2022-06-11 15:44:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16374695317069504176.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16681115639328327428;'/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/ReachabilityCardinality3856098641540467232.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16374695317069504176.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality16374695317069504176.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 48
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :48 after 106
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :288 after 346
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :346 after 1084
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3245 after 6091
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :21104 after 31721
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18150429640946812962
[2022-06-11 15:44:58] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18150429640946812962
Running compilation step : cd /tmp/ltsmin18150429640946812962;'/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 191 ms.
Running link step : cd /tmp/ltsmin18150429640946812962;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin18150429640946812962;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
LTSmin run took 108 ms.
Found Violation
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 232 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 120 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 164/164 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 164/164 (removed 0) transitions.
// Phase 1: matrix 164 rows 120 cols
[2022-06-11 15:44:59] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 15:44:59] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 164 rows 120 cols
[2022-06-11 15:44:59] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:44:59] [INFO ] State equation strengthened by 80 read => feed constraints.
[2022-06-11 15:44:59] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
// Phase 1: matrix 164 rows 120 cols
[2022-06-11 15:44:59] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 15:45:00] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 164/164 transitions.
Computed a total of 30 stabilizing places and 36 stable transitions
Computed a total of 30 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2224 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1876934 steps, run timeout after 3001 ms. (steps per millisecond=625 ) properties seen :{}
Probabilistic random walk after 1876934 steps, saw 816669 distinct states, run finished after 3001 ms. (steps per millisecond=625 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 164 rows 120 cols
[2022-06-11 15:45:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:45:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:45:03] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 15:45:03] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:45:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:45:03] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 15:45:03] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:45:03] [INFO ] State equation strengthened by 80 read => feed constraints.
[2022-06-11 15:45:03] [INFO ] After 33ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:45:03] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2022-06-11 15:45:03] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 0 ms to minimize.
[2022-06-11 15:45:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2022-06-11 15:45:03] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-06-11 15:45:03] [INFO ] After 312ms 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 120 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 120/120 places, 164/164 transitions.
Graph (complete) has 364 edges and 120 vertex of which 119 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 119 transition count 162
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 117 transition count 147
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 117 transition count 147
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 115 transition count 145
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 115 transition count 145
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 113 transition count 142
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 113 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 113 transition count 140
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 111 transition count 138
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 111 transition count 138
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 109 transition count 136
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 109 transition count 136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 107 transition count 132
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 107 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 107 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 105 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 105 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 104 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 104 transition count 127
Applied a total of 37 rules in 15 ms. Remains 104 /120 variables (removed 16) and now considering 127/164 (removed 37) transitions.
Finished structural reductions, in 1 iterations. Remains : 104/120 places, 127/164 transitions.
Incomplete random walk after 10000 steps, including 2269 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2252589 steps, run timeout after 3001 ms. (steps per millisecond=750 ) properties seen :{}
Probabilistic random walk after 2252589 steps, saw 946153 distinct states, run finished after 3002 ms. (steps per millisecond=750 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2022-06-11 15:45:06] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 15:45:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:45:06] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:45:06] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:45:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:45:06] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:45:07] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:45:07] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-11 15:45:07] [INFO ] After 21ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:45:07] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-11 15:45:07] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 104 cols
[2022-06-11 15:45:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:45:07] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 127 rows 104 cols
[2022-06-11 15:45:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:45:07] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-11 15:45:07] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2022-06-11 15:45:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 127 rows 104 cols
[2022-06-11 15:45:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:45:07] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 61 place count 74 transition count 106
Applied a total of 61 rules in 7 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2022-06-11 15:45:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:45:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:45:07] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:45:07] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:45:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:45:07] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:45:07] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:45:07] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-11 15:45:07] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:45:07] [INFO ] Flatten gal took : 7 ms
[2022-06-11 15:45:07] [INFO ] Flatten gal took : 4 ms
[2022-06-11 15:45:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12348593264342321448.gal : 1 ms
[2022-06-11 15:45:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18340891204302075833.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14959814860167189353;'/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/ReachabilityCardinality12348593264342321448.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18340891204302075833.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/ReachabilityCardinality18340891204302075833.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 116
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :116 after 194
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :194 after 310
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :310 after 1474
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1474 after 3262
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3262 after 67206
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :67206 after 867642
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :867642 after 2.89147e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.89147e+07 after 5.74663e+08
Detected timeout of ITS tools.
[2022-06-11 15:45:22] [INFO ] Flatten gal took : 14 ms
[2022-06-11 15:45:22] [INFO ] Applying decomposition
[2022-06-11 15:45:22] [INFO ] Flatten gal took : 16 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/graph14595978638158430044.txt' '-o' '/tmp/graph14595978638158430044.bin' '-w' '/tmp/graph14595978638158430044.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14595978638158430044.bin' '-l' '-1' '-v' '-w' '/tmp/graph14595978638158430044.weights' '-q' '0' '-e' '0.001'
[2022-06-11 15:45:22] [INFO ] Decomposing Gal with order
[2022-06-11 15:45:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 15:45:22] [INFO ] Removed a total of 71 redundant transitions.
[2022-06-11 15:45:22] [INFO ] Flatten gal took : 11 ms
[2022-06-11 15:45:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 4 ms.
[2022-06-11 15:45:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18445538555759627144.gal : 8 ms
[2022-06-11 15:45:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5967197576270989554.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14959814860167189353;'/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/ReachabilityCardinality18445538555759627144.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5967197576270989554.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality5967197576270989554.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 9
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :9 after 9
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9 after 22
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :22 after 54
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :182 after 208
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :352 after 734
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2465 after 2507
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3395 after 5265
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :16639 after 16783
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 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\_mod\_flat,39456,13.5876,280832,1381,3381,54097,104470,315,1.16806e+06,168,3.95511e+06,0
Total reachable state count : 39456

Verifying 1 reachability properties.
Reachability property apf0 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
apf0,1,13.5935,280832,28,37,54097,104470,322,1.16806e+06,171,3.95511e+06,0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22428 reset in 147 ms.
Product exploration explored 100000 steps with 22377 reset in 139 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 164/164 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 118 transition count 149
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 149
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 116 transition count 147
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 116 transition count 147
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 114 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 114 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 114 transition count 142
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 112 transition count 140
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 112 transition count 140
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 110 transition count 138
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 108 transition count 134
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 106 transition count 130
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 105 transition count 129
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 105 transition count 129
Applied a total of 34 rules in 43 ms. Remains 105 /120 variables (removed 15) and now considering 129/164 (removed 35) transitions.
[2022-06-11 15:45:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 15:45:37] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:45:37] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/120 places, 129/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/120 places, 129/164 transitions.
Product exploration explored 100000 steps with 22442 reset in 285 ms.
Product exploration explored 100000 steps with 22577 reset in 283 ms.
Built C files in :
/tmp/ltsmin9053268354581135267
[2022-06-11 15:45:38] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9053268354581135267
Running compilation step : cd /tmp/ltsmin9053268354581135267;'/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 272 ms.
Running link step : cd /tmp/ltsmin9053268354581135267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9053268354581135267;'/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/stateBased7868563303455537460.hoa' '--buchi-type=spotba'
LTSmin run took 2166 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 finished in 80436 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!G(F(p2))&&p1)))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 388/388 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 153 transition count 233
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 153 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 153 transition count 230
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 57 place count 137 transition count 213
Iterating global reduction 1 with 16 rules applied. Total rules applied 73 place count 137 transition count 213
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 77 place count 137 transition count 209
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 87 place count 127 transition count 193
Iterating global reduction 2 with 10 rules applied. Total rules applied 97 place count 127 transition count 193
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 104 place count 127 transition count 186
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 107 place count 124 transition count 182
Iterating global reduction 3 with 3 rules applied. Total rules applied 110 place count 124 transition count 182
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 121 transition count 179
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 121 transition count 179
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 120 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 120 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 119 transition count 177
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 119 transition count 177
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 121 place count 118 transition count 176
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 118 transition count 176
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 117 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 117 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 116 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 116 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 115 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 115 transition count 171
Applied a total of 128 rules in 29 ms. Remains 115 /172 variables (removed 57) and now considering 171/388 (removed 217) transitions.
// Phase 1: matrix 171 rows 115 cols
[2022-06-11 15:45:40] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 15:45:40] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 171 rows 115 cols
[2022-06-11 15:45:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:45:40] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-06-11 15:45:41] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2022-06-11 15:45:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 171 rows 115 cols
[2022-06-11 15:45:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:45:41] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/172 places, 171/388 transitions.
Finished structural reductions, in 1 iterations. Remains : 115/172 places, 171/388 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p1) p2), true, p2]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s108 1)), p0:(OR (LT s1 1) (LT s109 1)), p2:(AND (GEQ s1 1) (GEQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-13 finished in 573 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||X(G((X(G(p1))||p1)))||p2)))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 388/388 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 153 transition count 210
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 153 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 153 transition count 208
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 58 place count 135 transition count 189
Iterating global reduction 1 with 18 rules applied. Total rules applied 76 place count 135 transition count 189
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 135 transition count 182
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 95 place count 123 transition count 162
Iterating global reduction 2 with 12 rules applied. Total rules applied 107 place count 123 transition count 162
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 115 place count 123 transition count 154
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 120 transition count 150
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 120 transition count 150
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 124 place count 117 transition count 147
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 117 transition count 147
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 116 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 116 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 115 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 115 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 114 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 114 transition count 144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 113 transition count 141
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 113 transition count 141
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 112 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 112 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 111 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 111 transition count 139
Applied a total of 139 rules in 15 ms. Remains 111 /172 variables (removed 61) and now considering 139/388 (removed 249) transitions.
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:45:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:45:41] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:45:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:45:41] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-06-11 15:45:41] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:45:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:45:41] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/172 places, 139/388 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/172 places, 139/388 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (GEQ s1 1) (GEQ s106 1)), p0:(AND (GEQ s1 1) (GEQ s103 1)), p1:(AND (GEQ s1 1) (GEQ s64 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-15 finished in 580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F(X(p0))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(F(p0) U (G(p2)&&p1)))))'
Found a CL insensitive property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-02
Stuttering acceptance computed with spot in 205 ms :[(AND p1 p2), (AND p1 p2), (AND p0 p1 p2), (AND p1 p2), (AND p0 p1 p2)]
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 172/172 places, 388/388 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 152 transition count 209
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 152 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 152 transition count 207
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 60 place count 134 transition count 188
Iterating global reduction 1 with 18 rules applied. Total rules applied 78 place count 134 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 84 place count 134 transition count 182
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 96 place count 122 transition count 162
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 122 transition count 162
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 117 place count 122 transition count 153
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 119 transition count 149
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 119 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 116 transition count 146
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 116 transition count 146
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 114 transition count 144
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 114 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 135 place count 114 transition count 142
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 137 place count 112 transition count 140
Iterating global reduction 4 with 2 rules applied. Total rules applied 139 place count 112 transition count 140
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 111 transition count 139
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 111 transition count 139
Applied a total of 141 rules in 23 ms. Remains 111 /172 variables (removed 61) and now considering 139/388 (removed 249) transitions.
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:45:42] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:45:42] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:45:42] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:45:42] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-11 15:45:42] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:45:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:45:42] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 111/172 places, 139/388 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/172 places, 139/388 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s105 1)), p1:(AND (GEQ s1 1) (GEQ s105 1)), p2:(AND (GEQ s1 1) (GEQ s107 1) (NOT (AND (GEQ s1 1) (GEQ s61 1))))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22258 reset in 129 ms.
Product exploration explored 100000 steps with 22386 reset in 148 ms.
Computed a total of 27 stabilizing places and 31 stable transitions
Computed a total of 27 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 373 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 190 ms :[(AND p1 p2), (AND p1 p2), (AND p0 p1 p2), (AND p1 p2), (AND p0 p1 p2)]
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 455 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 462 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 442 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 433 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 431622 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{0=1, 5=1}
Probabilistic random walk after 431622 steps, saw 193000 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :2
Running SMT prover for 4 properties.
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:45:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:45:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 15:45:47] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 15:45:47] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2022-06-11 15:45:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:45:47] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 11 ms returned sat
[2022-06-11 15:45:47] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-06-11 15:45:47] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-11 15:45:47] [INFO ] After 51ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2022-06-11 15:45:47] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2022-06-11 15:45:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2022-06-11 15:45:47] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-06-11 15:45:47] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 111/111 places, 139/139 transitions.
Graph (complete) has 327 edges and 111 vertex of which 110 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 110 transition count 137
Applied a total of 3 rules in 4 ms. Remains 110 /111 variables (removed 1) and now considering 137/139 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 110/111 places, 137/139 transitions.
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 461 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 627992 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 627992 steps, saw 279278 distinct states, run finished after 3004 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 137 rows 110 cols
[2022-06-11 15:45:50] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:45:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:45:50] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:45:50] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 15:45:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:45:51] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:45:51] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 15:45:51] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-11 15:45:51] [INFO ] After 59ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 15:45:51] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2022-06-11 15:45:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2022-06-11 15:45:51] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-06-11 15:45:51] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 40 ms.
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 110/110 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 137/137 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 110/110 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 110 cols
[2022-06-11 15:45:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:45:51] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 137 rows 110 cols
[2022-06-11 15:45:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:45:51] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-11 15:45:51] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2022-06-11 15:45:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 137 rows 110 cols
[2022-06-11 15:45:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:45:51] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 137/137 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 110 transition count 131
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 105 transition count 131
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 11 place count 105 transition count 114
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 45 place count 88 transition count 114
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 59 place count 81 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 61 place count 80 transition count 116
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 80 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 79 transition count 115
Applied a total of 63 rules in 14 ms. Remains 79 /110 variables (removed 31) and now considering 115/137 (removed 22) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 115 rows 79 cols
[2022-06-11 15:45:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:45:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:45:51] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:45:52] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 15:45:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 15:45:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 15:45:52] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 15:45:52] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2022-06-11 15:45:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-06-11 15:45:52] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-06-11 15:45:52] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-11 15:45:52] [INFO ] Flatten gal took : 5 ms
[2022-06-11 15:45:52] [INFO ] Flatten gal took : 3 ms
[2022-06-11 15:45:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4368467067438135381.gal : 1 ms
[2022-06-11 15:45:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14957576223666581705.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11222371377519948611;'/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/ReachabilityCardinality4368467067438135381.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14957576223666581705.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/ReachabilityCardinality14957576223666581705.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :28 after 37
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :37 after 123
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :123 after 232
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :232 after 368
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :368 after 2620
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2620 after 23938
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :23938 after 354220
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :354220 after 6.51835e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6.51835e+06 after 1.32087e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.32087e+08 after 2.00529e+09
Detected timeout of ITS tools.
[2022-06-11 15:46:07] [INFO ] Flatten gal took : 11 ms
[2022-06-11 15:46:07] [INFO ] Applying decomposition
[2022-06-11 15:46:07] [INFO ] Flatten gal took : 4 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/graph14387012322297149841.txt' '-o' '/tmp/graph14387012322297149841.bin' '-w' '/tmp/graph14387012322297149841.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14387012322297149841.bin' '-l' '-1' '-v' '-w' '/tmp/graph14387012322297149841.weights' '-q' '0' '-e' '0.001'
[2022-06-11 15:46:07] [INFO ] Decomposing Gal with order
[2022-06-11 15:46:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 15:46:07] [INFO ] Removed a total of 75 redundant transitions.
[2022-06-11 15:46:07] [INFO ] Flatten gal took : 8 ms
[2022-06-11 15:46:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 2 ms.
[2022-06-11 15:46:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2687169824205636398.gal : 1 ms
[2022-06-11 15:46:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10853756876906551284.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11222371377519948611;'/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/ReachabilityCardinality2687169824205636398.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10853756876906551284.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality10853756876906551284.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 16
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :16 after 28
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :28 after 36
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :36 after 50
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 54
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :54 after 176
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :282 after 969
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3061 after 6456
Reachability property apf2 is true.
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 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\_mod\_flat,32952,1.58297,46504,1361,1509,37400,29850,308,233129,186,213840,0
Total reachable state count : 32952

Verifying 2 reachability properties.
Reachability property apf1 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
apf1,7,1.58524,46504,51,60,37400,29850,330,233129,194,213840,0
Reachability property apf2 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
apf2,7,1.58573,46504,51,60,37400,29850,330,233129,194,213840,0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p0))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND p1 p2 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0))), (F p0)]
Knowledge based reduction with 11 factoid took 613 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 118 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 94 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 139/139 transitions.
Applied a total of 0 rules in 8 ms. Remains 111 /111 variables (removed 0) and now considering 139/139 (removed 0) transitions.
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:46:09] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:46:09] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:46:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:46:09] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-11 15:46:10] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2022-06-11 15:46:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:46:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:46:10] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/111 places, 139/139 transitions.
Computed a total of 27 stabilizing places and 31 stable transitions
Computed a total of 27 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND p0 p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2004523 steps, run timeout after 3001 ms. (steps per millisecond=667 ) properties seen :{1=1}
Probabilistic random walk after 2004523 steps, saw 868712 distinct states, run finished after 3001 ms. (steps per millisecond=667 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:46:13] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:46:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:46:13] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 15:46:13] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:46:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:46:13] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 15:46:13] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:46:13] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-11 15:46:13] [INFO ] After 29ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:46:13] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-06-11 15:46:13] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 111/111 places, 139/139 transitions.
Graph (complete) has 327 edges and 111 vertex of which 110 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 110 transition count 137
Applied a total of 3 rules in 4 ms. Remains 110 /111 variables (removed 1) and now considering 137/139 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 110/111 places, 137/139 transitions.
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2122870 steps, run timeout after 3001 ms. (steps per millisecond=707 ) properties seen :{}
Probabilistic random walk after 2122870 steps, saw 918494 distinct states, run finished after 3001 ms. (steps per millisecond=707 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 137 rows 110 cols
[2022-06-11 15:46:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:46:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:46:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:46:17] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:46:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:46:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:46:17] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:46:17] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-11 15:46:17] [INFO ] After 26ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:46:17] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
[2022-06-11 15:46:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2022-06-11 15:46:17] [INFO ] After 108ms 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 15:46:17] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 110/110 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 110 /110 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 137/137 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 110/110 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 110 cols
[2022-06-11 15:46:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:46:17] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 137 rows 110 cols
[2022-06-11 15:46:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 15:46:17] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-11 15:46:17] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2022-06-11 15:46:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 137 rows 110 cols
[2022-06-11 15:46:17] [INFO ] Computed 4 place invariants in 9 ms
[2022-06-11 15:46:17] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 137/137 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 110 transition count 131
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 105 transition count 131
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 11 place count 105 transition count 114
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 45 place count 88 transition count 114
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 59 place count 81 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 61 place count 80 transition count 116
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 80 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 79 transition count 115
Applied a total of 63 rules in 7 ms. Remains 79 /110 variables (removed 31) and now considering 115/137 (removed 22) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 115 rows 79 cols
[2022-06-11 15:46:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:46:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:46:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 15:46:17] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:46:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:46:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:46:17] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:46:17] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-06-11 15:46:17] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:46:17] [INFO ] Flatten gal took : 6 ms
[2022-06-11 15:46:17] [INFO ] Flatten gal took : 3 ms
[2022-06-11 15:46:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11631910398319473667.gal : 0 ms
[2022-06-11 15:46:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14529475767245296302.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1535883993135888709;'/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/ReachabilityCardinality11631910398319473667.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14529475767245296302.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/ReachabilityCardinality14529475767245296302.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 123
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :123 after 232
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :232 after 368
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :368 after 2620
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2620 after 23938
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :23938 after 354220
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :354220 after 6.51835e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.51835e+06 after 1.32087e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.32087e+08 after 2.00529e+09
Detected timeout of ITS tools.
[2022-06-11 15:46:32] [INFO ] Flatten gal took : 4 ms
[2022-06-11 15:46:32] [INFO ] Applying decomposition
[2022-06-11 15:46:32] [INFO ] Flatten gal took : 3 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/graph9274026355461445085.txt' '-o' '/tmp/graph9274026355461445085.bin' '-w' '/tmp/graph9274026355461445085.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9274026355461445085.bin' '-l' '-1' '-v' '-w' '/tmp/graph9274026355461445085.weights' '-q' '0' '-e' '0.001'
[2022-06-11 15:46:32] [INFO ] Decomposing Gal with order
[2022-06-11 15:46:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 15:46:32] [INFO ] Removed a total of 91 redundant transitions.
[2022-06-11 15:46:32] [INFO ] Flatten gal took : 9 ms
[2022-06-11 15:46:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 2 ms.
[2022-06-11 15:46:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality65274416378717478.gal : 1 ms
[2022-06-11 15:46:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12865252595553541085.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1535883993135888709;'/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/ReachabilityCardinality65274416378717478.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12865252595553541085.prop' '--nowitness'

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...297
Loading property file /tmp/ReachabilityCardinality12865252595553541085.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5 after 13
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13 after 17
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :17 after 37
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :37 after 192
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :282 after 1364
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3047 after 6645
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8383 after 21600
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 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\_mod\_flat,79939,2.60978,71760,1866,1436,79440,33350,293,324040,157,283167,0
Total reachable state count : 79939

Verifying 1 reachability properties.
Reachability property apf0 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
apf0,1,2.61433,72024,32,35,79440,33350,314,324040,166,283167,0
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND p0 p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2))]
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 97 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 114 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 22536 reset in 127 ms.
Product exploration explored 100000 steps with 22391 reset in 126 ms.
Built C files in :
/tmp/ltsmin5891195366452640261
[2022-06-11 15:46:36] [INFO ] Computing symmetric may disable matrix : 139 transitions.
[2022-06-11 15:46:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:46:36] [INFO ] Computing symmetric may enable matrix : 139 transitions.
[2022-06-11 15:46:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:46:36] [INFO ] Computing Do-Not-Accords matrix : 139 transitions.
[2022-06-11 15:46:36] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:46:36] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5891195366452640261
Running compilation step : cd /tmp/ltsmin5891195366452640261;'/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 293 ms.
Running link step : cd /tmp/ltsmin5891195366452640261;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5891195366452640261;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3083651740462176885.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 139/139 transitions.
Applied a total of 0 rules in 9 ms. Remains 111 /111 variables (removed 0) and now considering 139/139 (removed 0) transitions.
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:46:51] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:46:51] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:46:51] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:46:51] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-11 15:46:51] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2022-06-11 15:46:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 139 rows 111 cols
[2022-06-11 15:46:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:46:51] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/111 places, 139/139 transitions.
Built C files in :
/tmp/ltsmin13469109186093292005
[2022-06-11 15:46:51] [INFO ] Computing symmetric may disable matrix : 139 transitions.
[2022-06-11 15:46:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:46:51] [INFO ] Computing symmetric may enable matrix : 139 transitions.
[2022-06-11 15:46:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:46:51] [INFO ] Computing Do-Not-Accords matrix : 139 transitions.
[2022-06-11 15:46:51] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:46:51] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13469109186093292005
Running compilation step : cd /tmp/ltsmin13469109186093292005;'/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 290 ms.
Running link step : cd /tmp/ltsmin13469109186093292005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13469109186093292005;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12351877505063840236.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 15:47:06] [INFO ] Flatten gal took : 5 ms
[2022-06-11 15:47:06] [INFO ] Flatten gal took : 5 ms
[2022-06-11 15:47:06] [INFO ] Time to serialize gal into /tmp/LTL14770349221233452892.gal : 20 ms
[2022-06-11 15:47:06] [INFO ] Time to serialize properties into /tmp/LTL891960321290319775.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/LTL14770349221233452892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL891960321290319775.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/LTL1477034...266
Read 1 LTL properties
Checking formula 0 : !((X(F(!((F("((s1>=1)&&(l2225>=1))"))U(((G("(((s1>=1)&&(l2245>=1))&&(!((s1>=1)&&(l303>=1))))"))&&("(s1>=1)"))&&("(l2225>=1)")))))))
Formula 0 simplified : !XF!(F"((s1>=1)&&(l2225>=1))" U ("(l2225>=1)" & "(s1>=1)" & G"(((s1>=1)&&(l2245>=1))&&(!((s1>=1)&&(l303>=1))))"))
Detected timeout of ITS tools.
[2022-06-11 15:47:21] [INFO ] Flatten gal took : 9 ms
[2022-06-11 15:47:22] [INFO ] Applying decomposition
[2022-06-11 15:47:22] [INFO ] Flatten gal took : 4 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/graph16666220582177298894.txt' '-o' '/tmp/graph16666220582177298894.bin' '-w' '/tmp/graph16666220582177298894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16666220582177298894.bin' '-l' '-1' '-v' '-w' '/tmp/graph16666220582177298894.weights' '-q' '0' '-e' '0.001'
[2022-06-11 15:47:22] [INFO ] Decomposing Gal with order
[2022-06-11 15:47:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 15:47:22] [INFO ] Removed a total of 129 redundant transitions.
[2022-06-11 15:47:22] [INFO ] Flatten gal took : 12 ms
[2022-06-11 15:47:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 143 labels/synchronizations in 3 ms.
[2022-06-11 15:47:22] [INFO ] Time to serialize gal into /tmp/LTL14401646539841558767.gal : 2 ms
[2022-06-11 15:47:22] [INFO ] Time to serialize properties into /tmp/LTL12836375512948106007.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/LTL14401646539841558767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12836375512948106007.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/LTL1440164...247
Read 1 LTL properties
Checking formula 0 : !((X(F(!((F("((i7.u0.s1>=1)&&(i6.u19.l2225>=1))"))U(((G("(((i7.u0.s1>=1)&&(i0.u9.l2245>=1))&&(!((i7.u0.s1>=1)&&(i5.u6.l303>=1))))"))&&...202
Formula 0 simplified : !XF!(F"((i7.u0.s1>=1)&&(i6.u19.l2225>=1))" U ("(i6.u19.l2225>=1)" & "(i7.u0.s1>=1)" & G"(((i7.u0.s1>=1)&&(i0.u9.l2245>=1))&&(!((i7.u...186
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11367769568591743001
[2022-06-11 15:47:37] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11367769568591743001
Running compilation step : cd /tmp/ltsmin11367769568591743001;'/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 235 ms.
Running link step : cd /tmp/ltsmin11367769568591743001;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11367769568591743001;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(!(<>((LTLAPp0==true)) U ([]((LTLAPp2==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 finished in 130128 ms.
[2022-06-11 15:47:52] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6600958202457345117
[2022-06-11 15:47:52] [INFO ] Computing symmetric may disable matrix : 388 transitions.
[2022-06-11 15:47:52] [INFO ] Applying decomposition
[2022-06-11 15:47:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:47:52] [INFO ] Computing symmetric may enable matrix : 388 transitions.
[2022-06-11 15:47:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:47:52] [INFO ] Computing Do-Not-Accords matrix : 388 transitions.
[2022-06-11 15:47:52] [INFO ] Flatten gal took : 37 ms
[2022-06-11 15:47:52] [INFO ] Computation of Completed DNA matrix. took 23 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/graph10030904605874164114.txt' '-o' '/tmp/graph10030904605874164114.bin' '-w' '/tmp/graph10030904605874164114.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10030904605874164114.bin' '-l' '-1' '-v' '-w' '/tmp/graph10030904605874164114.weights' '-q' '0' '-e' '0.001'
[2022-06-11 15:47:52] [INFO ] Decomposing Gal with order
[2022-06-11 15:47:52] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6600958202457345117
[2022-06-11 15:47:52] [INFO ] Rewriting arrays to variables to allow decomposition.
Running compilation step : cd /tmp/ltsmin6600958202457345117;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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 15:47:52] [INFO ] Removed a total of 380 redundant transitions.
[2022-06-11 15:47:52] [INFO ] Flatten gal took : 43 ms
[2022-06-11 15:47:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 321 labels/synchronizations in 5 ms.
[2022-06-11 15:47:52] [INFO ] Time to serialize gal into /tmp/LTLFireability18306780034074985497.gal : 17 ms
[2022-06-11 15:47:52] [INFO ] Time to serialize properties into /tmp/LTLFireability18079677960915979594.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/LTLFireability18306780034074985497.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18079677960915979594.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...269
Read 2 LTL properties
Checking formula 0 : !((X(G(X(F(X("((i1.u2.s1<1)||(u0.l2240<1))")))))))
Formula 0 simplified : !XGXFX"((i1.u2.s1<1)||(u0.l2240<1))"
Compilation finished in 1153 ms.
Running link step : cd /tmp/ltsmin6600958202457345117;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin6600958202457345117;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X(<>(X((LTLAPp0==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: 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( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: LTL layer: formula: X([](X(<>(X((LTLAPp0==true))))))
pins2lts-mc-linux64( 3/ 8), 0.008: "X([](X(<>(X((LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.008: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.061: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.129: DFS-FIFO for weak LTL, using special progress label 393
pins2lts-mc-linux64( 0/ 8), 0.129: There are 394 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.129: State length is 173, there are 391 groups
pins2lts-mc-linux64( 0/ 8), 0.129: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.129: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.129: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.129: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.136: ~1 levels ~960 states ~1944 transitions
pins2lts-mc-linux64( 7/ 8), 1.024: ~1 levels ~1920 states ~4792 transitions
pins2lts-mc-linux64( 7/ 8), 1.186: ~1 levels ~3840 states ~10072 transitions
pins2lts-mc-linux64( 1/ 8), 1.320: ~1 levels ~7680 states ~17232 transitions
pins2lts-mc-linux64( 1/ 8), 1.660: ~1 levels ~15360 states ~34768 transitions
pins2lts-mc-linux64( 1/ 8), 2.473: ~1 levels ~30720 states ~69376 transitions
pins2lts-mc-linux64( 1/ 8), 4.365: ~1 levels ~61440 states ~144160 transitions
pins2lts-mc-linux64( 1/ 8), 6.165: ~1 levels ~122880 states ~285160 transitions
pins2lts-mc-linux64( 1/ 8), 10.921: ~1 levels ~245760 states ~582880 transitions
pins2lts-mc-linux64( 4/ 8), 14.524: ~8 levels ~491520 states ~1211600 transitions
pins2lts-mc-linux64( 3/ 8), 23.991: ~8 levels ~983040 states ~2489688 transitions
pins2lts-mc-linux64( 3/ 8), 30.692: ~8 levels ~1966080 states ~5139760 transitions
pins2lts-mc-linux64( 5/ 8), 44.215: ~1 levels ~3932160 states ~9484744 transitions
pins2lts-mc-linux64( 3/ 8), 69.987: ~8 levels ~7864320 states ~20228008 transitions
pins2lts-mc-linux64( 5/ 8), 122.197: ~10 levels ~15728640 states ~39923112 transitions
pins2lts-mc-linux64( 5/ 8), 261.020: ~10 levels ~31457280 states ~82392720 transitions
pins2lts-mc-linux64( 5/ 8), 484.562: ~10 levels ~62914560 states ~168236624 transitions
pins2lts-mc-linux64( 0/ 8), 979.120: ~10 levels ~125829120 states ~336354272 transitions
pins2lts-mc-linux64( 5/ 8), 1047.494: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1047.674:
pins2lts-mc-linux64( 0/ 8), 1047.674: mean standard work distribution: 5.1% (states) 5.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 1047.674:
pins2lts-mc-linux64( 0/ 8), 1047.674: Explored 125019345 states 333449728 transitions, fanout: 2.667
pins2lts-mc-linux64( 0/ 8), 1047.674: Total exploration time 1047.530 sec (1047.350 sec minimum, 1047.419 sec on average)
pins2lts-mc-linux64( 0/ 8), 1047.674: States per second: 119347, Transitions per second: 318320
pins2lts-mc-linux64( 0/ 8), 1047.674:
pins2lts-mc-linux64( 0/ 8), 1047.674: Progress states detected: 133638212
pins2lts-mc-linux64( 0/ 8), 1047.674: Redundant explorations: -6.8531
pins2lts-mc-linux64( 0/ 8), 1047.674:
pins2lts-mc-linux64( 0/ 8), 1047.674: Queue width: 8B, total height: 18844769, memory: 143.77MB
pins2lts-mc-linux64( 0/ 8), 1047.674: Tree memory: 1038.7MB, 8.1 B/state, compr.: 1.2%
pins2lts-mc-linux64( 0/ 8), 1047.674: Tree fill ratio (roots/leafs): 99.0%/5.0%
pins2lts-mc-linux64( 0/ 8), 1047.674: Stored 463 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1047.674: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1047.674: Est. total memory use: 1182.5MB (~1167.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6600958202457345117;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X(<>(X((LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6600958202457345117;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X(<>(X((LTLAPp0==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 16:10:36] [INFO ] Flatten gal took : 11 ms
[2022-06-11 16:10:36] [INFO ] Time to serialize gal into /tmp/LTLFireability12698986152593427844.gal : 1 ms
[2022-06-11 16:10:36] [INFO ] Time to serialize properties into /tmp/LTLFireability165342409403600374.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/LTLFireability12698986152593427844.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability165342409403600374.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...288
Read 2 LTL properties
Checking formula 0 : !((X(G(X(F(X("((s1<1)||(l2240<1))")))))))
Formula 0 simplified : !XGXFX"((s1<1)||(l2240<1))"
Detected timeout of ITS tools.
[2022-06-11 16:33:45] [INFO ] Flatten gal took : 247 ms
[2022-06-11 16:33:46] [INFO ] Input system was already deterministic with 388 transitions.
[2022-06-11 16:33:46] [INFO ] Transformed 172 places.
[2022-06-11 16:33:46] [INFO ] Transformed 388 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 16:33:46] [INFO ] Time to serialize gal into /tmp/LTLFireability17291340263601288892.gal : 8 ms
[2022-06-11 16:33:46] [INFO ] Time to serialize properties into /tmp/LTLFireability5400649122977234433.ltl : 3 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/LTLFireability17291340263601288892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5400649122977234433.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(X(F(X("((s1<1)||(l2240<1))")))))))
Formula 0 simplified : !XGXFX"((s1<1)||(l2240<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="SieveSingleMsgMbox-PT-d2m36"
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 SieveSingleMsgMbox-PT-d2m36, 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-165472283000964"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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