Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r395-smll-171683823900073.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is SieveSingleMsgMbox-PT-d2m18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-smll-171683823900073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 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-d2m18-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716936819658

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m18
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 22:53:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 22:53:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:53:43] [INFO ] Load time of PNML (sax parser for PT used): 315 ms
[2024-05-28 22:53:43] [INFO ] Transformed 2398 places.
[2024-05-28 22:53:43] [INFO ] Transformed 1954 transitions.
[2024-05-28 22:53:43] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 452 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1984 places in 20 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 954 place count 288 transition count 647
Iterating global reduction 1 with 101 rules applied. Total rules applied 1055 place count 288 transition count 647
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1065 place count 288 transition count 637
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 1139 place count 214 transition count 563
Iterating global reduction 2 with 74 rules applied. Total rules applied 1213 place count 214 transition count 563
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1252 place count 214 transition count 524
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1277 place count 189 transition count 495
Iterating global reduction 3 with 25 rules applied. Total rules applied 1302 place count 189 transition count 495
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 3 with 73 rules applied. Total rules applied 1375 place count 189 transition count 422
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1381 place count 183 transition count 412
Iterating global reduction 4 with 6 rules applied. Total rules applied 1387 place count 183 transition count 412
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1393 place count 177 transition count 406
Iterating global reduction 4 with 6 rules applied. Total rules applied 1399 place count 177 transition count 406
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1402 place count 174 transition count 402
Iterating global reduction 4 with 3 rules applied. Total rules applied 1405 place count 174 transition count 402
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1407 place count 172 transition count 400
Iterating global reduction 4 with 2 rules applied. Total rules applied 1409 place count 172 transition count 400
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1411 place count 170 transition count 398
Iterating global reduction 4 with 2 rules applied. Total rules applied 1413 place count 170 transition count 398
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1414 place count 169 transition count 397
Iterating global reduction 4 with 1 rules applied. Total rules applied 1415 place count 169 transition count 397
Applied a total of 1415 rules in 146 ms. Remains 169 /414 variables (removed 245) and now considering 397/1954 (removed 1557) transitions.
// Phase 1: matrix 397 rows 169 cols
[2024-05-28 22:53:43] [INFO ] Computed 5 invariants in 29 ms
[2024-05-28 22:53:44] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-28 22:53:44] [INFO ] Invariant cache hit.
[2024-05-28 22:53:44] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-28 22:53:45] [INFO ] Implicit Places using invariants and state equation in 1380 ms returned []
Implicit Place search using SMT with State Equation took 1814 ms to find 0 implicit places.
[2024-05-28 22:53:45] [INFO ] Invariant cache hit.
[2024-05-28 22:53:46] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/414 places, 397/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2304 ms. Remains : 169/414 places, 397/1954 transitions.
Support contains 23 out of 169 places after structural reductions.
[2024-05-28 22:53:46] [INFO ] Flatten gal took : 116 ms
[2024-05-28 22:53:46] [INFO ] Flatten gal took : 69 ms
[2024-05-28 22:53:46] [INFO ] Input system was already deterministic with 397 transitions.
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 945 ms. (steps per millisecond=10 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 178611 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{0=1, 4=1, 6=1, 8=1, 9=1, 10=1, 11=1, 14=1, 15=1, 16=1, 18=1, 23=1, 24=1}
Probabilistic random walk after 178611 steps, saw 82631 distinct states, run finished after 3002 ms. (steps per millisecond=59 ) properties seen :13
Running SMT prover for 12 properties.
[2024-05-28 22:53:51] [INFO ] Invariant cache hit.
[2024-05-28 22:53:51] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 22:53:51] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-28 22:53:52] [INFO ] After 1175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-28 22:53:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 22:53:52] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 22:53:53] [INFO ] After 789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-28 22:53:53] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-28 22:53:55] [INFO ] After 2143ms SMT Verify possible using 267 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-28 22:53:56] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 8 ms to minimize.
[2024-05-28 22:53:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2024-05-28 22:53:59] [INFO ] After 5616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 3090 ms.
[2024-05-28 22:54:02] [INFO ] After 9708ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 688 ms.
Support contains 13 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 397/397 transitions.
Graph (complete) has 664 edges and 169 vertex of which 168 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 168 transition count 395
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 160 transition count 291
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 160 transition count 291
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 27 place count 152 transition count 283
Iterating global reduction 1 with 8 rules applied. Total rules applied 35 place count 152 transition count 283
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 41 place count 152 transition count 277
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 148 transition count 269
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 148 transition count 269
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 148 transition count 267
Applied a total of 51 rules in 67 ms. Remains 148 /169 variables (removed 21) and now considering 267/397 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 148/169 places, 267/397 transitions.
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 500 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 429 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 269345 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{2=1}
Probabilistic random walk after 269345 steps, saw 118835 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :1
Running SMT prover for 11 properties.
// Phase 1: matrix 267 rows 148 cols
[2024-05-28 22:54:07] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 22:54:07] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 22:54:07] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-28 22:54:08] [INFO ] After 1067ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-28 22:54:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 22:54:08] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 22:54:09] [INFO ] After 781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-28 22:54:09] [INFO ] State equation strengthened by 159 read => feed constraints.
[2024-05-28 22:54:10] [INFO ] After 1229ms SMT Verify possible using 159 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-28 22:54:11] [INFO ] After 2524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1425 ms.
[2024-05-28 22:54:13] [INFO ] After 4917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 337 ms.
Support contains 12 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 267/267 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 147 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 147 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 146 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 146 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 145 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 145 transition count 251
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 145 transition count 250
Applied a total of 7 rules in 39 ms. Remains 145 /148 variables (removed 3) and now considering 250/267 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 145/148 places, 250/267 transitions.
Incomplete random walk after 10000 steps, including 2248 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 452 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 456 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 460 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 231762 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 231762 steps, saw 101186 distinct states, run finished after 3006 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 250 rows 145 cols
[2024-05-28 22:54:17] [INFO ] Computed 4 invariants in 7 ms
[2024-05-28 22:54:18] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 22:54:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-28 22:54:18] [INFO ] After 894ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-28 22:54:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 22:54:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 22:54:19] [INFO ] After 700ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-28 22:54:19] [INFO ] State equation strengthened by 145 read => feed constraints.
[2024-05-28 22:54:20] [INFO ] After 1271ms SMT Verify possible using 145 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-28 22:54:21] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:54:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-05-28 22:54:22] [INFO ] After 3102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1981 ms.
[2024-05-28 22:54:24] [INFO ] After 5948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 256 ms.
Support contains 12 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 250/250 transitions.
Applied a total of 0 rules in 23 ms. Remains 145 /145 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 145/145 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 250/250 transitions.
Applied a total of 0 rules in 13 ms. Remains 145 /145 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-28 22:54:25] [INFO ] Invariant cache hit.
[2024-05-28 22:54:25] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-28 22:54:25] [INFO ] Invariant cache hit.
[2024-05-28 22:54:25] [INFO ] State equation strengthened by 145 read => feed constraints.
[2024-05-28 22:54:26] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
[2024-05-28 22:54:26] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-28 22:54:26] [INFO ] Invariant cache hit.
[2024-05-28 22:54:26] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1173 ms. Remains : 145/145 places, 250/250 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 145 transition count 243
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 139 transition count 243
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 13 place count 139 transition count 227
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 45 place count 123 transition count 227
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 69 place count 111 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 110 transition count 225
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 110 transition count 225
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 110 transition count 225
Applied a total of 74 rules in 42 ms. Remains 110 /145 variables (removed 35) and now considering 225/250 (removed 25) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 225 rows 110 cols
[2024-05-28 22:54:26] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 22:54:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:54:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-28 22:54:27] [INFO ] After 793ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-28 22:54:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:54:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:54:27] [INFO ] After 496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-28 22:54:27] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-05-28 22:54:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-28 22:54:27] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-28 22:54:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-28 22:54:28] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2024-05-28 22:54:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-28 22:54:28] [INFO ] After 1175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 433 ms.
[2024-05-28 22:54:28] [INFO ] After 1707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Computed a total of 36 stabilizing places and 61 stable transitions
Graph (complete) has 724 edges and 169 vertex of which 168 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 397/397 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 152 transition count 220
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 152 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 152 transition count 219
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 135 transition count 201
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 135 transition count 201
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 74 place count 135 transition count 196
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 87 place count 122 transition count 174
Iterating global reduction 2 with 13 rules applied. Total rules applied 100 place count 122 transition count 174
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 109 place count 122 transition count 165
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 119 transition count 162
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 119 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 116 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 116 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 115 transition count 158
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 115 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 114 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 114 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 113 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 113 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 112 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 112 transition count 153
Applied a total of 129 rules in 44 ms. Remains 112 /169 variables (removed 57) and now considering 153/397 (removed 244) transitions.
// Phase 1: matrix 153 rows 112 cols
[2024-05-28 22:54:29] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 22:54:29] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 22:54:29] [INFO ] Invariant cache hit.
[2024-05-28 22:54:29] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-28 22:54:29] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2024-05-28 22:54:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 22:54:29] [INFO ] Invariant cache hit.
[2024-05-28 22:54:29] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/169 places, 153/397 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 636 ms. Remains : 112/169 places, 153/397 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s106 1)), p1:(OR (LT s1 1) (LT s107 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 5 steps with 0 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-00 finished in 1028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U G(p2))&&p0))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 397/397 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 153 transition count 222
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 153 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 153 transition count 221
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 137 transition count 204
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 137 transition count 204
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 71 place count 137 transition count 198
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 84 place count 124 transition count 175
Iterating global reduction 2 with 13 rules applied. Total rules applied 97 place count 124 transition count 175
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 106 place count 124 transition count 166
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 110 place count 120 transition count 162
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 117 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 117 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 121 place count 116 transition count 158
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 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 125 place count 116 transition count 155
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 115 transition count 154
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 115 transition count 154
Applied a total of 127 rules in 41 ms. Remains 115 /169 variables (removed 54) and now considering 154/397 (removed 243) transitions.
// Phase 1: matrix 154 rows 115 cols
[2024-05-28 22:54:30] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 22:54:30] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-28 22:54:30] [INFO ] Invariant cache hit.
[2024-05-28 22:54:30] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 22:54:30] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2024-05-28 22:54:30] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 22:54:30] [INFO ] Invariant cache hit.
[2024-05-28 22:54:30] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/169 places, 154/397 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 691 ms. Remains : 115/169 places, 154/397 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s61 1)), p2:(AND (GEQ s1 1) (GEQ s109 1)), p1:(AND (GEQ s1 1) (GEQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-01 finished in 902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((((!p0 U (p1||G(!p0))) U ((G(!p2)&&(!p0 U (p1||G(!p0))))||G((!p0 U (p1||G(!p0))))))||p3)))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 397/397 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 152 transition count 220
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 152 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 152 transition count 219
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 135 transition count 201
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 135 transition count 201
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 135 transition count 195
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 88 place count 122 transition count 173
Iterating global reduction 2 with 13 rules applied. Total rules applied 101 place count 122 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 110 place count 122 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 119 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 119 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 116 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 116 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 115 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 114 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 113 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 113 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 112 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 112 transition count 152
Applied a total of 130 rules in 38 ms. Remains 112 /169 variables (removed 57) and now considering 152/397 (removed 245) transitions.
// Phase 1: matrix 152 rows 112 cols
[2024-05-28 22:54:31] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 22:54:31] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 22:54:31] [INFO ] Invariant cache hit.
[2024-05-28 22:54:31] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-28 22:54:31] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2024-05-28 22:54:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 22:54:31] [INFO ] Invariant cache hit.
[2024-05-28 22:54:31] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/169 places, 152/397 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 625 ms. Remains : 112/169 places, 152/397 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) p2 (NOT p3) p0), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={1} source=0 dest: 2}], [{ cond=(OR (AND p1 p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NOT (OR (AND (GEQ s1 1) (GEQ s107 1)) (AND (GEQ s1 1) (GEQ s106 1)))) (NOT (AND (GEQ s1 1) (GEQ s107 1) (GEQ s1 1) (GEQ s95 1)))), p2:(AND (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22423 reset in 487 ms.
Product exploration explored 100000 steps with 22523 reset in 474 ms.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 378 edges and 112 vertex of which 111 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p3) (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 p2 (NOT p3)))), (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p3))))), (X (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 141 ms. Reduced automaton from 3 states, 10 edges and 4 AP (stutter insensitive) to 3 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) p2 (NOT p3) p0), (AND p0 (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 448 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 453 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 346255 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{2=1}
Probabilistic random walk after 346255 steps, saw 158044 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :1
Running SMT prover for 6 properties.
[2024-05-28 22:54:36] [INFO ] Invariant cache hit.
[2024-05-28 22:54:36] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 22:54:36] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 22:54:37] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2024-05-28 22:54:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-28 22:54:37] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 22:54:37] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-28 22:54:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-28 22:54:37] [INFO ] After 178ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2024-05-28 22:54:37] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 22:54:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-28 22:54:37] [INFO ] After 445ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 219 ms.
[2024-05-28 22:54:38] [INFO ] After 945ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 145 ms.
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 152/152 transitions.
Graph (complete) has 339 edges and 112 vertex of which 111 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 111 transition count 150
Applied a total of 3 rules in 7 ms. Remains 111 /112 variables (removed 1) and now considering 150/152 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 111/112 places, 150/152 transitions.
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 367368 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 367368 steps, saw 168668 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 150 rows 111 cols
[2024-05-28 22:54:41] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 22:54:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:54:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:54:41] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-28 22:54:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 22:54:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:54:42] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-28 22:54:42] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 22:54:42] [INFO ] After 166ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-28 22:54:42] [INFO ] After 370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 154 ms.
[2024-05-28 22:54:42] [INFO ] After 789ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 133 ms.
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 150/150 transitions.
Applied a total of 0 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 111/111 places, 150/150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 150/150 transitions.
Applied a total of 0 rules in 6 ms. Remains 111 /111 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-05-28 22:54:42] [INFO ] Invariant cache hit.
[2024-05-28 22:54:42] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-28 22:54:42] [INFO ] Invariant cache hit.
[2024-05-28 22:54:43] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 22:54:43] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2024-05-28 22:54:43] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 22:54:43] [INFO ] Invariant cache hit.
[2024-05-28 22:54:43] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 553 ms. Remains : 111/111 places, 150/150 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 111 transition count 143
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 105 transition count 143
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 105 transition count 126
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 88 transition count 126
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 61 place count 81 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 63 place count 80 transition count 129
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 80 transition count 129
Applied a total of 64 rules in 15 ms. Remains 80 /111 variables (removed 31) and now considering 129/150 (removed 21) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 129 rows 80 cols
[2024-05-28 22:54:43] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:54:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:54:43] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 22:54:43] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-28 22:54:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:54:43] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:54:43] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-28 22:54:43] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 22:54:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-28 22:54:43] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 101 ms.
[2024-05-28 22:54:44] [INFO ] After 455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p3) (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 p2 (NOT p3)))), (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p3))))), (X (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3) p0)))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0)))))]
Knowledge based reduction with 17 factoid took 184 ms. Reduced automaton from 3 states, 10 edges and 4 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND p0 (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND p0 (NOT p3) (NOT p1))]
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 152/152 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 152/152 (removed 0) transitions.
// Phase 1: matrix 152 rows 112 cols
[2024-05-28 22:54:44] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 22:54:44] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 22:54:44] [INFO ] Invariant cache hit.
[2024-05-28 22:54:44] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-28 22:54:44] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2024-05-28 22:54:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 22:54:44] [INFO ] Invariant cache hit.
[2024-05-28 22:54:44] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 552 ms. Remains : 112/112 places, 152/152 transitions.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 378 edges and 112 vertex of which 111 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND p0 (NOT p3) (NOT p1))]
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1980699 steps, run timeout after 3001 ms. (steps per millisecond=660 ) properties seen :{0=1}
Probabilistic random walk after 1980699 steps, saw 894184 distinct states, run finished after 3001 ms. (steps per millisecond=660 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-28 22:54:48] [INFO ] Invariant cache hit.
[2024-05-28 22:54:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:54:48] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 22:54:48] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:54:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:54:48] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 22:54:48] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 22:54:48] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-28 22:54:48] [INFO ] After 46ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 22:54:48] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-28 22:54:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-28 22:54:48] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-28 22:54:48] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 152/152 transitions.
Graph (complete) has 339 edges and 112 vertex of which 111 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 111 transition count 150
Applied a total of 3 rules in 6 ms. Remains 111 /112 variables (removed 1) and now considering 150/152 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 111/112 places, 150/152 transitions.
Incomplete random walk after 10000 steps, including 2215 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2009903 steps, run timeout after 3001 ms. (steps per millisecond=669 ) properties seen :{}
Probabilistic random walk after 2009903 steps, saw 906569 distinct states, run finished after 3001 ms. (steps per millisecond=669 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 150 rows 111 cols
[2024-05-28 22:54:51] [INFO ] Computed 4 invariants in 5 ms
[2024-05-28 22:54:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:54:51] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:54:51] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:54:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:54:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:54:52] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 22:54:52] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 22:54:52] [INFO ] After 43ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 22:54:52] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 22:54:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-28 22:54:52] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-28 22:54:52] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 150/150 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 111/111 places, 150/150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 150/150 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-05-28 22:54:52] [INFO ] Invariant cache hit.
[2024-05-28 22:54:52] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 22:54:52] [INFO ] Invariant cache hit.
[2024-05-28 22:54:52] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 22:54:52] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-05-28 22:54:52] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 22:54:52] [INFO ] Invariant cache hit.
[2024-05-28 22:54:52] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 558 ms. Remains : 111/111 places, 150/150 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 111 transition count 143
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 105 transition count 143
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 105 transition count 126
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 88 transition count 126
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 61 place count 81 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 80 transition count 129
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 80 transition count 129
Applied a total of 64 rules in 16 ms. Remains 80 /111 variables (removed 31) and now considering 129/150 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 129 rows 80 cols
[2024-05-28 22:54:52] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 22:54:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:54:52] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:54:52] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:54:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 22:54:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:54:53] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 22:54:53] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-28 22:54:53] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) p1))))]
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND p0 (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND p0 (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 43 ms :[(AND p0 (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 22427 reset in 183 ms.
Product exploration explored 100000 steps with 22453 reset in 187 ms.
Built C files in :
/tmp/ltsmin16578913002582798586
[2024-05-28 22:54:53] [INFO ] Computing symmetric may disable matrix : 152 transitions.
[2024-05-28 22:54:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:54:53] [INFO ] Computing symmetric may enable matrix : 152 transitions.
[2024-05-28 22:54:53] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:54:53] [INFO ] Computing Do-Not-Accords matrix : 152 transitions.
[2024-05-28 22:54:53] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:54:53] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16578913002582798586
Running compilation step : cd /tmp/ltsmin16578913002582798586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 617 ms.
Running link step : cd /tmp/ltsmin16578913002582798586;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16578913002582798586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased500874246335519022.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 152/152 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 152/152 (removed 0) transitions.
// Phase 1: matrix 152 rows 112 cols
[2024-05-28 22:55:08] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 22:55:09] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-28 22:55:09] [INFO ] Invariant cache hit.
[2024-05-28 22:55:09] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-28 22:55:09] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-05-28 22:55:09] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 22:55:09] [INFO ] Invariant cache hit.
[2024-05-28 22:55:09] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 765 ms. Remains : 112/112 places, 152/152 transitions.
Built C files in :
/tmp/ltsmin5554691893546029614
[2024-05-28 22:55:09] [INFO ] Computing symmetric may disable matrix : 152 transitions.
[2024-05-28 22:55:09] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:55:09] [INFO ] Computing symmetric may enable matrix : 152 transitions.
[2024-05-28 22:55:09] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:55:09] [INFO ] Computing Do-Not-Accords matrix : 152 transitions.
[2024-05-28 22:55:09] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:55:09] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5554691893546029614
Running compilation step : cd /tmp/ltsmin5554691893546029614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 641 ms.
Running link step : cd /tmp/ltsmin5554691893546029614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5554691893546029614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18016640755607714866.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 22:55:24] [INFO ] Flatten gal took : 15 ms
[2024-05-28 22:55:24] [INFO ] Flatten gal took : 13 ms
[2024-05-28 22:55:24] [INFO ] Time to serialize gal into /tmp/LTL15856199950934676873.gal : 4 ms
[2024-05-28 22:55:24] [INFO ] Time to serialize properties into /tmp/LTL2264959376930133430.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15856199950934676873.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1319943941938967624.hoa' '-atoms' '/tmp/LTL2264959376930133430.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2264959376930133430.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1319943941938967624.hoa
Detected timeout of ITS tools.
[2024-05-28 22:55:40] [INFO ] Flatten gal took : 12 ms
[2024-05-28 22:55:40] [INFO ] Flatten gal took : 11 ms
[2024-05-28 22:55:40] [INFO ] Time to serialize gal into /tmp/LTL15078352345551317029.gal : 2 ms
[2024-05-28 22:55:40] [INFO ] Time to serialize properties into /tmp/LTL1433948869322077789.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15078352345551317029.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1433948869322077789.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((((!("(((s1>=1)&&(l2237>=1))&&((s1>=1)&&(l1699>=1)))"))U(("((!(((s1>=1)&&(l2237>=1))||((s1>=1)&&(l2220>=1))))&&(!(((s1>=1)&&(l223...767
Formula 0 simplified : G(!"((s1>=1)&&(l2220>=1))" & (("(((s1>=1)&&(l2237>=1))&&((s1>=1)&&(l1699>=1)))" M !"((!(((s1>=1)&&(l2237>=1))||((s1>=1)&&(l2220>=1))...567
Detected timeout of ITS tools.
[2024-05-28 22:55:55] [INFO ] Flatten gal took : 12 ms
[2024-05-28 22:55:55] [INFO ] Applying decomposition
[2024-05-28 22:55:55] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph259459767740752474.txt' '-o' '/tmp/graph259459767740752474.bin' '-w' '/tmp/graph259459767740752474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph259459767740752474.bin' '-l' '-1' '-v' '-w' '/tmp/graph259459767740752474.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:55:55] [INFO ] Decomposing Gal with order
[2024-05-28 22:55:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:55:55] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-28 22:55:55] [INFO ] Flatten gal took : 85 ms
[2024-05-28 22:55:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 32 ms.
[2024-05-28 22:55:55] [INFO ] Time to serialize gal into /tmp/LTL1872052367190521649.gal : 8 ms
[2024-05-28 22:55:55] [INFO ] Time to serialize properties into /tmp/LTL7655374115297625565.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1872052367190521649.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7655374115297625565.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((((!("(((u0.s1>=1)&&(u0.l2237>=1))&&((u0.s1>=1)&&(u2.l1699>=1)))"))U(("((!(((u0.s1>=1)&&(u0.l2237>=1))||((u0.s1>=1)&&(u0.l2220>=1...923
Formula 0 simplified : G(!"((u0.s1>=1)&&(u0.l2220>=1))" & (("(((u0.s1>=1)&&(u0.l2237>=1))&&((u0.s1>=1)&&(u2.l1699>=1)))" M !"((!(((u0.s1>=1)&&(u0.l2237>=1)...687
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15790226543998103181
[2024-05-28 22:56:10] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15790226543998103181
Running compilation step : cd /tmp/ltsmin15790226543998103181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 449 ms.
Running link step : cd /tmp/ltsmin15790226543998103181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15790226543998103181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))) U (([](!(LTLAPp2==true))&&(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||[]((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))))||(LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-02 finished in 114584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((F(p1)||(!p2 U (p3||G(!p2)))))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 397/397 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 152 transition count 220
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 152 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 152 transition count 219
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 135 transition count 201
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 135 transition count 201
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 135 transition count 195
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 88 place count 122 transition count 173
Iterating global reduction 2 with 13 rules applied. Total rules applied 101 place count 122 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 110 place count 122 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 119 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 119 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 116 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 116 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 115 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 114 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 113 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 113 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 112 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 112 transition count 152
Applied a total of 130 rules in 15 ms. Remains 112 /169 variables (removed 57) and now considering 152/397 (removed 245) transitions.
[2024-05-28 22:56:25] [INFO ] Invariant cache hit.
[2024-05-28 22:56:25] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-28 22:56:25] [INFO ] Invariant cache hit.
[2024-05-28 22:56:25] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-28 22:56:26] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-05-28 22:56:26] [INFO ] Invariant cache hit.
[2024-05-28 22:56:26] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/169 places, 152/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 686 ms. Remains : 112/169 places, 152/397 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3) p2), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s107 1)), p1:(AND (OR (LT s1 1) (LT s107 1)) (OR (LT s1 1) (LT s106 1))), p3:(AND (NOT (AND (GEQ s1 1) (GEQ s106 1))) (NOT (AND (G...], 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 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-04 finished in 938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 397/397 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 152 transition count 208
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 152 transition count 208
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 135 transition count 191
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 135 transition count 191
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 75 place count 135 transition count 184
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 88 place count 122 transition count 161
Iterating global reduction 1 with 13 rules applied. Total rules applied 101 place count 122 transition count 161
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 111 place count 122 transition count 151
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 119 transition count 148
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 119 transition count 148
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 120 place count 116 transition count 145
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 116 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 115 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 115 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 115 transition count 142
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 114 transition count 141
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 114 transition count 141
Applied a total of 129 rules in 19 ms. Remains 114 /169 variables (removed 55) and now considering 141/397 (removed 256) transitions.
// Phase 1: matrix 141 rows 114 cols
[2024-05-28 22:56:26] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 22:56:26] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-28 22:56:26] [INFO ] Invariant cache hit.
[2024-05-28 22:56:26] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-28 22:56:27] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2024-05-28 22:56:27] [INFO ] Invariant cache hit.
[2024-05-28 22:56:27] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/169 places, 141/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 889 ms. Remains : 114/169 places, 141/397 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s1 1) (LT s109 1)) (OR (LT s1 1) (LT s51 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 22290 reset in 415 ms.
Product exploration explored 100000 steps with 22575 reset in 303 ms.
Computed a total of 28 stabilizing places and 35 stable transitions
Graph (complete) has 373 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 28 stabilizing places and 35 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1628758 steps, run timeout after 3001 ms. (steps per millisecond=542 ) properties seen :{}
Probabilistic random walk after 1628758 steps, saw 702226 distinct states, run finished after 3001 ms. (steps per millisecond=542 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 22:56:31] [INFO ] Invariant cache hit.
[2024-05-28 22:56:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:56:31] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 22:56:32] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:56:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:56:32] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 22:56:32] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 22:56:32] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-28 22:56:32] [INFO ] After 87ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 22:56:32] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-28 22:56:32] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 141/141 transitions.
Graph (complete) has 334 edges and 114 vertex of which 113 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 113 transition count 139
Applied a total of 3 rules in 9 ms. Remains 113 /114 variables (removed 1) and now considering 139/141 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 113/114 places, 139/141 transitions.
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1908855 steps, run timeout after 3001 ms. (steps per millisecond=636 ) properties seen :{}
Probabilistic random walk after 1908855 steps, saw 821406 distinct states, run finished after 3001 ms. (steps per millisecond=636 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 139 rows 113 cols
[2024-05-28 22:56:35] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:56:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:56:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:56:35] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:56:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:56:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:56:35] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 22:56:35] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 22:56:35] [INFO ] After 61ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 22:56:35] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2024-05-28 22:56:36] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 139/139 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 113/113 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 139/139 transitions.
Applied a total of 0 rules in 5 ms. Remains 113 /113 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-05-28 22:56:36] [INFO ] Invariant cache hit.
[2024-05-28 22:56:36] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-28 22:56:36] [INFO ] Invariant cache hit.
[2024-05-28 22:56:36] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 22:56:36] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2024-05-28 22:56:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 22:56:36] [INFO ] Invariant cache hit.
[2024-05-28 22:56:36] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 774 ms. Remains : 113/113 places, 139/139 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 113 transition count 132
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 107 transition count 132
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 13 place count 107 transition count 113
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 51 place count 88 transition count 113
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 63 place count 82 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 81 transition count 116
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 81 transition count 116
Applied a total of 67 rules in 18 ms. Remains 81 /113 variables (removed 32) and now considering 116/139 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 116 rows 81 cols
[2024-05-28 22:56:36] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 22:56:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:56:36] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:56:37] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:56:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:56:37] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:56:37] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 22:56:37] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-28 22:56:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-28 22:56:37] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-28 22:56:37] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 141/141 transitions.
Applied a total of 0 rules in 1 ms. Remains 114 /114 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 114 cols
[2024-05-28 22:56:37] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 22:56:37] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-28 22:56:37] [INFO ] Invariant cache hit.
[2024-05-28 22:56:38] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-28 22:56:38] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2024-05-28 22:56:38] [INFO ] Invariant cache hit.
[2024-05-28 22:56:38] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 925 ms. Remains : 114/114 places, 141/141 transitions.
Computed a total of 28 stabilizing places and 35 stable transitions
Graph (complete) has 373 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 28 stabilizing places and 35 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2220 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1758122 steps, run timeout after 3001 ms. (steps per millisecond=585 ) properties seen :{}
Probabilistic random walk after 1758122 steps, saw 757887 distinct states, run finished after 3004 ms. (steps per millisecond=585 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 22:56:42] [INFO ] Invariant cache hit.
[2024-05-28 22:56:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:56:42] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 22:56:42] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:56:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:56:42] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 22:56:42] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 22:56:42] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-28 22:56:42] [INFO ] After 88ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 22:56:42] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-28 22:56:42] [INFO ] After 429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 141/141 transitions.
Graph (complete) has 334 edges and 114 vertex of which 113 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 113 transition count 139
Applied a total of 3 rules in 6 ms. Remains 113 /114 variables (removed 1) and now considering 139/141 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 113/114 places, 139/141 transitions.
Incomplete random walk after 10000 steps, including 2206 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1958551 steps, run timeout after 3001 ms. (steps per millisecond=652 ) properties seen :{}
Probabilistic random walk after 1958551 steps, saw 841652 distinct states, run finished after 3004 ms. (steps per millisecond=651 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 139 rows 113 cols
[2024-05-28 22:56:45] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:56:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:56:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:56:45] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:56:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 22:56:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:56:46] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 22:56:46] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 22:56:46] [INFO ] After 37ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 22:56:46] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-28 22:56:46] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 139/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 113/113 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 139/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-05-28 22:56:46] [INFO ] Invariant cache hit.
[2024-05-28 22:56:46] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 22:56:46] [INFO ] Invariant cache hit.
[2024-05-28 22:56:46] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 22:56:46] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2024-05-28 22:56:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 22:56:46] [INFO ] Invariant cache hit.
[2024-05-28 22:56:46] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 699 ms. Remains : 113/113 places, 139/139 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 113 transition count 132
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 107 transition count 132
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 13 place count 107 transition count 113
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 51 place count 88 transition count 113
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 63 place count 82 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 81 transition count 116
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 81 transition count 116
Applied a total of 67 rules in 24 ms. Remains 81 /113 variables (removed 32) and now considering 116/139 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 116 rows 81 cols
[2024-05-28 22:56:46] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 22:56:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:56:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:56:47] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:56:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:56:47] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:56:47] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 22:56:47] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-28 22:56:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-28 22:56:47] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-28 22:56:47] [INFO ] After 307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22381 reset in 261 ms.
Product exploration explored 100000 steps with 22365 reset in 187 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 141/141 transitions.
Applied a total of 0 rules in 4 ms. Remains 114 /114 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2024-05-28 22:56:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 141 rows 114 cols
[2024-05-28 22:56:48] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 22:56:48] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 114/114 places, 141/141 transitions.
Built C files in :
/tmp/ltsmin8945213938780787150
[2024-05-28 22:56:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8945213938780787150
Running compilation step : cd /tmp/ltsmin8945213938780787150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 431 ms.
Running link step : cd /tmp/ltsmin8945213938780787150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin8945213938780787150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9387066928249261220.hoa' '--buchi-type=spotba'
LTSmin run took 364 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-05 finished in 23197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(G(p1))))))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 397/397 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 152 transition count 220
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 152 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 152 transition count 219
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 135 transition count 201
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 135 transition count 201
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 135 transition count 195
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 88 place count 122 transition count 173
Iterating global reduction 2 with 13 rules applied. Total rules applied 101 place count 122 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 110 place count 122 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 119 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 119 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 116 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 116 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 115 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 114 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 113 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 113 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 112 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 112 transition count 152
Applied a total of 130 rules in 18 ms. Remains 112 /169 variables (removed 57) and now considering 152/397 (removed 245) transitions.
// Phase 1: matrix 152 rows 112 cols
[2024-05-28 22:56:49] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 22:56:49] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-28 22:56:49] [INFO ] Invariant cache hit.
[2024-05-28 22:56:50] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-28 22:56:50] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2024-05-28 22:56:50] [INFO ] Invariant cache hit.
[2024-05-28 22:56:50] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/169 places, 152/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 765 ms. Remains : 112/169 places, 152/397 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[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, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-07 finished in 937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0)))) U (X(p1) U (p1||F(p2)))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 397/397 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 153 transition count 233
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 153 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 153 transition count 232
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 137 transition count 215
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 137 transition count 215
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 71 place count 137 transition count 209
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 83 place count 125 transition count 189
Iterating global reduction 2 with 12 rules applied. Total rules applied 95 place count 125 transition count 189
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 103 place count 125 transition count 181
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 123 transition count 179
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 123 transition count 179
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 121 transition count 177
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 121 transition count 177
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 120 transition count 176
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 120 transition count 176
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 119 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 119 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 118 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 118 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 117 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 117 transition count 171
Applied a total of 119 rules in 19 ms. Remains 117 /169 variables (removed 52) and now considering 171/397 (removed 226) transitions.
// Phase 1: matrix 171 rows 117 cols
[2024-05-28 22:56:50] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 22:56:50] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-28 22:56:50] [INFO ] Invariant cache hit.
[2024-05-28 22:56:50] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-28 22:56:51] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2024-05-28 22:56:51] [INFO ] Invariant cache hit.
[2024-05-28 22:56:51] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/169 places, 171/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 823 ms. Remains : 117/169 places, 171/397 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s110 1)), p2:(AND (GEQ s1 1) (GEQ s111 1)), p0:(AND (GEQ s1 1) (GEQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-09 finished in 1030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||X(F(p0)))))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 397/397 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 152 transition count 210
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 152 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 152 transition count 208
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 53 place count 135 transition count 190
Iterating global reduction 1 with 17 rules applied. Total rules applied 70 place count 135 transition count 190
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 76 place count 135 transition count 184
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 89 place count 122 transition count 161
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 122 transition count 161
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 111 place count 122 transition count 152
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 118 transition count 148
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 118 transition count 148
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 122 place count 115 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 115 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 114 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 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 129 place count 114 transition count 142
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 113 transition count 141
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 113 transition count 141
Applied a total of 131 rules in 18 ms. Remains 113 /169 variables (removed 56) and now considering 141/397 (removed 256) transitions.
// Phase 1: matrix 141 rows 113 cols
[2024-05-28 22:56:51] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 22:56:51] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-28 22:56:51] [INFO ] Invariant cache hit.
[2024-05-28 22:56:51] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-28 22:56:52] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2024-05-28 22:56:52] [INFO ] Invariant cache hit.
[2024-05-28 22:56:52] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/169 places, 141/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 689 ms. Remains : 113/169 places, 141/397 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s60 1)), p0:(AND (GEQ s1 1) (GEQ s108 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 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-11 finished in 813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 397/397 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 152 transition count 209
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 152 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 152 transition count 208
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 135 transition count 190
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 135 transition count 190
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 76 place count 135 transition count 183
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 89 place count 122 transition count 160
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 122 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 111 place count 122 transition count 151
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 114 place count 119 transition count 148
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 119 transition count 148
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 116 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 116 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 114 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 114 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 114 transition count 141
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 113 transition count 140
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 113 transition count 140
Applied a total of 131 rules in 26 ms. Remains 113 /169 variables (removed 56) and now considering 140/397 (removed 257) transitions.
// Phase 1: matrix 140 rows 113 cols
[2024-05-28 22:56:52] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 22:56:52] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 22:56:52] [INFO ] Invariant cache hit.
[2024-05-28 22:56:52] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-28 22:56:53] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-05-28 22:56:53] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 22:56:53] [INFO ] Invariant cache hit.
[2024-05-28 22:56:53] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/169 places, 140/397 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 731 ms. Remains : 113/169 places, 140/397 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s60 1)) (AND (GEQ s1 1) (GEQ s108 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-12 finished in 793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U G(p2))&&p0)))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 397/397 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 152 transition count 220
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 152 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 152 transition count 219
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 135 transition count 201
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 135 transition count 201
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 76 place count 135 transition count 194
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 89 place count 122 transition count 172
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 122 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 111 place count 122 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 114 place count 119 transition count 160
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 119 transition count 160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 116 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 116 transition count 157
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 114 transition count 155
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 114 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 130 place count 114 transition count 152
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 132 place count 112 transition count 148
Iterating global reduction 4 with 2 rules applied. Total rules applied 134 place count 112 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 111 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 111 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 110 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 110 transition count 146
Applied a total of 138 rules in 25 ms. Remains 110 /169 variables (removed 59) and now considering 146/397 (removed 251) transitions.
// Phase 1: matrix 146 rows 110 cols
[2024-05-28 22:56:53] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 22:56:53] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-28 22:56:53] [INFO ] Invariant cache hit.
[2024-05-28 22:56:53] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-28 22:56:54] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2024-05-28 22:56:54] [INFO ] Invariant cache hit.
[2024-05-28 22:56:54] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/169 places, 146/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 841 ms. Remains : 110/169 places, 146/397 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s105 1)), p2:(AND (GEQ s1 1) (GEQ s105 1)), p1:(AND (GEQ s1 1) (GEQ s104 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-14 finished in 1101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0&&X((!p0 U (!p1||G(!p0))))))))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 397/397 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 151 transition count 207
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 151 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 151 transition count 206
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 55 place count 133 transition count 187
Iterating global reduction 1 with 18 rules applied. Total rules applied 73 place count 133 transition count 187
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 79 place count 133 transition count 181
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 93 place count 119 transition count 157
Iterating global reduction 2 with 14 rules applied. Total rules applied 107 place count 119 transition count 157
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 117 place count 119 transition count 147
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 121 place count 115 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 115 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 111 transition count 139
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 111 transition count 139
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 109 transition count 137
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 109 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 139 place count 109 transition count 135
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 141 place count 107 transition count 131
Iterating global reduction 4 with 2 rules applied. Total rules applied 143 place count 107 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 144 place count 106 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 146 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 105 transition count 129
Applied a total of 147 rules in 27 ms. Remains 105 /169 variables (removed 64) and now considering 129/397 (removed 268) transitions.
// Phase 1: matrix 129 rows 105 cols
[2024-05-28 22:56:54] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 22:56:54] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-28 22:56:54] [INFO ] Invariant cache hit.
[2024-05-28 22:56:54] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 22:56:55] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2024-05-28 22:56:55] [INFO ] Invariant cache hit.
[2024-05-28 22:56:55] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/169 places, 129/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 824 ms. Remains : 105/169 places, 129/397 transitions.
Stuttering acceptance computed with spot in 149 ms :[p0, p0, (AND p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s100 1)), p1:(AND (GEQ s1 1) (GEQ s90 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]]
Product exploration explored 100000 steps with 33333 reset in 420 ms.
Product exploration explored 100000 steps with 33333 reset in 374 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-15 finished in 1924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((((!p0 U (p1||G(!p0))) U ((G(!p2)&&(!p0 U (p1||G(!p0))))||G((!p0 U (p1||G(!p0))))))||p3)))'
[2024-05-28 22:56:56] [INFO ] Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16815031716169819651
[2024-05-28 22:56:56] [INFO ] Computing symmetric may disable matrix : 397 transitions.
[2024-05-28 22:56:56] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:56:56] [INFO ] Applying decomposition
[2024-05-28 22:56:56] [INFO ] Computing symmetric may enable matrix : 397 transitions.
[2024-05-28 22:56:56] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:56:56] [INFO ] Flatten gal took : 43 ms
[2024-05-28 22:56:56] [INFO ] Computing Do-Not-Accords matrix : 397 transitions.
[2024-05-28 22:56:56] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13045186133616555510.txt' '-o' '/tmp/graph13045186133616555510.bin' '-w' '/tmp/graph13045186133616555510.weights'
[2024-05-28 22:56:56] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16815031716169819651
Running compilation step : cd /tmp/ltsmin16815031716169819651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13045186133616555510.bin' '-l' '-1' '-v' '-w' '/tmp/graph13045186133616555510.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:56:56] [INFO ] Decomposing Gal with order
[2024-05-28 22:56:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:56:56] [INFO ] Removed a total of 185 redundant transitions.
[2024-05-28 22:56:56] [INFO ] Flatten gal took : 57 ms
[2024-05-28 22:56:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 11 ms.
[2024-05-28 22:56:56] [INFO ] Time to serialize gal into /tmp/LTLFireability15292545972116150518.gal : 8 ms
[2024-05-28 22:56:56] [INFO ] Time to serialize properties into /tmp/LTLFireability17869768245406437522.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15292545972116150518.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17869768245406437522.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F((((!("(((u0.s1>=1)&&(u0.l2237>=1))&&((u0.s1>=1)&&(u1.l1699>=1)))"))U(("((!(((u0.s1>=1)&&(u0.l2237>=1))||((u0.s1>=1)&&(u0.l2220>=1...923
Formula 0 simplified : G(!"((u0.s1>=1)&&(u0.l2220>=1))" & (("(((u0.s1>=1)&&(u0.l2237>=1))&&((u0.s1>=1)&&(u1.l1699>=1)))" M !"((!(((u0.s1>=1)&&(u0.l2237>=1)...687
Compilation finished in 1457 ms.
Running link step : cd /tmp/ltsmin16815031716169819651;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16815031716169819651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))) U (([](!(LTLAPp2==true))&&(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||[]((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))))||(LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 23:18:01] [INFO ] Flatten gal took : 73 ms
[2024-05-28 23:18:01] [INFO ] Time to serialize gal into /tmp/LTLFireability8744883168677110908.gal : 4 ms
[2024-05-28 23:18:01] [INFO ] Time to serialize properties into /tmp/LTLFireability11028439008447343054.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8744883168677110908.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11028439008447343054.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F((((!("(((s1>=1)&&(l2237>=1))&&((s1>=1)&&(l1699>=1)))"))U(("((!(((s1>=1)&&(l2237>=1))||((s1>=1)&&(l2220>=1))))&&(!(((s1>=1)&&(l223...767
Formula 0 simplified : G(!"((s1>=1)&&(l2220>=1))" & (("(((s1>=1)&&(l2237>=1))&&((s1>=1)&&(l1699>=1)))" M !"((!(((s1>=1)&&(l2237>=1))||((s1>=1)&&(l2220>=1))...567
LTSmin run took 1807448 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2002876 ms.

BK_STOP 1716938826929

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-d2m18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is SieveSingleMsgMbox-PT-d2m18, 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 r395-smll-171683823900073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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