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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.6K Jun 7 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 7 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 17:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Jun 7 17:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 7 17:05 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-d2m64-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654964712013

Running Version 202205111006
[2022-06-11 16:25:13] [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 16:25:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 16:25:13] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2022-06-11 16:25:13] [INFO ] Transformed 2398 places.
[2022-06-11 16:25:13] [INFO ] Transformed 1954 transitions.
[2022-06-11 16:25:13] [INFO ] Parsed PT model containing 2398 places and 1954 transitions in 326 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1984 places in 17 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 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 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 951 place count 291 transition count 693
Iterating global reduction 1 with 98 rules applied. Total rules applied 1049 place count 291 transition count 693
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1059 place count 291 transition count 683
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 1130 place count 220 transition count 612
Iterating global reduction 2 with 71 rules applied. Total rules applied 1201 place count 220 transition count 612
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1236 place count 220 transition count 577
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1259 place count 197 transition count 552
Iterating global reduction 3 with 23 rules applied. Total rules applied 1282 place count 197 transition count 552
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 3 with 83 rules applied. Total rules applied 1365 place count 197 transition count 469
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1371 place count 191 transition count 459
Iterating global reduction 4 with 6 rules applied. Total rules applied 1377 place count 191 transition count 459
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1383 place count 185 transition count 453
Iterating global reduction 4 with 6 rules applied. Total rules applied 1389 place count 185 transition count 453
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1392 place count 182 transition count 449
Iterating global reduction 4 with 3 rules applied. Total rules applied 1395 place count 182 transition count 449
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1397 place count 180 transition count 447
Iterating global reduction 4 with 2 rules applied. Total rules applied 1399 place count 180 transition count 447
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1401 place count 178 transition count 445
Iterating global reduction 4 with 2 rules applied. Total rules applied 1403 place count 178 transition count 445
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1404 place count 177 transition count 444
Iterating global reduction 4 with 1 rules applied. Total rules applied 1405 place count 177 transition count 444
Applied a total of 1405 rules in 103 ms. Remains 177 /414 variables (removed 237) and now considering 444/1954 (removed 1510) transitions.
// Phase 1: matrix 444 rows 177 cols
[2022-06-11 16:25:13] [INFO ] Computed 5 place invariants in 25 ms
[2022-06-11 16:25:13] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 444 rows 177 cols
[2022-06-11 16:25:14] [INFO ] Computed 5 place invariants in 11 ms
[2022-06-11 16:25:14] [INFO ] State equation strengthened by 305 read => feed constraints.
[2022-06-11 16:25:14] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
// Phase 1: matrix 444 rows 177 cols
[2022-06-11 16:25:14] [INFO ] Computed 5 place invariants in 10 ms
[2022-06-11 16:25:15] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 177/414 places, 444/1954 transitions.
Finished structural reductions, in 1 iterations. Remains : 177/414 places, 444/1954 transitions.
Support contains 29 out of 177 places after structural reductions.
[2022-06-11 16:25:15] [INFO ] Flatten gal took : 58 ms
[2022-06-11 16:25:15] [INFO ] Flatten gal took : 32 ms
[2022-06-11 16:25:15] [INFO ] Input system was already deterministic with 444 transitions.
Support contains 28 out of 177 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2241 resets, run finished after 599 ms. (steps per millisecond=16 ) properties (out of 28) seen :2
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 63 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 239164 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{0=1, 3=1, 6=1, 7=1, 8=1, 10=1, 12=1, 15=1, 17=1, 18=1, 21=1, 22=1, 24=1}
Probabilistic random walk after 239164 steps, saw 108675 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :13
Running SMT prover for 13 properties.
// Phase 1: matrix 444 rows 177 cols
[2022-06-11 16:25:19] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-11 16:25:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:25:19] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2022-06-11 16:25:20] [INFO ] After 794ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-11 16:25:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:25:20] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 16:25:20] [INFO ] After 622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-06-11 16:25:20] [INFO ] State equation strengthened by 305 read => feed constraints.
[2022-06-11 16:25:22] [INFO ] After 1100ms SMT Verify possible using 305 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2022-06-11 16:25:22] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 3 ms to minimize.
[2022-06-11 16:25:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-06-11 16:25:22] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2022-06-11 16:25:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2022-06-11 16:25:23] [INFO ] After 2515ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 914 ms.
[2022-06-11 16:25:24] [INFO ] After 4216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 492 ms.
Support contains 13 out of 177 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 177/177 places, 444/444 transitions.
Graph (complete) has 721 edges and 177 vertex of which 176 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 176 transition count 442
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 163 transition count 319
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 163 transition count 319
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 41 place count 151 transition count 306
Iterating global reduction 1 with 12 rules applied. Total rules applied 53 place count 151 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 151 transition count 300
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 145 transition count 289
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 145 transition count 289
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 75 place count 145 transition count 285
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 144 transition count 284
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 144 transition count 284
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 143 transition count 283
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 143 transition count 283
Applied a total of 79 rules in 63 ms. Remains 143 /177 variables (removed 34) and now considering 283/444 (removed 161) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/177 places, 283/444 transitions.
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 464 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 433 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 270571 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{5=1, 8=1}
Probabilistic random walk after 270571 steps, saw 120681 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :2
Running SMT prover for 11 properties.
// Phase 1: matrix 283 rows 143 cols
[2022-06-11 16:25:29] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-11 16:25:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 16:25:29] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 16:25:30] [INFO ] After 470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-11 16:25:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:25:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 16:25:30] [INFO ] After 365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-06-11 16:25:30] [INFO ] State equation strengthened by 177 read => feed constraints.
[2022-06-11 16:25:31] [INFO ] After 557ms SMT Verify possible using 177 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-06-11 16:25:31] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 6 ms to minimize.
[2022-06-11 16:25:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-06-11 16:25:32] [INFO ] After 1593ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 680 ms.
[2022-06-11 16:25:32] [INFO ] After 2737ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 99 ms.
Support contains 12 out of 143 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 283/283 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 142 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 141 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 141 transition count 269
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 140 transition count 267
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 140 transition count 267
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 140 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 139 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 139 transition count 265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 138 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 138 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 137 transition count 263
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 137 transition count 263
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 22 place count 137 transition count 254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 136 transition count 253
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 136 transition count 253
Applied a total of 24 rules in 38 ms. Remains 136 /143 variables (removed 7) and now considering 253/283 (removed 30) transitions.
Finished structural reductions, in 1 iterations. Remains : 136/143 places, 253/283 transitions.
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 462 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 466 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 453 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 448 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 295463 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 295463 steps, saw 127612 distinct states, run finished after 3002 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 253 rows 136 cols
[2022-06-11 16:25:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 16:25:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 16:25:37] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 16:25:37] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-11 16:25:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:25:37] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 4 ms returned sat
[2022-06-11 16:25:37] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-06-11 16:25:37] [INFO ] State equation strengthened by 152 read => feed constraints.
[2022-06-11 16:25:38] [INFO ] After 525ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-06-11 16:25:39] [INFO ] After 1268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 740 ms.
[2022-06-11 16:25:39] [INFO ] After 2403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 193 ms.
Support contains 12 out of 136 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 136/136 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 136 /136 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 136/136 places, 253/253 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 136/136 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 136 /136 variables (removed 0) and now considering 253/253 (removed 0) transitions.
// Phase 1: matrix 253 rows 136 cols
[2022-06-11 16:25:40] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 16:25:40] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 253 rows 136 cols
[2022-06-11 16:25:40] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 16:25:40] [INFO ] State equation strengthened by 152 read => feed constraints.
[2022-06-11 16:25:40] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2022-06-11 16:25:40] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 253 rows 136 cols
[2022-06-11 16:25:40] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-11 16:25:40] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/136 places, 253/253 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 136 transition count 246
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 130 transition count 246
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 130 transition count 229
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 113 transition count 229
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 63 place count 105 transition count 221
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 65 place count 104 transition count 230
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 104 transition count 228
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 102 transition count 228
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 102 transition count 228
Applied a total of 70 rules in 45 ms. Remains 102 /136 variables (removed 34) and now considering 228/253 (removed 25) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 228 rows 102 cols
[2022-06-11 16:25:40] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 16:25:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:25:40] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 16:25:41] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-11 16:25:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:25:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 16:25:41] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-06-11 16:25:41] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2022-06-11 16:25:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2022-06-11 16:25:41] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2022-06-11 16:25:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2022-06-11 16:25:42] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2022-06-11 16:25:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-06-11 16:25:42] [INFO ] After 850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 297 ms.
[2022-06-11 16:25:42] [INFO ] After 1218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2022-06-11 16:25:42] [INFO ] Flatten gal took : 14 ms
[2022-06-11 16:25:42] [INFO ] Flatten gal took : 13 ms
[2022-06-11 16:25:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3902815285875468398.gal : 2 ms
[2022-06-11 16:25:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13613923604563510548.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11114761536407623024;'/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/ReachabilityCardinality3902815285875468398.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13613923604563510548.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/ReachabilityCardinality13613923604563510548.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :28 after 35
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :35 after 71
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :71 after 174
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :174 after 232
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :232 after 944
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :944 after 3854
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :3854 after 43960
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :43960 after 1.05702e+06
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :1.05702e+06 after 5.24951e+07
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :5.24951e+07 after 4.16892e+09
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :4.16892e+09 after 3.11013e+11
Detected timeout of ITS tools.
[2022-06-11 16:25:57] [INFO ] Flatten gal took : 13 ms
[2022-06-11 16:25:57] [INFO ] Applying decomposition
[2022-06-11 16:25:57] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8903188783529089583.txt' '-o' '/tmp/graph8903188783529089583.bin' '-w' '/tmp/graph8903188783529089583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8903188783529089583.bin' '-l' '-1' '-v' '-w' '/tmp/graph8903188783529089583.weights' '-q' '0' '-e' '0.001'
[2022-06-11 16:25:57] [INFO ] Decomposing Gal with order
[2022-06-11 16:25:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 16:25:57] [INFO ] Removed a total of 59 redundant transitions.
[2022-06-11 16:25:57] [INFO ] Flatten gal took : 54 ms
[2022-06-11 16:25:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 4 ms.
[2022-06-11 16:25:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15039130589790515327.gal : 6 ms
[2022-06-11 16:25:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality174449644088850333.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11114761536407623024;'/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/ReachabilityCardinality15039130589790515327.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality174449644088850333.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...298
Loading property file /tmp/ReachabilityCardinality174449644088850333.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :7 after 12
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :12 after 23
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :23 after 27
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :27 after 44
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :44 after 86
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :86 after 174
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :174 after 174
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :178 after 218
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :626 after 1133
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :3430 after 5013
Reachability property AtomicPropp27 is true.
Reachability property AtomicPropp2 is true.
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :13253 after 16557
Reachability property AtomicPropp25 is true.
Reachability property AtomicPropp22 is true.
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :18221 after 34377
Reachability property AtomicPropp21 is true.
Reachability property AtomicPropp15 is true.
Reachability property AtomicPropp11 is true.
Reachability property AtomicPropp5 is true.
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :62847 after 75527
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :98365 after 109941
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :137661 after 180822
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :414085 after 544038
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :1.16822e+06 after 1.57061e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14535836311539329939
[2022-06-11 16:26:12] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14535836311539329939
Running compilation step : cd /tmp/ltsmin14535836311539329939;'/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 408 ms.
Running link step : cd /tmp/ltsmin14535836311539329939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14535836311539329939;'/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' 'AtomicPropp1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((X(p0)&&F((F(p1) U p2))))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 444/444 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 154 transition count 214
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 154 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 154 transition count 213
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 68 place count 133 transition count 191
Iterating global reduction 1 with 21 rules applied. Total rules applied 89 place count 133 transition count 191
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 98 place count 133 transition count 182
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 110 place count 121 transition count 160
Iterating global reduction 2 with 12 rules applied. Total rules applied 122 place count 121 transition count 160
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 131 place count 121 transition count 151
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 118 transition count 148
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 118 transition count 148
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 140 place count 115 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 143 place count 115 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 144 place count 114 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 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 147 place count 114 transition count 142
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 113 transition count 141
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 113 transition count 141
Applied a total of 149 rules in 23 ms. Remains 113 /177 variables (removed 64) and now considering 141/444 (removed 303) transitions.
// Phase 1: matrix 141 rows 113 cols
[2022-06-11 16:26:28] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 16:26:28] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 141 rows 113 cols
[2022-06-11 16:26:28] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 16:26:28] [INFO ] State equation strengthened by 62 read => feed constraints.
[2022-06-11 16:26:28] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
// Phase 1: matrix 141 rows 113 cols
[2022-06-11 16:26:28] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:26:28] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/177 places, 141/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/177 places, 141/444 transitions.
Stuttering acceptance computed with spot in 501 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s1 1) (GEQ s38 1)) (AND (GEQ s1 1) (GEQ s108 1))), p0:(AND (GEQ s1 1) (GEQ s59 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 6 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-01 finished in 965 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X((X(p0)&&!(F(p1) U (X(p2)||p2)))))))'
Support contains 3 out of 177 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 444/444 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 155 transition count 227
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 155 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 155 transition count 226
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 65 place count 135 transition count 205
Iterating global reduction 1 with 20 rules applied. Total rules applied 85 place count 135 transition count 205
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 95 place count 135 transition count 195
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 106 place count 124 transition count 175
Iterating global reduction 2 with 11 rules applied. Total rules applied 117 place count 124 transition count 175
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 125 place count 124 transition count 167
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 122 transition count 165
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 122 transition count 165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 120 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 120 transition count 163
Applied a total of 133 rules in 7 ms. Remains 120 /177 variables (removed 57) and now considering 163/444 (removed 281) transitions.
// Phase 1: matrix 163 rows 120 cols
[2022-06-11 16:26:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:26:29] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 163 rows 120 cols
[2022-06-11 16:26:29] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:26:29] [INFO ] State equation strengthened by 80 read => feed constraints.
[2022-06-11 16:26:29] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
// Phase 1: matrix 163 rows 120 cols
[2022-06-11 16:26:29] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:26:29] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/177 places, 163/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/177 places, 163/444 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(OR p2 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (GEQ s1 1) (GEQ s62 1)), p0:(OR (LT s1 1) (LT s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22411 reset in 279 ms.
Product exploration explored 100000 steps with 22306 reset in 192 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 p2) p0), (X (NOT p2)), (X (X (AND (NOT p2) p0))), true, (X (X (NOT (OR p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[true, (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 2239 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 444 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Finished probabilistic random walk after 19467 steps, run visited all 2 properties in 132 ms. (steps per millisecond=147 )
Probabilistic random walk after 19467 steps, saw 9668 distinct states, run finished after 132 ms. (steps per millisecond=147 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (X (AND (NOT p2) p0))), true, (X (X (NOT (OR p2 (NOT p0)))))]
False Knowledge obtained : [(F (OR (NOT p0) p2)), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 126 ms :[true, (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2)]
Stuttering acceptance computed with spot in 114 ms :[true, (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2)]
Support contains 3 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, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 163/163 (removed 0) transitions.
// Phase 1: matrix 163 rows 120 cols
[2022-06-11 16:26:31] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 16:26:31] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 163 rows 120 cols
[2022-06-11 16:26:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:26:31] [INFO ] State equation strengthened by 80 read => feed constraints.
[2022-06-11 16:26:31] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
// Phase 1: matrix 163 rows 120 cols
[2022-06-11 16:26:31] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:26:31] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 163/163 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 : [(AND p0 (NOT p2)), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[true, (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 2261 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Finished probabilistic random walk after 19467 steps, run visited all 2 properties in 142 ms. (steps per millisecond=137 )
Probabilistic random walk after 19467 steps, saw 9668 distinct states, run finished after 143 ms. (steps per millisecond=136 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p2)), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : [(F (OR (NOT p0) p2)), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[true, (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2)]
Stuttering acceptance computed with spot in 104 ms :[true, (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2)]
Stuttering acceptance computed with spot in 144 ms :[true, (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2)]
Product exploration explored 100000 steps with 22491 reset in 148 ms.
Product exploration explored 100000 steps with 22527 reset in 215 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 120 ms :[true, (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2)]
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 163/163 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 119 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 119 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 118 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 118 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 117 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 117 transition count 147
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 117 transition count 146
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 116 transition count 145
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 116 transition count 145
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 115 transition count 144
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 115 transition count 144
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 114 transition count 143
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 114 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 114 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 113 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 113 transition count 140
Applied a total of 17 rules in 35 ms. Remains 113 /120 variables (removed 7) and now considering 140/163 (removed 23) transitions.
[2022-06-11 16:26:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 140 rows 113 cols
[2022-06-11 16:26:33] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:26:33] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/120 places, 140/163 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/120 places, 140/163 transitions.
Product exploration explored 100000 steps with 22601 reset in 512 ms.
Product exploration explored 100000 steps with 22583 reset in 386 ms.
Built C files in :
/tmp/ltsmin17806154318793854035
[2022-06-11 16:26:34] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17806154318793854035
Running compilation step : cd /tmp/ltsmin17806154318793854035;'/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 254 ms.
Running link step : cd /tmp/ltsmin17806154318793854035;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin17806154318793854035;'/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/stateBased14213063838484281653.hoa' '--buchi-type=spotba'
LTSmin run took 4408 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-02 finished in 10219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 444/444 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 153 transition count 212
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 153 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 153 transition count 211
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 71 place count 131 transition count 188
Iterating global reduction 1 with 22 rules applied. Total rules applied 93 place count 131 transition count 188
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 102 place count 131 transition count 179
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 115 place count 118 transition count 156
Iterating global reduction 2 with 13 rules applied. Total rules applied 128 place count 118 transition count 156
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 138 place count 118 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 142 place count 114 transition count 142
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 114 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 150 place count 110 transition count 138
Iterating global reduction 3 with 4 rules applied. Total rules applied 154 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 156 place count 108 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 158 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 160 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 162 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 105 transition count 129
Applied a total of 166 rules in 21 ms. Remains 105 /177 variables (removed 72) and now considering 129/444 (removed 315) transitions.
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:26:39] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 16:26:39] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:26:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:26:39] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 16:26:39] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:26:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:26:39] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/177 places, 129/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/177 places, 129/444 transitions.
Stuttering acceptance computed with spot in 389 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s100 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 6 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-03 finished in 752 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (X(p0) U !F(p1))))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 444/444 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 153 transition count 200
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 153 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 153 transition count 199
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 71 place count 131 transition count 177
Iterating global reduction 1 with 22 rules applied. Total rules applied 93 place count 131 transition count 177
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 102 place count 131 transition count 168
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 116 place count 117 transition count 143
Iterating global reduction 2 with 14 rules applied. Total rules applied 130 place count 117 transition count 143
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 141 place count 117 transition count 132
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 146 place count 112 transition count 127
Iterating global reduction 3 with 5 rules applied. Total rules applied 151 place count 112 transition count 127
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 156 place count 107 transition count 122
Iterating global reduction 3 with 5 rules applied. Total rules applied 161 place count 107 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 163 place count 105 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 165 place count 105 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 167 place count 105 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 169 place count 103 transition count 116
Iterating global reduction 4 with 2 rules applied. Total rules applied 171 place count 103 transition count 116
Applied a total of 171 rules in 33 ms. Remains 103 /177 variables (removed 74) and now considering 116/444 (removed 328) transitions.
// Phase 1: matrix 116 rows 103 cols
[2022-06-11 16:26:40] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:26:40] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 116 rows 103 cols
[2022-06-11 16:26:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:26:40] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-11 16:26:40] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2022-06-11 16:26:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 116 rows 103 cols
[2022-06-11 16:26:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:26:40] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/177 places, 116/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/177 places, 116/444 transitions.
Stuttering acceptance computed with spot in 193 ms :[p1, (NOT p0), (AND p1 (NOT p0)), p1, true, (AND p1 p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s48 1)), p0:(AND (GEQ s29 1) (GEQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 22523 reset in 242 ms.
Product exploration explored 100000 steps with 22467 reset in 216 ms.
Computed a total of 25 stabilizing places and 29 stable transitions
Computed a total of 25 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 525 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 172 ms :[p1, (NOT p0), (AND (NOT p0) p1), p1, true, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 463 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1008 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1010 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 116 rows 103 cols
[2022-06-11 16:26:42] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:26:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:26:42] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 16:26:42] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-06-11 16:26:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:26:42] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 16:26:42] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-06-11 16:26:42] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-11 16:26:42] [INFO ] After 35ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-06-11 16:26:42] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
[2022-06-11 16:26:42] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2022-06-11 16:26:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2022-06-11 16:26:42] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-06-11 16:26:42] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 116/116 transitions.
Graph (complete) has 294 edges and 103 vertex of which 102 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 102 transition count 114
Applied a total of 3 rules in 11 ms. Remains 102 /103 variables (removed 1) and now considering 114/116 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 102/103 places, 114/116 transitions.
Incomplete random walk after 10000 steps, including 2243 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 1031 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1058 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Finished probabilistic random walk after 4068 steps, run visited all 2 properties in 24 ms. (steps per millisecond=169 )
Probabilistic random walk after 4068 steps, saw 2065 distinct states, run finished after 25 ms. (steps per millisecond=162 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 15 factoid took 823 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 142 ms :[p1, (NOT p0), p1, p1, true]
Stuttering acceptance computed with spot in 421 ms :[p1, (NOT p0), p1, p1, true]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 103 cols
[2022-06-11 16:26:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:26:44] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 116 rows 103 cols
[2022-06-11 16:26:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:26:44] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-11 16:26:44] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 103 cols
[2022-06-11 16:26:44] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-11 16:26:44] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 116/116 transitions.
Computed a total of 25 stabilizing places and 29 stable transitions
Computed a total of 25 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 442 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[p1, (NOT p0), p1, p1, true]
Incomplete random walk after 10000 steps, including 2221 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 1014 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 116 rows 103 cols
[2022-06-11 16:26:45] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:26:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:26:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 16:26:45] [INFO ] After 29ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 16:26:45] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-11 16:26:45] [INFO ] After 14ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 16:26:45] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 16:26:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:26:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 16:26:45] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 16:26:45] [INFO ] After 12ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 16:26:45] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2022-06-11 16:26:45] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
[2022-06-11 16:26:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2022-06-11 16:26:45] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-11 16:26:45] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 116/116 transitions.
Graph (complete) has 294 edges and 103 vertex of which 102 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 102 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 101 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 101 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 100 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 100 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 99 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 99 transition count 109
Applied a total of 9 rules in 13 ms. Remains 99 /103 variables (removed 4) and now considering 109/116 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 99/103 places, 109/116 transitions.
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1025 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4068 steps, run visited all 1 properties in 9 ms. (steps per millisecond=452 )
Probabilistic random walk after 4068 steps, saw 2065 distinct states, run finished after 9 ms. (steps per millisecond=452 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 8 factoid took 393 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[p1, (NOT p0), p1, p1, true]
Stuttering acceptance computed with spot in 138 ms :[p1, (NOT p0), p1, p1, true]
Stuttering acceptance computed with spot in 128 ms :[p1, (NOT p0), p1, p1, true]
Product exploration explored 100000 steps with 22532 reset in 123 ms.
Product exploration explored 100000 steps with 22494 reset in 179 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 150 ms :[p1, (NOT p0), p1, p1, true]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2022-06-11 16:26:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 116 rows 103 cols
[2022-06-11 16:26:47] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 16:26:47] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 116/116 transitions.
Product exploration explored 100000 steps with 22405 reset in 133 ms.
Product exploration explored 100000 steps with 22413 reset in 139 ms.
Built C files in :
/tmp/ltsmin2602414317757661094
[2022-06-11 16:26:47] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2602414317757661094
Running compilation step : cd /tmp/ltsmin2602414317757661094;'/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 204 ms.
Running link step : cd /tmp/ltsmin2602414317757661094;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2602414317757661094;'/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/stateBased1825444604730871483.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 103 cols
[2022-06-11 16:27:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:27:02] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 116 rows 103 cols
[2022-06-11 16:27:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:27:02] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-11 16:27:02] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 103 cols
[2022-06-11 16:27:02] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 16:27:02] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 116/116 transitions.
Built C files in :
/tmp/ltsmin17819707155502749567
[2022-06-11 16:27:02] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17819707155502749567
Running compilation step : cd /tmp/ltsmin17819707155502749567;'/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 190 ms.
Running link step : cd /tmp/ltsmin17819707155502749567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17819707155502749567;'/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/stateBased2786746927459132563.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 16:27:18] [INFO ] Flatten gal took : 8 ms
[2022-06-11 16:27:18] [INFO ] Flatten gal took : 7 ms
[2022-06-11 16:27:18] [INFO ] Time to serialize gal into /tmp/LTL10300369998086629416.gal : 2 ms
[2022-06-11 16:27:18] [INFO ] Time to serialize properties into /tmp/LTL9594861493203857626.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/LTL10300369998086629416.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9594861493203857626.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/LTL1030036...267
Read 1 LTL properties
Checking formula 0 : !(((!("((p141>=1)&&(l1708>=1))"))U((X("((p141>=1)&&(l1708>=1))"))U(!(F("((s1>=1)&&(l222>=1))"))))))
Formula 0 simplified : !(!"((p141>=1)&&(l1708>=1))" U (X"((p141>=1)&&(l1708>=1))" U !F"((s1>=1)&&(l222>=1))"))
Detected timeout of ITS tools.
[2022-06-11 16:27:33] [INFO ] Flatten gal took : 8 ms
[2022-06-11 16:27:33] [INFO ] Applying decomposition
[2022-06-11 16:27:33] [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/graph13843005750869168673.txt' '-o' '/tmp/graph13843005750869168673.bin' '-w' '/tmp/graph13843005750869168673.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13843005750869168673.bin' '-l' '-1' '-v' '-w' '/tmp/graph13843005750869168673.weights' '-q' '0' '-e' '0.001'
[2022-06-11 16:27:33] [INFO ] Decomposing Gal with order
[2022-06-11 16:27:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 16:27:33] [INFO ] Removed a total of 100 redundant transitions.
[2022-06-11 16:27:33] [INFO ] Flatten gal took : 13 ms
[2022-06-11 16:27:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 4 ms.
[2022-06-11 16:27:33] [INFO ] Time to serialize gal into /tmp/LTL10405235601532908568.gal : 2 ms
[2022-06-11 16:27:33] [INFO ] Time to serialize properties into /tmp/LTL12803048186938215216.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/LTL10405235601532908568.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12803048186938215216.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/LTL1040523...247
Read 1 LTL properties
Checking formula 0 : !(((!("((i7.u19.p141>=1)&&(i7.u19.l1708>=1))"))U((X("((i7.u19.p141>=1)&&(i7.u19.l1708>=1))"))U(!(F("((i9.u0.s1>=1)&&(i9.u0.l222>=1))")...160
Formula 0 simplified : !(!"((i7.u19.p141>=1)&&(i7.u19.l1708>=1))" U (X"((i7.u19.p141>=1)&&(i7.u19.l1708>=1))" U !F"((i9.u0.s1>=1)&&(i9.u0.l222>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5322293826575385781
[2022-06-11 16:27:48] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5322293826575385781
Running compilation step : cd /tmp/ltsmin5322293826575385781;'/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 207 ms.
Running link step : cd /tmp/ltsmin5322293826575385781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5322293826575385781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(LTLAPp0==true) U (X((LTLAPp0==true)) U !<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-05 finished in 83510 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||p1)))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 444/444 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 154 transition count 225
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 154 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 154 transition count 224
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 68 place count 133 transition count 202
Iterating global reduction 1 with 21 rules applied. Total rules applied 89 place count 133 transition count 202
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 98 place count 133 transition count 193
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 110 place count 121 transition count 172
Iterating global reduction 2 with 12 rules applied. Total rules applied 122 place count 121 transition count 172
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 131 place count 121 transition count 163
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 135 place count 117 transition count 159
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 117 transition count 159
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 113 transition count 155
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 113 transition count 155
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 111 transition count 151
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 111 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 154 place count 111 transition count 148
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 156 place count 109 transition count 146
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 159 place count 108 transition count 145
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 108 transition count 145
Applied a total of 160 rules in 15 ms. Remains 108 /177 variables (removed 69) and now considering 145/444 (removed 299) transitions.
// Phase 1: matrix 145 rows 108 cols
[2022-06-11 16:28:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:28:03] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 145 rows 108 cols
[2022-06-11 16:28:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:28:03] [INFO ] State equation strengthened by 70 read => feed constraints.
[2022-06-11 16:28:04] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
// Phase 1: matrix 145 rows 108 cols
[2022-06-11 16:28:04] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-11 16:28:04] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/177 places, 145/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/177 places, 145/444 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s102 1)), p0:(AND (GEQ s1 1) (GEQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-06 finished in 507 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X(G(p0))||X(G((F(p1)||p0))))))))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 444/444 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 154 transition count 225
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 154 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 154 transition count 224
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 68 place count 133 transition count 202
Iterating global reduction 1 with 21 rules applied. Total rules applied 89 place count 133 transition count 202
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 98 place count 133 transition count 193
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 111 place count 120 transition count 170
Iterating global reduction 2 with 13 rules applied. Total rules applied 124 place count 120 transition count 170
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 134 place count 120 transition count 160
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 138 place count 116 transition count 156
Iterating global reduction 3 with 4 rules applied. Total rules applied 142 place count 116 transition count 156
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 146 place count 112 transition count 152
Iterating global reduction 3 with 4 rules applied. Total rules applied 150 place count 112 transition count 152
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 152 place count 110 transition count 148
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 110 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 157 place count 110 transition count 145
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 159 place count 108 transition count 143
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 108 transition count 143
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 162 place count 107 transition count 142
Iterating global reduction 4 with 1 rules applied. Total rules applied 163 place count 107 transition count 142
Applied a total of 163 rules in 28 ms. Remains 107 /177 variables (removed 70) and now considering 142/444 (removed 302) transitions.
// Phase 1: matrix 142 rows 107 cols
[2022-06-11 16:28:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:28:04] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 142 rows 107 cols
[2022-06-11 16:28:04] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 16:28:04] [INFO ] State equation strengthened by 69 read => feed constraints.
[2022-06-11 16:28:04] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2022-06-11 16:28:04] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 142 rows 107 cols
[2022-06-11 16:28:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:28:04] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/177 places, 142/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/177 places, 142/444 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s101 1)), p1:(OR (LT s1 1) (LT s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22513 reset in 155 ms.
Product exploration explored 100000 steps with 22560 reset in 135 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 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 1306 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2257 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1842247 steps, run timeout after 3001 ms. (steps per millisecond=613 ) properties seen :{0=1}
Probabilistic random walk after 1842247 steps, saw 878104 distinct states, run finished after 3001 ms. (steps per millisecond=613 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 142 rows 107 cols
[2022-06-11 16:28:09] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 16:28:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:28:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 16:28:09] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 107 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 142/142 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /107 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 107 cols
[2022-06-11 16:28:09] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 16:28:10] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 142 rows 107 cols
[2022-06-11 16:28:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:28:10] [INFO ] State equation strengthened by 69 read => feed constraints.
[2022-06-11 16:28:10] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2022-06-11 16:28:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 142 rows 107 cols
[2022-06-11 16:28:10] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:28:10] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 142/142 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 316 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 68 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2253 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 473 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17251 steps, run visited all 1 properties in 31 ms. (steps per millisecond=556 )
Probabilistic random walk after 17251 steps, saw 8767 distinct states, run finished after 31 ms. (steps per millisecond=556 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 346 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 60 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 22374 reset in 136 ms.
Product exploration explored 100000 steps with 22372 reset in 126 ms.
Built C files in :
/tmp/ltsmin8849786598650907380
[2022-06-11 16:28:11] [INFO ] Computing symmetric may disable matrix : 142 transitions.
[2022-06-11 16:28:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:28:11] [INFO ] Computing symmetric may enable matrix : 142 transitions.
[2022-06-11 16:28:11] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:28:11] [INFO ] Computing Do-Not-Accords matrix : 142 transitions.
[2022-06-11 16:28:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:28:11] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8849786598650907380
Running compilation step : cd /tmp/ltsmin8849786598650907380;'/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 286 ms.
Running link step : cd /tmp/ltsmin8849786598650907380;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8849786598650907380;'/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/stateBased5781884656620657969.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 142/142 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 106 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 105 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 105 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 105 transition count 128
Applied a total of 5 rules in 10 ms. Remains 105 /107 variables (removed 2) and now considering 128/142 (removed 14) transitions.
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 16:28:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:28:26] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 16:28:26] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 16:28:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 16:28:27] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2022-06-11 16:28:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 16:28:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:28:27] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/107 places, 128/142 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/107 places, 128/142 transitions.
Built C files in :
/tmp/ltsmin2724408473842481754
[2022-06-11 16:28:27] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2022-06-11 16:28:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:28:27] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2022-06-11 16:28:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:28:27] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2022-06-11 16:28:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:28:27] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2724408473842481754
Running compilation step : cd /tmp/ltsmin2724408473842481754;'/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 266 ms.
Running link step : cd /tmp/ltsmin2724408473842481754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2724408473842481754;'/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/stateBased14930007879346299640.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 16:28:42] [INFO ] Flatten gal took : 8 ms
[2022-06-11 16:28:42] [INFO ] Flatten gal took : 7 ms
[2022-06-11 16:28:42] [INFO ] Time to serialize gal into /tmp/LTL1854422540378781128.gal : 1 ms
[2022-06-11 16:28:42] [INFO ] Time to serialize properties into /tmp/LTL14384581439888203700.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/LTL1854422540378781128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14384581439888203700.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/LTL1854422...267
Read 1 LTL properties
Checking formula 0 : !((X(G(F((X(G("((s1>=1)&&(l2214>=1))")))||(X(G((F("((s1<1)||(l2238<1))"))||("((s1>=1)&&(l2214>=1))")))))))))
Formula 0 simplified : !XGF(XG"((s1>=1)&&(l2214>=1))" | XG("((s1>=1)&&(l2214>=1))" | F"((s1<1)||(l2238<1))"))
Detected timeout of ITS tools.
[2022-06-11 16:28:57] [INFO ] Flatten gal took : 12 ms
[2022-06-11 16:28:57] [INFO ] Applying decomposition
[2022-06-11 16:28:57] [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/graph11509506292218393197.txt' '-o' '/tmp/graph11509506292218393197.bin' '-w' '/tmp/graph11509506292218393197.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11509506292218393197.bin' '-l' '-1' '-v' '-w' '/tmp/graph11509506292218393197.weights' '-q' '0' '-e' '0.001'
[2022-06-11 16:28:57] [INFO ] Decomposing Gal with order
[2022-06-11 16:28:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 16:28:57] [INFO ] Removed a total of 104 redundant transitions.
[2022-06-11 16:28:57] [INFO ] Flatten gal took : 14 ms
[2022-06-11 16:28:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 4 ms.
[2022-06-11 16:28:57] [INFO ] Time to serialize gal into /tmp/LTL14410462045215310064.gal : 1 ms
[2022-06-11 16:28:57] [INFO ] Time to serialize properties into /tmp/LTL16621929884592172518.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/LTL14410462045215310064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16621929884592172518.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/LTL1441046...247
Read 1 LTL properties
Checking formula 0 : !((X(G(F((X(G("((u0.s1>=1)&&(u0.l2214>=1))")))||(X(G((F("((u0.s1<1)||(u0.l2238<1))"))||("((u0.s1>=1)&&(u0.l2214>=1))")))))))))
Formula 0 simplified : !XGF(XG"((u0.s1>=1)&&(u0.l2214>=1))" | XG("((u0.s1>=1)&&(u0.l2214>=1))" | F"((u0.s1<1)||(u0.l2238<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2257559387367124938
[2022-06-11 16:29:12] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2257559387367124938
Running compilation step : cd /tmp/ltsmin2257559387367124938;'/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 249 ms.
Running link step : cd /tmp/ltsmin2257559387367124938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2257559387367124938;'/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([]((LTLAPp0==true)))||X([]((<>((LTLAPp1==true))||(LTLAPp0==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-07 finished in 83540 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(F(X(p0))))||!p0))))'
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 444/444 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 153 transition count 212
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 153 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 153 transition count 211
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 71 place count 131 transition count 188
Iterating global reduction 1 with 22 rules applied. Total rules applied 93 place count 131 transition count 188
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 102 place count 131 transition count 179
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 115 place count 118 transition count 156
Iterating global reduction 2 with 13 rules applied. Total rules applied 128 place count 118 transition count 156
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 138 place count 118 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 142 place count 114 transition count 142
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 114 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 150 place count 110 transition count 138
Iterating global reduction 3 with 4 rules applied. Total rules applied 154 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 156 place count 108 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 158 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 160 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 162 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 105 transition count 129
Applied a total of 166 rules in 16 ms. Remains 105 /177 variables (removed 72) and now considering 129/444 (removed 315) transitions.
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:29:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:29:27] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:29:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:29:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 16:29:28] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:29:28] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:29:28] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/177 places, 129/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/177 places, 129/444 transitions.
Stuttering acceptance computed with spot in 143 ms :[false, false, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s100 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][false, false, false, false]]
Product exploration explored 100000 steps with 22266 reset in 127 ms.
Product exploration explored 100000 steps with 22424 reset in 120 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 311 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2238 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 463 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3121 steps, run visited all 1 properties in 9 ms. (steps per millisecond=346 )
Probabilistic random walk after 3121 steps, saw 1576 distinct states, run finished after 9 ms. (steps per millisecond=346 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 170 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 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 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, 129/129 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:29:29] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:29:29] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:29:29] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 16:29:29] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 16:29:29] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2022-06-11 16:29:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:29:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:29:29] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 129/129 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 85 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 2245 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3121 steps, run visited all 1 properties in 7 ms. (steps per millisecond=445 )
Probabilistic random walk after 3121 steps, saw 1576 distinct states, run finished after 7 ms. (steps per millisecond=445 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 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 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22485 reset in 116 ms.
Product exploration explored 100000 steps with 22526 reset in 129 ms.
Built C files in :
/tmp/ltsmin12959718905165790220
[2022-06-11 16:29:30] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2022-06-11 16:29:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:29:30] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2022-06-11 16:29:30] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:29:30] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2022-06-11 16:29:30] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:29:30] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12959718905165790220
Running compilation step : cd /tmp/ltsmin12959718905165790220;'/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 247 ms.
Running link step : cd /tmp/ltsmin12959718905165790220;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin12959718905165790220;'/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/stateBased5776742653760689881.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, 129/129 transitions.
Applied a total of 0 rules in 12 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:29:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:29:45] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:29:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:29:45] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 16:29:45] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2022-06-11 16:29:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:29:45] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:29:45] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 129/129 transitions.
Built C files in :
/tmp/ltsmin15981987130770441955
[2022-06-11 16:29:45] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2022-06-11 16:29:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:29:45] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2022-06-11 16:29:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:29:45] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2022-06-11 16:29:45] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:29:45] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15981987130770441955
Running compilation step : cd /tmp/ltsmin15981987130770441955;'/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/ltsmin15981987130770441955;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15981987130770441955;'/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/stateBased5399051030398677793.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 16:30:01] [INFO ] Flatten gal took : 7 ms
[2022-06-11 16:30:01] [INFO ] Flatten gal took : 6 ms
[2022-06-11 16:30:03] [INFO ] Time to serialize gal into /tmp/LTL8447704047871265322.gal : 2124 ms
[2022-06-11 16:30:03] [INFO ] Time to serialize properties into /tmp/LTL17728142964104602972.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8447704047871265322.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17728142964104602972.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/LTL8447704...267
Read 1 LTL properties
Checking formula 0 : !((X(G((X(G(F(X("((s1<1)||(l2226<1))")))))||("((s1>=1)&&(l2226>=1))")))))
Formula 0 simplified : !XG("((s1>=1)&&(l2226>=1))" | XGFX"((s1<1)||(l2226<1))")
Detected timeout of ITS tools.
[2022-06-11 16:30:18] [INFO ] Flatten gal took : 6 ms
[2022-06-11 16:30:18] [INFO ] Applying decomposition
[2022-06-11 16:30:18] [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/graph16959556679372752658.txt' '-o' '/tmp/graph16959556679372752658.bin' '-w' '/tmp/graph16959556679372752658.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16959556679372752658.bin' '-l' '-1' '-v' '-w' '/tmp/graph16959556679372752658.weights' '-q' '0' '-e' '0.001'
[2022-06-11 16:30:18] [INFO ] Decomposing Gal with order
[2022-06-11 16:30:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 16:30:18] [INFO ] Removed a total of 140 redundant transitions.
[2022-06-11 16:30:18] [INFO ] Flatten gal took : 15 ms
[2022-06-11 16:30:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 5 ms.
[2022-06-11 16:30:18] [INFO ] Time to serialize gal into /tmp/LTL18092301572876189940.gal : 1 ms
[2022-06-11 16:30:18] [INFO ] Time to serialize properties into /tmp/LTL17100701112226554322.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/LTL18092301572876189940.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17100701112226554322.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/LTL1809230...247
Read 1 LTL properties
Checking formula 0 : !((X(G((X(G(F(X("((i7.u0.s1<1)||(i7.u22.l2226<1))")))))||("((i7.u0.s1>=1)&&(i7.u22.l2226>=1))")))))
Formula 0 simplified : !XG("((i7.u0.s1>=1)&&(i7.u22.l2226>=1))" | XGFX"((i7.u0.s1<1)||(i7.u22.l2226<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11249841618014985081
[2022-06-11 16:30:33] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11249841618014985081
Running compilation step : cd /tmp/ltsmin11249841618014985081;'/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 222 ms.
Running link step : cd /tmp/ltsmin11249841618014985081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11249841618014985081;'/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)))))||!(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-08 finished in 80655 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 444/444 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 153 transition count 212
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 153 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 153 transition count 211
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 71 place count 131 transition count 188
Iterating global reduction 1 with 22 rules applied. Total rules applied 93 place count 131 transition count 188
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 103 place count 131 transition count 178
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 116 place count 118 transition count 155
Iterating global reduction 2 with 13 rules applied. Total rules applied 129 place count 118 transition count 155
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 139 place count 118 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 114 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 114 transition count 141
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 151 place count 110 transition count 137
Iterating global reduction 3 with 4 rules applied. Total rules applied 155 place count 110 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 157 place count 108 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 108 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 161 place count 108 transition count 131
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 163 place count 106 transition count 129
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 166 place count 105 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 105 transition count 128
Applied a total of 167 rules in 23 ms. Remains 105 /177 variables (removed 72) and now considering 128/444 (removed 316) transitions.
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 16:30:48] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:30:48] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 16:30:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:30:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 16:30:48] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2022-06-11 16:30:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 16:30:48] [INFO ] Computed 5 place invariants in 12 ms
[2022-06-11 16:30:48] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/177 places, 128/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/177 places, 128/444 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-09 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 22530 reset in 114 ms.
Product exploration explored 100000 steps with 22470 reset in 137 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 110 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 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2228 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 477 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2098090 steps, run timeout after 3001 ms. (steps per millisecond=699 ) properties seen :{}
Probabilistic random walk after 2098090 steps, saw 937754 distinct states, run finished after 3005 ms. (steps per millisecond=698 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 16:30:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:30:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:30:52] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 16:30:52] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 16:30:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 16:30:52] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 16:30:52] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 16:30:52] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 16:30:52] [INFO ] After 20ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 16:30:52] [INFO ] After 44ms 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 16:30:52] [INFO ] After 140ms 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 105 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 105/105 places, 128/128 transitions.
Graph (complete) has 306 edges and 105 vertex of which 104 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 104 transition count 126
Applied a total of 3 rules in 4 ms. Remains 104 /105 variables (removed 1) and now considering 126/128 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 104/105 places, 126/128 transitions.
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2141874 steps, run timeout after 3001 ms. (steps per millisecond=713 ) properties seen :{}
Probabilistic random walk after 2141874 steps, saw 958344 distinct states, run finished after 3001 ms. (steps per millisecond=713 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 126 rows 104 cols
[2022-06-11 16:30:55] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 16:30:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:30:55] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 16:30:55] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 16:30:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:30:55] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 16:30:55] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 16:30:55] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-11 16:30:55] [INFO ] After 21ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 16:30:55] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2022-06-11 16:30:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2022-06-11 16:30:55] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-06-11 16:30:55] [INFO ] After 186ms 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 104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 104/104 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 126/126 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 104/104 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 104 cols
[2022-06-11 16:30:55] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 16:30:55] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 126 rows 104 cols
[2022-06-11 16:30:55] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 16:30:55] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-11 16:30:56] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2022-06-11 16:30:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 126 rows 104 cols
[2022-06-11 16:30:56] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 16:30:56] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 126/126 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 119
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 119
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 102
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 102
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 96
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 105
Applied a total of 61 rules in 6 ms. Remains 74 /104 variables (removed 30) and now considering 105/126 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 74 cols
[2022-06-11 16:30:56] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 16:30:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:30:56] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 16:30:56] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 16:30:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:30:56] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 16:30:56] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 16:30:56] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-11 16:30:56] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 16:30:56] [INFO ] Flatten gal took : 22 ms
[2022-06-11 16:30:56] [INFO ] Flatten gal took : 5 ms
[2022-06-11 16:30:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18161464064999102485.gal : 2 ms
[2022-06-11 16:30:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3477274532749526416.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms8431684988165989191;'/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/ReachabilityCardinality18161464064999102485.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3477274532749526416.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/ReachabilityCardinality3477274532749526416.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 122
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :122 after 196
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :196 after 326
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :326 after 1648
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1648 after 13460
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :13460 after 220226
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :220226 after 6.0698e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.0698e+06 after 2.83125e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.83125e+08 after 1.17321e+10
Detected timeout of ITS tools.
[2022-06-11 16:31:11] [INFO ] Flatten gal took : 6 ms
[2022-06-11 16:31:11] [INFO ] Applying decomposition
[2022-06-11 16:31:11] [INFO ] Flatten gal took : 9 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/graph10785076917723913917.txt' '-o' '/tmp/graph10785076917723913917.bin' '-w' '/tmp/graph10785076917723913917.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10785076917723913917.bin' '-l' '-1' '-v' '-w' '/tmp/graph10785076917723913917.weights' '-q' '0' '-e' '0.001'
[2022-06-11 16:31:11] [INFO ] Decomposing Gal with order
[2022-06-11 16:31:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 16:31:11] [INFO ] Removed a total of 76 redundant transitions.
[2022-06-11 16:31:11] [INFO ] Flatten gal took : 14 ms
[2022-06-11 16:31:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 2 ms.
[2022-06-11 16:31:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10259945901461058581.gal : 16 ms
[2022-06-11 16:31:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16521977525215136100.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms8431684988165989191;'/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/ReachabilityCardinality10259945901461058581.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16521977525215136100.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/ReachabilityCardinality16521977525215136100.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 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 8
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :8 after 8
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8 after 14
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :14 after 113
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :264 after 280
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1564 after 1992
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4323 after 4622
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,21140,0.550827,22424,1358,1358,22256,23805,319,65214,155,45327,0
Total reachable state count : 21140

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,0.552241,22688,33,33,22256,23805,327,65214,158,45327,0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 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 7 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 16:31:12] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 16:31:12] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 16:31:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:31:12] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 16:31:12] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2022-06-11 16:31:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 16:31:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:31:12] [INFO ] Dead Transitions using invariants and state equation in 62 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 86 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 52 ms :[(NOT p0), (NOT p0)]
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 10001 steps, including 503 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2277691 steps, run timeout after 3001 ms. (steps per millisecond=758 ) properties seen :{}
Probabilistic random walk after 2277691 steps, saw 1019255 distinct states, run finished after 3001 ms. (steps per millisecond=758 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 16:31:15] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:31:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:31:15] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 16:31:15] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 16:31:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:31:15] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 16:31:16] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 16:31:16] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 16:31:16] [INFO ] After 20ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 16:31:16] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-06-11 16:31:16] [INFO ] After 148ms 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 105 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 105/105 places, 128/128 transitions.
Graph (complete) has 306 edges and 105 vertex of which 104 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 104 transition count 126
Applied a total of 3 rules in 5 ms. Remains 104 /105 variables (removed 1) and now considering 126/128 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 104/105 places, 126/128 transitions.
Incomplete random walk after 10000 steps, including 2245 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 480 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2157716 steps, run timeout after 3001 ms. (steps per millisecond=718 ) properties seen :{}
Probabilistic random walk after 2157716 steps, saw 965754 distinct states, run finished after 3001 ms. (steps per millisecond=718 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 126 rows 104 cols
[2022-06-11 16:31:19] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 16:31:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:31:19] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 16:31:19] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 16:31:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:31:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 16:31:19] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 16:31:19] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-11 16:31:19] [INFO ] After 26ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 16:31:19] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2022-06-11 16:31:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2022-06-11 16:31:19] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-06-11 16:31:19] [INFO ] After 199ms 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 104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 104/104 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 126/126 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 104/104 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 104 cols
[2022-06-11 16:31:19] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 16:31:19] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 126 rows 104 cols
[2022-06-11 16:31:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 16:31:19] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-11 16:31:19] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2022-06-11 16:31:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 126 rows 104 cols
[2022-06-11 16:31:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 16:31:19] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 126/126 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 119
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 119
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 102
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 102
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 96
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 105
Applied a total of 61 rules in 6 ms. Remains 74 /104 variables (removed 30) and now considering 105/126 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 74 cols
[2022-06-11 16:31:19] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 16:31:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:31:19] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 16:31:19] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 16:31:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:31:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 16:31:19] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 16:31:19] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-11 16:31:19] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 16:31:19] [INFO ] Flatten gal took : 9 ms
[2022-06-11 16:31:19] [INFO ] Flatten gal took : 5 ms
[2022-06-11 16:31:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10685577424805357526.gal : 1 ms
[2022-06-11 16:31:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8406480139331523015.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7938731452013741488;'/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/ReachabilityCardinality10685577424805357526.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8406480139331523015.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/ReachabilityCardinality8406480139331523015.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 122
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :122 after 196
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :196 after 326
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :326 after 1648
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1648 after 13460
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :13460 after 220226
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :220226 after 6.0698e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.0698e+06 after 2.83125e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.83125e+08 after 1.17321e+10
Detected timeout of ITS tools.
[2022-06-11 16:31:34] [INFO ] Flatten gal took : 6 ms
[2022-06-11 16:31:34] [INFO ] Applying decomposition
[2022-06-11 16:31:34] [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/graph16224813006670520429.txt' '-o' '/tmp/graph16224813006670520429.bin' '-w' '/tmp/graph16224813006670520429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16224813006670520429.bin' '-l' '-1' '-v' '-w' '/tmp/graph16224813006670520429.weights' '-q' '0' '-e' '0.001'
[2022-06-11 16:31:34] [INFO ] Decomposing Gal with order
[2022-06-11 16:31:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 16:31:34] [INFO ] Removed a total of 63 redundant transitions.
[2022-06-11 16:31:34] [INFO ] Flatten gal took : 9 ms
[2022-06-11 16:31:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 2 ms.
[2022-06-11 16:31:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3154479889683260984.gal : 2 ms
[2022-06-11 16:31:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4818185556569971612.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7938731452013741488;'/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/ReachabilityCardinality3154479889683260984.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4818185556569971612.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...298
Loading property file /tmp/ReachabilityCardinality4818185556569971612.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 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 21
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :21 after 46
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :46 after 156
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :366 after 660
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :852 after 1545
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3074 after 4501
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 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,13961,0.681038,30012,1164,3483,24998,50635,267,42977,190,140635,0
Total reachable state count : 13961

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,0.682369,30012,26,43,24998,50635,274,42977,193,140635,0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 1894 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22398 reset in 126 ms.
Product exploration explored 100000 steps with 22518 reset in 111 ms.
Built C files in :
/tmp/ltsmin5433647750649158197
[2022-06-11 16:31:38] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2022-06-11 16:31:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:31:38] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2022-06-11 16:31:38] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:31:38] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2022-06-11 16:31:38] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:31:38] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5433647750649158197
Running compilation step : cd /tmp/ltsmin5433647750649158197;'/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 236 ms.
Running link step : cd /tmp/ltsmin5433647750649158197;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5433647750649158197;'/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/stateBased5347992581984652167.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 6 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 16:31:53] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:31:53] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 16:31:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:31:53] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 16:31:53] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2022-06-11 16:31:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 16:31:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:31:53] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 128/128 transitions.
Built C files in :
/tmp/ltsmin9866569667187938931
[2022-06-11 16:31:53] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2022-06-11 16:31:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:31:53] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2022-06-11 16:31:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:31:53] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2022-06-11 16:31:53] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:31:53] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9866569667187938931
Running compilation step : cd /tmp/ltsmin9866569667187938931;'/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 766 ms.
Running link step : cd /tmp/ltsmin9866569667187938931;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9866569667187938931;'/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/stateBased5277591359137836935.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 16:32:08] [INFO ] Flatten gal took : 5 ms
[2022-06-11 16:32:08] [INFO ] Flatten gal took : 4 ms
[2022-06-11 16:32:08] [INFO ] Time to serialize gal into /tmp/LTL15420245936455921576.gal : 3 ms
[2022-06-11 16:32:08] [INFO ] Time to serialize properties into /tmp/LTL12414382333823822374.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/LTL15420245936455921576.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12414382333823822374.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/LTL1542024...268
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l2235<1))"))))
Formula 0 simplified : !GF"((s1<1)||(l2235<1))"
Detected timeout of ITS tools.
[2022-06-11 16:32:23] [INFO ] Flatten gal took : 9 ms
[2022-06-11 16:32:23] [INFO ] Applying decomposition
[2022-06-11 16:32:23] [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/graph5493794601343752824.txt' '-o' '/tmp/graph5493794601343752824.bin' '-w' '/tmp/graph5493794601343752824.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5493794601343752824.bin' '-l' '-1' '-v' '-w' '/tmp/graph5493794601343752824.weights' '-q' '0' '-e' '0.001'
[2022-06-11 16:32:23] [INFO ] Decomposing Gal with order
[2022-06-11 16:32:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 16:32:23] [INFO ] Removed a total of 119 redundant transitions.
[2022-06-11 16:32:23] [INFO ] Flatten gal took : 10 ms
[2022-06-11 16:32:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 2 ms.
[2022-06-11 16:32:23] [INFO ] Time to serialize gal into /tmp/LTL16781796105229293011.gal : 1 ms
[2022-06-11 16:32:23] [INFO ] Time to serialize properties into /tmp/LTL4043668782934598551.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/LTL16781796105229293011.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4043668782934598551.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/LTL1678179...246
Read 1 LTL properties
Checking formula 0 : !((G(F("((i8.u0.s1<1)||(u16.l2235<1))"))))
Formula 0 simplified : !GF"((i8.u0.s1<1)||(u16.l2235<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1140047128225707169
[2022-06-11 16:32:38] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1140047128225707169
Running compilation step : cd /tmp/ltsmin1140047128225707169;'/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 202 ms.
Running link step : cd /tmp/ltsmin1140047128225707169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1140047128225707169;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-09 finished in 125410 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F((F(G(p1))&&p0))))))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 444/444 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 154 transition count 202
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 154 transition count 202
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 68 place count 132 transition count 179
Iterating global reduction 0 with 22 rules applied. Total rules applied 90 place count 132 transition count 179
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 100 place count 132 transition count 169
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 113 place count 119 transition count 145
Iterating global reduction 1 with 13 rules applied. Total rules applied 126 place count 119 transition count 145
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 137 place count 119 transition count 134
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 116 transition count 131
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 116 transition count 131
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 146 place count 113 transition count 128
Iterating global reduction 2 with 3 rules applied. Total rules applied 149 place count 113 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 111 transition count 126
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 111 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 155 place count 111 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 157 place count 109 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 109 transition count 122
Applied a total of 159 rules in 20 ms. Remains 109 /177 variables (removed 68) and now considering 122/444 (removed 322) transitions.
// Phase 1: matrix 122 rows 109 cols
[2022-06-11 16:32:53] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:32:53] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 122 rows 109 cols
[2022-06-11 16:32:53] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 16:32:53] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-06-11 16:32:54] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2022-06-11 16:32:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 122 rows 109 cols
[2022-06-11 16:32:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:32:54] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/177 places, 122/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/177 places, 122/444 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s60 1)), p0:(AND (GEQ s1 1) (GEQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-10 finished in 450 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(F(G(p1))))||p0)))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 444/444 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 154 transition count 214
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 154 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 154 transition count 213
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 69 place count 132 transition count 190
Iterating global reduction 1 with 22 rules applied. Total rules applied 91 place count 132 transition count 190
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 101 place count 132 transition count 180
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 114 place count 119 transition count 157
Iterating global reduction 2 with 13 rules applied. Total rules applied 127 place count 119 transition count 157
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 136 place count 119 transition count 148
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 139 place count 116 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 142 place count 116 transition count 145
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 145 place count 113 transition count 142
Iterating global reduction 3 with 3 rules applied. Total rules applied 148 place count 113 transition count 142
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 150 place count 111 transition count 138
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 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 154 place count 111 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 156 place count 109 transition count 134
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 109 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 159 place count 108 transition count 133
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 108 transition count 133
Applied a total of 160 rules in 22 ms. Remains 108 /177 variables (removed 69) and now considering 133/444 (removed 311) transitions.
// Phase 1: matrix 133 rows 108 cols
[2022-06-11 16:32:54] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:32:54] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 133 rows 108 cols
[2022-06-11 16:32:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:32:54] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-06-11 16:32:54] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2022-06-11 16:32:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 133 rows 108 cols
[2022-06-11 16:32:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:32:54] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/177 places, 133/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/177 places, 133/444 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s103 1)), p1:(AND (GEQ s1 1) (GEQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22397 reset in 121 ms.
Product exploration explored 100000 steps with 22523 reset in 129 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)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Finished probabilistic random walk after 37179 steps, run visited all 2 properties in 57 ms. (steps per millisecond=652 )
Probabilistic random walk after 37179 steps, saw 18602 distinct states, run finished after 57 ms. (steps per millisecond=652 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 230 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 133/133 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 108 cols
[2022-06-11 16:32:55] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:32:55] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 133 rows 108 cols
[2022-06-11 16:32:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:32:55] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-06-11 16:32:56] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2022-06-11 16:32:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 133 rows 108 cols
[2022-06-11 16:32:56] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 16:32:56] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 133/133 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 : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 456 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2225 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Finished probabilistic random walk after 37179 steps, run visited all 2 properties in 64 ms. (steps per millisecond=580 )
Probabilistic random walk after 37179 steps, saw 18602 distinct states, run finished after 64 ms. (steps per millisecond=580 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22481 reset in 129 ms.
Product exploration explored 100000 steps with 22496 reset in 128 ms.
Built C files in :
/tmp/ltsmin2806560740072177945
[2022-06-11 16:32:57] [INFO ] Computing symmetric may disable matrix : 133 transitions.
[2022-06-11 16:32:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:32:57] [INFO ] Computing symmetric may enable matrix : 133 transitions.
[2022-06-11 16:32:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:32:57] [INFO ] Computing Do-Not-Accords matrix : 133 transitions.
[2022-06-11 16:32:57] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:32:57] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2806560740072177945
Running compilation step : cd /tmp/ltsmin2806560740072177945;'/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 258 ms.
Running link step : cd /tmp/ltsmin2806560740072177945;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2806560740072177945;'/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/stateBased7622316190086686663.hoa' '--buchi-type=spotba'
LTSmin run took 2727 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-11 finished in 6396 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||X(X((G(p1)||F(p2))))))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 444/444 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 155 transition count 226
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 155 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 155 transition count 225
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 65 place count 135 transition count 204
Iterating global reduction 1 with 20 rules applied. Total rules applied 85 place count 135 transition count 204
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 94 place count 135 transition count 195
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 105 place count 124 transition count 176
Iterating global reduction 2 with 11 rules applied. Total rules applied 116 place count 124 transition count 176
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 124 place count 124 transition count 168
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 121 transition count 165
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 121 transition count 165
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 133 place count 118 transition count 162
Iterating global reduction 3 with 3 rules applied. Total rules applied 136 place count 118 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 138 place count 116 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 116 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 143 place count 116 transition count 155
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 114 transition count 153
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 114 transition count 153
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 113 transition count 152
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 113 transition count 152
Applied a total of 149 rules in 16 ms. Remains 113 /177 variables (removed 64) and now considering 152/444 (removed 292) transitions.
// Phase 1: matrix 152 rows 113 cols
[2022-06-11 16:33:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:33:00] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 152 rows 113 cols
[2022-06-11 16:33:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:33:00] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-11 16:33:00] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
// Phase 1: matrix 152 rows 113 cols
[2022-06-11 16:33:00] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 16:33:01] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/177 places, 152/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/177 places, 152/444 transitions.
Stuttering acceptance computed with spot in 735 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s85 1)), p2:(AND (GEQ s1 1) (GEQ s106 1)), p1:(OR (LT s1 1) (LT s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22375 reset in 147 ms.
Product exploration explored 100000 steps with 22421 reset in 154 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 (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 445 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2007717 steps, run timeout after 3001 ms. (steps per millisecond=669 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 2007717 steps, saw 848443 distinct states, run finished after 3001 ms. (steps per millisecond=669 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 152 rows 113 cols
[2022-06-11 16:33:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:33:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:33:05] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 16:33:05] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 16:33:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:33:05] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 16:33:05] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 16:33:05] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-11 16:33:05] [INFO ] After 29ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 16:33:06] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-06-11 16:33:06] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 113/113 places, 152/152 transitions.
Graph (complete) has 342 edges and 113 vertex of which 112 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 112 transition count 150
Applied a total of 3 rules in 4 ms. Remains 112 /113 variables (removed 1) and now considering 150/152 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 112/113 places, 150/152 transitions.
Incomplete random walk after 10000 steps, including 2206 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 484 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2105445 steps, run timeout after 3001 ms. (steps per millisecond=701 ) properties seen :{}
Probabilistic random walk after 2105445 steps, saw 890608 distinct states, run finished after 3001 ms. (steps per millisecond=701 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 150 rows 112 cols
[2022-06-11 16:33:09] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-11 16:33:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:33:09] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 16:33:09] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 16:33:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:33:09] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 16:33:09] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 16:33:09] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-11 16:33:09] [INFO ] After 33ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 16:33:09] [INFO ] After 65ms 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 16:33:09] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 112/112 places, 150/150 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 150/150 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 112/112 places, 150/150 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 150/150 (removed 0) transitions.
// Phase 1: matrix 150 rows 112 cols
[2022-06-11 16:33:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 16:33:09] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 150 rows 112 cols
[2022-06-11 16:33:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 16:33:09] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-11 16:33:09] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2022-06-11 16:33:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 150 rows 112 cols
[2022-06-11 16:33:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 16:33:09] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 150/150 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 112 transition count 144
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 107 transition count 144
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 107 transition count 127
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 45 place count 90 transition count 127
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 83 transition count 120
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 81 transition count 129
Applied a total of 63 rules in 13 ms. Remains 81 /112 variables (removed 31) and now considering 129/150 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 129 rows 81 cols
[2022-06-11 16:33:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 16:33:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:33:09] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 16:33:09] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 16:33:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:33:09] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 16:33:09] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 16:33:10] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2022-06-11 16:33:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2022-06-11 16:33:10] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-11 16:33:10] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 16:33:10] [INFO ] Flatten gal took : 10 ms
[2022-06-11 16:33:10] [INFO ] Flatten gal took : 7 ms
[2022-06-11 16:33:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9184023770147136898.gal : 1 ms
[2022-06-11 16:33:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10345099796004969882.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2768324405040617341;'/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/ReachabilityCardinality9184023770147136898.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10345099796004969882.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/ReachabilityCardinality10345099796004969882.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 35
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :35 after 110
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :110 after 236
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :236 after 326
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :326 after 1912
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1912 after 22900
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :22900 after 508718
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :508718 after 2.95392e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.95392e+07 after 2.05011e+09
Detected timeout of ITS tools.
[2022-06-11 16:33:25] [INFO ] Flatten gal took : 4 ms
[2022-06-11 16:33:25] [INFO ] Applying decomposition
[2022-06-11 16:33:25] [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/graph311645139426438492.txt' '-o' '/tmp/graph311645139426438492.bin' '-w' '/tmp/graph311645139426438492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph311645139426438492.bin' '-l' '-1' '-v' '-w' '/tmp/graph311645139426438492.weights' '-q' '0' '-e' '0.001'
[2022-06-11 16:33:25] [INFO ] Decomposing Gal with order
[2022-06-11 16:33:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 16:33:25] [INFO ] Removed a total of 71 redundant transitions.
[2022-06-11 16:33:25] [INFO ] Flatten gal took : 10 ms
[2022-06-11 16:33:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 1 ms.
[2022-06-11 16:33:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10796665836853216244.gal : 1 ms
[2022-06-11 16:33:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17516844128241894393.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms2768324405040617341;'/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/ReachabilityCardinality10796665836853216244.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17516844128241894393.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/ReachabilityCardinality17516844128241894393.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7 after 12
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12 after 117
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :222 after 242
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :408 after 648
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2272 after 2437
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4680 after 8228
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :15480 after 20505
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :40036 after 63718
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,165699,11.2044,263360,1713,6412,72851,211656,330,860264,203,3.50659e+06,0
Total reachable state count : 165699

Verifying 1 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,11.2123,263360,31,33,72851,211656,353,860264,211,3.50659e+06,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) p1 (NOT p2))))]
Knowledge based reduction with 4 factoid took 449 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 1159 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 152/152 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 152/152 (removed 0) transitions.
// Phase 1: matrix 152 rows 113 cols
[2022-06-11 16:33:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:33:38] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 152 rows 113 cols
[2022-06-11 16:33:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:33:38] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-11 16:33:38] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
// Phase 1: matrix 152 rows 113 cols
[2022-06-11 16:33:38] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-11 16:33:38] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 152/152 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 : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 466 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2135732 steps, run timeout after 3002 ms. (steps per millisecond=711 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 2135732 steps, saw 903562 distinct states, run finished after 3006 ms. (steps per millisecond=710 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 152 rows 113 cols
[2022-06-11 16:33:42] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 16:33:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:33:42] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 16:33:42] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 16:33:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:33:42] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 16:33:42] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 16:33:42] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-11 16:33:42] [INFO ] After 29ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 16:33:42] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-06-11 16:33:42] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 113/113 places, 152/152 transitions.
Graph (complete) has 342 edges and 113 vertex of which 112 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 112 transition count 150
Applied a total of 3 rules in 3 ms. Remains 112 /113 variables (removed 1) and now considering 150/152 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 112/113 places, 150/152 transitions.
Incomplete random walk after 10000 steps, including 2222 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2126684 steps, run timeout after 3001 ms. (steps per millisecond=708 ) properties seen :{}
Probabilistic random walk after 2126684 steps, saw 899709 distinct states, run finished after 3004 ms. (steps per millisecond=707 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 150 rows 112 cols
[2022-06-11 16:33:45] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 16:33:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:33:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 16:33:45] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 16:33:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:33:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 16:33:45] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 16:33:45] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-11 16:33:45] [INFO ] After 35ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 16:33:45] [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 30 ms.
[2022-06-11 16:33:45] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 112/112 places, 150/150 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 150/150 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 112/112 places, 150/150 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 150/150 (removed 0) transitions.
// Phase 1: matrix 150 rows 112 cols
[2022-06-11 16:33:45] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 16:33:45] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 150 rows 112 cols
[2022-06-11 16:33:45] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 16:33:45] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-11 16:33:46] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2022-06-11 16:33:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 150 rows 112 cols
[2022-06-11 16:33:46] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 16:33:46] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 150/150 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 112 transition count 144
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 107 transition count 144
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 107 transition count 127
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 90 transition count 127
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 59 place count 83 transition count 120
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 81 transition count 129
Applied a total of 63 rules in 6 ms. Remains 81 /112 variables (removed 31) and now considering 129/150 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 129 rows 81 cols
[2022-06-11 16:33:46] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 16:33:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:33:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 16:33:46] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 16:33:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 16:33:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 16:33:46] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 16:33:46] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2022-06-11 16:33:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2022-06-11 16:33:46] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-11 16:33:46] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 16:33:46] [INFO ] Flatten gal took : 4 ms
[2022-06-11 16:33:46] [INFO ] Flatten gal took : 4 ms
[2022-06-11 16:33:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17576868771885772556.gal : 1 ms
[2022-06-11 16:33:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16363074264984158623.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9820450591221085502;'/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/ReachabilityCardinality17576868771885772556.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16363074264984158623.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/ReachabilityCardinality16363074264984158623.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 35
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :35 after 110
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :110 after 236
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :236 after 326
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :326 after 1912
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1912 after 22900
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :22900 after 508718
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :508718 after 2.95392e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.95392e+07 after 2.05011e+09
Detected timeout of ITS tools.
[2022-06-11 16:34:01] [INFO ] Flatten gal took : 4 ms
[2022-06-11 16:34:01] [INFO ] Applying decomposition
[2022-06-11 16:34:01] [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/graph6590869404763070446.txt' '-o' '/tmp/graph6590869404763070446.bin' '-w' '/tmp/graph6590869404763070446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6590869404763070446.bin' '-l' '-1' '-v' '-w' '/tmp/graph6590869404763070446.weights' '-q' '0' '-e' '0.001'
[2022-06-11 16:34:01] [INFO ] Decomposing Gal with order
[2022-06-11 16:34:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 16:34:01] [INFO ] Removed a total of 63 redundant transitions.
[2022-06-11 16:34:01] [INFO ] Flatten gal took : 13 ms
[2022-06-11 16:34:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 2 ms.
[2022-06-11 16:34:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1582987778681632805.gal : 2 ms
[2022-06-11 16:34:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9964813765661174881.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9820450591221085502;'/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/ReachabilityCardinality1582987778681632805.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9964813765661174881.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...298
Loading property file /tmp/ReachabilityCardinality9964813765661174881.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 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4 after 4
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4 after 5
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5 after 13
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :13 after 17
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :17 after 31
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :31 after 35
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :35 after 182
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :412 after 626
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2506 after 3507
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5922 after 15935
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :39021 after 40518
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 32769 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,157507,11.0475,226940,697,6095,45182,435809,323,204879,242,3.08276e+06,0
Total reachable state count : 157507

Verifying 1 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,3,11.0518,226940,32,51,45182,435809,346,204879,250,3.08276e+06,0
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 22459 reset in 151 ms.
Product exploration explored 100000 steps with 22494 reset in 152 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 152/152 transitions.
Applied a total of 0 rules in 7 ms. Remains 113 /113 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2022-06-11 16:34:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 152 rows 113 cols
[2022-06-11 16:34:13] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:34:13] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 152/152 transitions.
Product exploration explored 100000 steps with 22347 reset in 319 ms.
Product exploration explored 100000 steps with 22504 reset in 327 ms.
Built C files in :
/tmp/ltsmin16158397841734853502
[2022-06-11 16:34:14] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16158397841734853502
Running compilation step : cd /tmp/ltsmin16158397841734853502;'/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 259 ms.
Running link step : cd /tmp/ltsmin16158397841734853502;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16158397841734853502;'/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/stateBased13722493745743692761.hoa' '--buchi-type=spotba'
LTSmin run took 3227 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-12 finished in 77461 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!((X(p1)||p2)&&p0)) U p1))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 444/444 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 155 transition count 238
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 155 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 155 transition count 237
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 65 place count 135 transition count 216
Iterating global reduction 1 with 20 rules applied. Total rules applied 85 place count 135 transition count 216
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 93 place count 135 transition count 208
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 105 place count 123 transition count 187
Iterating global reduction 2 with 12 rules applied. Total rules applied 117 place count 123 transition count 187
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 126 place count 123 transition count 178
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 120 transition count 175
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 120 transition count 175
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 117 transition count 172
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 117 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 139 place count 116 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 116 transition count 169
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 115 transition count 168
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 115 transition count 168
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 114 transition count 167
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 114 transition count 167
Applied a total of 144 rules in 16 ms. Remains 114 /177 variables (removed 63) and now considering 167/444 (removed 277) transitions.
// Phase 1: matrix 167 rows 114 cols
[2022-06-11 16:34:18] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 16:34:18] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 167 rows 114 cols
[2022-06-11 16:34:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:34:18] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-06-11 16:34:18] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
// Phase 1: matrix 167 rows 114 cols
[2022-06-11 16:34:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:34:18] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/177 places, 167/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/177 places, 167/444 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), true, (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND p0 p1) (AND p0 p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p0)) (AND p1 (NOT p2))), acceptance={} source=2 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s107 1)), p0:(AND (GEQ s1 1) (GEQ s108 1)), p2:(AND (GEQ s1 1) (GEQ s109 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 1 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-13 finished in 666 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0)) U p0)||(G(p1) U p0)))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 444/444 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 154 transition count 225
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 154 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 154 transition count 224
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 68 place count 133 transition count 202
Iterating global reduction 1 with 21 rules applied. Total rules applied 89 place count 133 transition count 202
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 98 place count 133 transition count 193
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 110 place count 121 transition count 172
Iterating global reduction 2 with 12 rules applied. Total rules applied 122 place count 121 transition count 172
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 131 place count 121 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 118 transition count 160
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 118 transition count 160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 140 place count 115 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 143 place count 115 transition count 157
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 113 transition count 153
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 113 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 150 place count 113 transition count 150
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 111 transition count 148
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 111 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 110 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 110 transition count 147
Applied a total of 156 rules in 15 ms. Remains 110 /177 variables (removed 67) and now considering 147/444 (removed 297) transitions.
// Phase 1: matrix 147 rows 110 cols
[2022-06-11 16:34:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:34:18] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 147 rows 110 cols
[2022-06-11 16:34:18] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 16:34:18] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-11 16:34:19] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 110 cols
[2022-06-11 16:34:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:34:19] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/177 places, 147/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/177 places, 147/444 transitions.
Stuttering acceptance computed with spot in 483 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1), (NOT p0), true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s104 1)), p1:(AND (GEQ s1 1) (GEQ s105 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, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-14 finished in 877 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((G(!p1)&&p0) U p2)||G(X(X(p2)))))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 444/444 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 154 transition count 225
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 154 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 154 transition count 224
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 68 place count 133 transition count 202
Iterating global reduction 1 with 21 rules applied. Total rules applied 89 place count 133 transition count 202
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 97 place count 133 transition count 194
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 109 place count 121 transition count 173
Iterating global reduction 2 with 12 rules applied. Total rules applied 121 place count 121 transition count 173
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 130 place count 121 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 133 place count 118 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 136 place count 118 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 139 place count 115 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 142 place count 115 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 114 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 114 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 113 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 113 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 112 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 112 transition count 153
Applied a total of 148 rules in 13 ms. Remains 112 /177 variables (removed 65) and now considering 153/444 (removed 291) transitions.
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 16:34:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:34:19] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 16:34:19] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 16:34:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-11 16:34:20] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 16:34:20] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 16:34:20] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/177 places, 153/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/177 places, 153/444 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) p1), (NOT p2), p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0)) p1), acceptance={} source=2 dest: 3}, { cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 4}, { cond=(NOT p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s106 1)), p0:(AND (GEQ s1 1) (GEQ s106 1)), p1:(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, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-15 finished in 742 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (X(p0) U !F(p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X(G(p0))||X(G((F(p1)||p0))))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(F(X(p0))))||!p0))))'
Found a SL insensitive property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-08
Stuttering acceptance computed with spot in 154 ms :[false, false, (NOT p0), (NOT p0)]
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 177/177 places, 444/444 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 153 transition count 212
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 153 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 153 transition count 211
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 71 place count 131 transition count 188
Iterating global reduction 1 with 22 rules applied. Total rules applied 93 place count 131 transition count 188
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 102 place count 131 transition count 179
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 115 place count 118 transition count 156
Iterating global reduction 2 with 13 rules applied. Total rules applied 128 place count 118 transition count 156
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 138 place count 118 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 142 place count 114 transition count 142
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 114 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 150 place count 110 transition count 138
Iterating global reduction 3 with 4 rules applied. Total rules applied 154 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 156 place count 108 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 158 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 160 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 162 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 105 transition count 129
Applied a total of 166 rules in 14 ms. Remains 105 /177 variables (removed 72) and now considering 129/444 (removed 315) transitions.
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:34:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:34:20] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:34:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:34:20] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 16:34:21] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:34:21] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 16:34:21] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 105/177 places, 129/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/177 places, 129/444 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22398 reset in 147 ms.
Product exploration explored 100000 steps with 22607 reset in 128 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 462 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3121 steps, run visited all 1 properties in 7 ms. (steps per millisecond=445 )
Probabilistic random walk after 3121 steps, saw 1576 distinct states, run finished after 7 ms. (steps per millisecond=445 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 166 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 75 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, 129/129 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:34:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:34:22] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:34:22] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 16:34:22] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 16:34:22] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2022-06-11 16:34:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:34:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:34:22] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 129/129 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 92 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 63 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2216 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3121 steps, run visited all 1 properties in 9 ms. (steps per millisecond=346 )
Probabilistic random walk after 3121 steps, saw 1576 distinct states, run finished after 9 ms. (steps per millisecond=346 ) 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 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22471 reset in 131 ms.
Product exploration explored 100000 steps with 22482 reset in 126 ms.
Built C files in :
/tmp/ltsmin17184962064646729308
[2022-06-11 16:34:23] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2022-06-11 16:34:23] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:34:23] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2022-06-11 16:34:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:34:23] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2022-06-11 16:34:23] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:34:23] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17184962064646729308
Running compilation step : cd /tmp/ltsmin17184962064646729308;'/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 342 ms.
Running link step : cd /tmp/ltsmin17184962064646729308;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17184962064646729308;'/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/stateBased15764069847945215518.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, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:34:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:34:38] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:34:38] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-11 16:34:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 16:34:38] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2022-06-11 16:34:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 16:34:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 16:34:38] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 129/129 transitions.
Built C files in :
/tmp/ltsmin7481269352138950695
[2022-06-11 16:34:38] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2022-06-11 16:34:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:34:38] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2022-06-11 16:34:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:34:38] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2022-06-11 16:34:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:34:38] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7481269352138950695
Running compilation step : cd /tmp/ltsmin7481269352138950695;'/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 269 ms.
Running link step : cd /tmp/ltsmin7481269352138950695;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin7481269352138950695;'/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/stateBased15072544044796077942.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 16:34:53] [INFO ] Flatten gal took : 5 ms
[2022-06-11 16:34:53] [INFO ] Flatten gal took : 7 ms
[2022-06-11 16:34:53] [INFO ] Time to serialize gal into /tmp/LTL599360363554399350.gal : 0 ms
[2022-06-11 16:34:53] [INFO ] Time to serialize properties into /tmp/LTL4337931565371652014.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/LTL599360363554399350.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4337931565371652014.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/LTL5993603...265
Read 1 LTL properties
Checking formula 0 : !((X(G((X(G(F(X("((s1<1)||(l2226<1))")))))||("((s1>=1)&&(l2226>=1))")))))
Formula 0 simplified : !XG("((s1>=1)&&(l2226>=1))" | XGFX"((s1<1)||(l2226<1))")
Detected timeout of ITS tools.
[2022-06-11 16:35:08] [INFO ] Flatten gal took : 10 ms
[2022-06-11 16:35:08] [INFO ] Applying decomposition
[2022-06-11 16:35:08] [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/graph766886257145648435.txt' '-o' '/tmp/graph766886257145648435.bin' '-w' '/tmp/graph766886257145648435.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph766886257145648435.bin' '-l' '-1' '-v' '-w' '/tmp/graph766886257145648435.weights' '-q' '0' '-e' '0.001'
[2022-06-11 16:35:08] [INFO ] Decomposing Gal with order
[2022-06-11 16:35:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 16:35:08] [INFO ] Removed a total of 124 redundant transitions.
[2022-06-11 16:35:08] [INFO ] Flatten gal took : 11 ms
[2022-06-11 16:35:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 3 ms.
[2022-06-11 16:35:08] [INFO ] Time to serialize gal into /tmp/LTL6096898684820662832.gal : 2 ms
[2022-06-11 16:35:08] [INFO ] Time to serialize properties into /tmp/LTL16430897244956359904.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/LTL6096898684820662832.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16430897244956359904.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/LTL6096898...246
Read 1 LTL properties
Checking formula 0 : !((X(G((X(G(F(X("((i6.u0.s1<1)||(u21.l2226<1))")))))||("((i6.u0.s1>=1)&&(u21.l2226>=1))")))))
Formula 0 simplified : !XG("((i6.u0.s1>=1)&&(u21.l2226>=1))" | XGFX"((i6.u0.s1<1)||(u21.l2226<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin798126431730178054
[2022-06-11 16:35:23] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin798126431730178054
Running compilation step : cd /tmp/ltsmin798126431730178054;'/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 223 ms.
Running link step : cd /tmp/ltsmin798126431730178054;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin798126431730178054;'/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)))))||!(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-08 finished in 78391 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-06-11 16:35:39] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4198734751582920979
[2022-06-11 16:35:39] [INFO ] Computing symmetric may disable matrix : 444 transitions.
[2022-06-11 16:35:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:35:39] [INFO ] Applying decomposition
[2022-06-11 16:35:39] [INFO ] Computing symmetric may enable matrix : 444 transitions.
[2022-06-11 16:35:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:35:39] [INFO ] Flatten gal took : 16 ms
[2022-06-11 16:35:39] [INFO ] Computing Do-Not-Accords matrix : 444 transitions.
[2022-06-11 16:35:39] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 16:35:39] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4198734751582920979
Running compilation step : cd /tmp/ltsmin4198734751582920979;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5389929368293573878.txt' '-o' '/tmp/graph5389929368293573878.bin' '-w' '/tmp/graph5389929368293573878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5389929368293573878.bin' '-l' '-1' '-v' '-w' '/tmp/graph5389929368293573878.weights' '-q' '0' '-e' '0.001'
[2022-06-11 16:35:39] [INFO ] Decomposing Gal with order
[2022-06-11 16:35:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 16:35:39] [INFO ] Removed a total of 200 redundant transitions.
[2022-06-11 16:35:39] [INFO ] Flatten gal took : 26 ms
[2022-06-11 16:35:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 255 labels/synchronizations in 4 ms.
[2022-06-11 16:35:39] [INFO ] Time to serialize gal into /tmp/LTLFireability17543978410525202068.gal : 187 ms
[2022-06-11 16:35:39] [INFO ] Time to serialize properties into /tmp/LTLFireability12618050779197046127.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/LTLFireability17543978410525202068.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12618050779197046127.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 4 LTL properties
Checking formula 0 : !(((!("((i3.i1.u24.p141>=1)&&(i3.i1.u24.l1708>=1))"))U((X("((i3.i1.u24.p141>=1)&&(i3.i1.u24.l1708>=1))"))U(!(F("((u0.s1>=1)&&(i2.u6.l2...169
Formula 0 simplified : !(!"((i3.i1.u24.p141>=1)&&(i3.i1.u24.l1708>=1))" U (X"((i3.i1.u24.p141>=1)&&(i3.i1.u24.l1708>=1))" U !F"((u0.s1>=1)&&(i2.u6.l222>=1)...159
Compilation finished in 1027 ms.
Running link step : cd /tmp/ltsmin4198734751582920979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4198734751582920979;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(LTLAPp0==true) U (X((LTLAPp0==true)) U !<>((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: LTL layer: formula: (!(LTLAPp0==true) U (X((LTLAPp0==true)) U !<>((LTLAPp1==true))))
pins2lts-mc-linux64( 2/ 8), 0.007: "(!(LTLAPp0==true) U (X((LTLAPp0==true)) U !<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.007: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.054: There are 451 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.054: State length is 178, there are 468 groups
pins2lts-mc-linux64( 0/ 8), 0.054: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.054: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.054: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.054: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.078: [Blue] ~50 levels ~960 states ~2696 transitions
pins2lts-mc-linux64( 3/ 8), 0.090: [Blue] ~47 levels ~1920 states ~4360 transitions
pins2lts-mc-linux64( 2/ 8), 0.127: [Blue] ~94 levels ~3840 states ~9288 transitions
pins2lts-mc-linux64( 3/ 8), 0.182: [Blue] ~94 levels ~7680 states ~19296 transitions
pins2lts-mc-linux64( 3/ 8), 0.283: [Blue] ~94 levels ~15360 states ~36048 transitions
pins2lts-mc-linux64( 3/ 8), 0.534: [Blue] ~94 levels ~30720 states ~71296 transitions
pins2lts-mc-linux64( 2/ 8), 0.959: [Blue] ~138 levels ~61440 states ~136392 transitions
pins2lts-mc-linux64( 2/ 8), 1.713: [Blue] ~182 levels ~122880 states ~270264 transitions
pins2lts-mc-linux64( 2/ 8), 2.999: [Blue] ~226 levels ~245760 states ~538648 transitions
pins2lts-mc-linux64( 2/ 8), 5.117: [Blue] ~358 levels ~491520 states ~1073760 transitions
pins2lts-mc-linux64( 0/ 8), 8.833: [Blue] ~1084 levels ~983040 states ~2101848 transitions
pins2lts-mc-linux64( 0/ 8), 15.963: [Blue] ~1497 levels ~1966080 states ~4194280 transitions
pins2lts-mc-linux64( 0/ 8), 30.020: [Blue] ~1762 levels ~3932160 states ~8376816 transitions
pins2lts-mc-linux64( 0/ 8), 57.929: [Blue] ~2266 levels ~7864320 states ~16764512 transitions
pins2lts-mc-linux64( 0/ 8), 113.588: [Blue] ~2835 levels ~15728640 states ~33575424 transitions
pins2lts-mc-linux64( 0/ 8), 226.061: [Blue] ~3669 levels ~31457280 states ~67317336 transitions
pins2lts-mc-linux64( 5/ 8), 457.239: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 457.753:
pins2lts-mc-linux64( 0/ 8), 457.754: Explored 54388007 states 120512315 transitions, fanout: 2.216
pins2lts-mc-linux64( 0/ 8), 457.754: Total exploration time 457.660 sec (457.190 sec minimum, 457.395 sec on average)
pins2lts-mc-linux64( 0/ 8), 457.754: States per second: 118839, Transitions per second: 263323
pins2lts-mc-linux64( 0/ 8), 457.754:
pins2lts-mc-linux64( 0/ 8), 457.754: State space has 55265031 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 457.754: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 457.754: blue states: 54388007 (98.41%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 457.754: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 457.754: all-red states: 28476912 (51.53%), bogus 8 (0.00%)
pins2lts-mc-linux64( 0/ 8), 457.754:
pins2lts-mc-linux64( 0/ 8), 457.754: Total memory used for local state coloring: 1.1MB
pins2lts-mc-linux64( 0/ 8), 457.754:
pins2lts-mc-linux64( 0/ 8), 457.754: Queue width: 8B, total height: 74186, memory: 0.57MB
pins2lts-mc-linux64( 0/ 8), 457.754: Tree memory: 677.6MB, 12.9 B/state, compr.: 1.8%
pins2lts-mc-linux64( 0/ 8), 457.754: Tree fill ratio (roots/leafs): 41.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 457.754: Stored 447 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 457.754: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 457.754: Est. total memory use: 678.2MB (~1024.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4198734751582920979;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(LTLAPp0==true) U (X((LTLAPp0==true)) U !<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4198734751582920979;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(LTLAPp0==true) U (X((LTLAPp0==true)) U !<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-11 16:59:20] [INFO ] Flatten gal took : 234 ms
[2022-06-11 16:59:20] [INFO ] Time to serialize gal into /tmp/LTLFireability18238268895909877468.gal : 39 ms
[2022-06-11 16:59:20] [INFO ] Time to serialize properties into /tmp/LTLFireability5689732562772564740.ltl : 10 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/LTLFireability18238268895909877468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5689732562772564740.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...289
Read 4 LTL properties
Checking formula 0 : !(((!("((p141>=1)&&(l1708>=1))"))U((X("((p141>=1)&&(l1708>=1))"))U(!(F("((s1>=1)&&(l222>=1))"))))))
Formula 0 simplified : !(!"((p141>=1)&&(l1708>=1))" U (X"((p141>=1)&&(l1708>=1))" U !F"((s1>=1)&&(l222>=1))"))
Detected timeout of ITS tools.
[2022-06-11 17:23:06] [INFO ] Flatten gal took : 254 ms
[2022-06-11 17:23:07] [INFO ] Input system was already deterministic with 444 transitions.
[2022-06-11 17:23:07] [INFO ] Transformed 177 places.
[2022-06-11 17:23:07] [INFO ] Transformed 444 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 17:23:07] [INFO ] Time to serialize gal into /tmp/LTLFireability14908513630957237224.gal : 8 ms
[2022-06-11 17:23:07] [INFO ] Time to serialize properties into /tmp/LTLFireability11311130862841910976.ltl : 4 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/LTLFireability14908513630957237224.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11311130862841910976.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((!("((p141>=1)&&(l1708>=1))"))U((X("((p141>=1)&&(l1708>=1))"))U(!(F("((s1>=1)&&(l222>=1))"))))))
Formula 0 simplified : !(!"((p141>=1)&&(l1708>=1))" U (X"((p141>=1)&&(l1708>=1))" U !F"((s1>=1)&&(l222>=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-d2m64"
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-d2m64, 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-165472283000972"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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