Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905975300476.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d2m36, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975300476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 10:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679181932334

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m36
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 23:25:34] [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]
[2023-03-18 23:25:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:25:34] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-03-18 23:25:34] [INFO ] Transformed 2398 places.
[2023-03-18 23:25:34] [INFO ] Transformed 1954 transitions.
[2023-03-18 23:25:34] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1984 places in 36 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 952 place count 290 transition count 660
Iterating global reduction 1 with 99 rules applied. Total rules applied 1051 place count 290 transition count 660
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1060 place count 290 transition count 651
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 1135 place count 215 transition count 576
Iterating global reduction 2 with 75 rules applied. Total rules applied 1210 place count 215 transition count 576
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1246 place count 215 transition count 540
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1272 place count 189 transition count 510
Iterating global reduction 3 with 26 rules applied. Total rules applied 1298 place count 189 transition count 510
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 3 with 78 rules applied. Total rules applied 1376 place count 189 transition count 432
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1383 place count 182 transition count 420
Iterating global reduction 4 with 7 rules applied. Total rules applied 1390 place count 182 transition count 420
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1396 place count 176 transition count 414
Iterating global reduction 4 with 6 rules applied. Total rules applied 1402 place count 176 transition count 414
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1405 place count 173 transition count 410
Iterating global reduction 4 with 3 rules applied. Total rules applied 1408 place count 173 transition count 410
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1410 place count 171 transition count 408
Iterating global reduction 4 with 2 rules applied. Total rules applied 1412 place count 171 transition count 408
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1413 place count 170 transition count 407
Iterating global reduction 4 with 1 rules applied. Total rules applied 1414 place count 170 transition count 407
Applied a total of 1414 rules in 108 ms. Remains 170 /414 variables (removed 244) and now considering 407/1954 (removed 1547) transitions.
// Phase 1: matrix 407 rows 170 cols
[2023-03-18 23:25:35] [INFO ] Computed 5 place invariants in 17 ms
[2023-03-18 23:25:35] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-18 23:25:35] [INFO ] Invariant cache hit.
[2023-03-18 23:25:37] [INFO ] State equation strengthened by 277 read => feed constraints.
[2023-03-18 23:25:37] [INFO ] Implicit Places using invariants and state equation in 2306 ms returned []
Implicit Place search using SMT with State Equation took 2818 ms to find 0 implicit places.
[2023-03-18 23:25:37] [INFO ] Invariant cache hit.
[2023-03-18 23:25:38] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/414 places, 407/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3179 ms. Remains : 170/414 places, 407/1954 transitions.
Support contains 26 out of 170 places after structural reductions.
[2023-03-18 23:25:38] [INFO ] Flatten gal took : 87 ms
[2023-03-18 23:25:38] [INFO ] Flatten gal took : 23 ms
[2023-03-18 23:25:38] [INFO ] Input system was already deterministic with 407 transitions.
Support contains 25 out of 170 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 615 ms. (steps per millisecond=16 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 35 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 133300 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{4=1, 6=1, 8=1, 11=1, 12=1, 18=1, 21=1}
Probabilistic random walk after 133300 steps, saw 62491 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :7
Running SMT prover for 15 properties.
[2023-03-18 23:25:42] [INFO ] Invariant cache hit.
[2023-03-18 23:25:43] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-18 23:25:43] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-18 23:25:43] [INFO ] After 721ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-18 23:25:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:25:43] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 23:25:44] [INFO ] After 621ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-18 23:25:44] [INFO ] State equation strengthened by 277 read => feed constraints.
[2023-03-18 23:25:46] [INFO ] After 1960ms SMT Verify possible using 277 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-18 23:25:47] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 9 ms to minimize.
[2023-03-18 23:25:47] [INFO ] Deduced a trap composed of 47 places in 384 ms of which 1 ms to minimize.
[2023-03-18 23:25:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 532 ms
[2023-03-18 23:25:48] [INFO ] After 3998ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1643 ms.
[2023-03-18 23:25:49] [INFO ] After 6497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 365 ms.
Support contains 17 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 407/407 transitions.
Graph (complete) has 672 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 169 transition count 405
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 162 transition count 348
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 162 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 156 transition count 342
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 156 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 156 transition count 339
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 152 transition count 333
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 152 transition count 333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 152 transition count 331
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 151 transition count 330
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 151 transition count 330
Applied a total of 44 rules in 47 ms. Remains 151 /170 variables (removed 19) and now considering 330/407 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 151/170 places, 330/407 transitions.
Incomplete random walk after 10000 steps, including 2222 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 245083 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{0=1, 1=1, 6=1}
Probabilistic random walk after 245083 steps, saw 109925 distinct states, run finished after 3002 ms. (steps per millisecond=81 ) properties seen :3
Running SMT prover for 12 properties.
// Phase 1: matrix 330 rows 151 cols
[2023-03-18 23:25:53] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-18 23:25:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:25:54] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:25:54] [INFO ] After 695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 23:25:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:25:54] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-18 23:25:55] [INFO ] After 666ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-18 23:25:55] [INFO ] State equation strengthened by 218 read => feed constraints.
[2023-03-18 23:25:56] [INFO ] After 778ms SMT Verify possible using 218 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-18 23:25:56] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 2 ms to minimize.
[2023-03-18 23:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-18 23:25:57] [INFO ] After 1954ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 857 ms.
[2023-03-18 23:25:58] [INFO ] After 3689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 459 ms.
Support contains 15 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 330/330 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 149 transition count 304
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 149 transition count 304
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 147 transition count 302
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 147 transition count 302
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 145 transition count 298
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 145 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 145 transition count 296
Applied a total of 14 rules in 37 ms. Remains 145 /151 variables (removed 6) and now considering 296/330 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 145/151 places, 296/330 transitions.
Incomplete random walk after 10000 steps, including 2212 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 453 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 497 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 403 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 428 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 257361 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 257361 steps, saw 114673 distinct states, run finished after 3004 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 296 rows 145 cols
[2023-03-18 23:26:03] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-18 23:26:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:26:03] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:26:03] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 23:26:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:26:03] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:26:04] [INFO ] After 379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-18 23:26:04] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-18 23:26:04] [INFO ] After 626ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-18 23:26:05] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 2 ms to minimize.
[2023-03-18 23:26:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-18 23:26:06] [INFO ] After 1737ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 763 ms.
[2023-03-18 23:26:06] [INFO ] After 2957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 377 ms.
Support contains 15 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 296/296 transitions.
Applied a total of 0 rules in 14 ms. Remains 145 /145 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 145/145 places, 296/296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 296/296 transitions.
Applied a total of 0 rules in 13 ms. Remains 145 /145 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-18 23:26:07] [INFO ] Invariant cache hit.
[2023-03-18 23:26:07] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-18 23:26:07] [INFO ] Invariant cache hit.
[2023-03-18 23:26:08] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-18 23:26:15] [INFO ] Implicit Places using invariants and state equation in 8307 ms returned []
Implicit Place search using SMT with State Equation took 8436 ms to find 0 implicit places.
[2023-03-18 23:26:15] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-18 23:26:15] [INFO ] Invariant cache hit.
[2023-03-18 23:26:15] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8637 ms. Remains : 145/145 places, 296/296 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 145 transition count 291
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 141 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 140 transition count 290
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 11 place count 140 transition count 276
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 39 place count 126 transition count 276
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 67 place count 112 transition count 262
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 3 with 2 rules applied. Total rules applied 69 place count 111 transition count 272
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 111 transition count 271
Applied a total of 70 rules in 32 ms. Remains 111 /145 variables (removed 34) and now considering 271/296 (removed 25) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 271 rows 111 cols
[2023-03-18 23:26:15] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 23:26:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:26:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-18 23:26:16] [INFO ] After 693ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 23:26:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 26 ms returned sat
[2023-03-18 23:26:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-18 23:26:17] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-18 23:26:17] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2023-03-18 23:26:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-18 23:26:18] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2023-03-18 23:26:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-18 23:26:18] [INFO ] After 1105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 404 ms.
[2023-03-18 23:26:18] [INFO ] After 2306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 36 stabilizing places and 61 stable transitions
Graph (complete) has 734 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 149 transition count 202
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 130 transition count 183
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 130 transition count 183
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 130 transition count 175
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 102 place count 117 transition count 153
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 117 transition count 153
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 124 place count 117 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 128 place count 113 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 113 transition count 140
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 110 transition count 137
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 110 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 108 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 108 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 108 transition count 131
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 106 transition count 129
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 149 place count 105 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 105 transition count 128
Applied a total of 150 rules in 25 ms. Remains 105 /170 variables (removed 65) and now considering 128/407 (removed 279) transitions.
// Phase 1: matrix 128 rows 105 cols
[2023-03-18 23:26:19] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 23:26:19] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-18 23:26:19] [INFO ] Invariant cache hit.
[2023-03-18 23:26:19] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:26:19] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2023-03-18 23:26:19] [INFO ] Invariant cache hit.
[2023-03-18 23:26:19] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/170 places, 128/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 564 ms. Remains : 105/170 places, 128/407 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22318 reset in 325 ms.
Product exploration explored 100000 steps with 22647 reset in 228 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 342 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 177282 steps, run visited all 1 properties in 288 ms. (steps per millisecond=615 )
Probabilistic random walk after 177282 steps, saw 88429 distinct states, run finished after 290 ms. (steps per millisecond=611 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-18 23:26:21] [INFO ] Invariant cache hit.
[2023-03-18 23:26:21] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-18 23:26:21] [INFO ] Invariant cache hit.
[2023-03-18 23:26:21] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:26:22] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-18 23:26:22] [INFO ] Invariant cache hit.
[2023-03-18 23:26:22] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 498 ms. Remains : 105/105 places, 128/128 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 342 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 211 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2236 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 452 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Finished probabilistic random walk after 177282 steps, run visited all 1 properties in 597 ms. (steps per millisecond=296 )
Probabilistic random walk after 177282 steps, saw 88429 distinct states, run finished after 597 ms. (steps per millisecond=296 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 529 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22444 reset in 151 ms.
Product exploration explored 100000 steps with 22382 reset in 193 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 11 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-18 23:26:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:26:24] [INFO ] Invariant cache hit.
[2023-03-18 23:26:24] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 105/105 places, 128/128 transitions.
Built C files in :
/tmp/ltsmin16350663081278599658
[2023-03-18 23:26:24] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16350663081278599658
Running compilation step : cd /tmp/ltsmin16350663081278599658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 414 ms.
Running link step : cd /tmp/ltsmin16350663081278599658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16350663081278599658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2503494325569052612.hoa' '--buchi-type=spotba'
LTSmin run took 3535 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 finished in 9702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 150 transition count 216
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 150 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 150 transition count 215
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 59 place count 132 transition count 197
Iterating global reduction 1 with 18 rules applied. Total rules applied 77 place count 132 transition count 197
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 84 place count 132 transition count 190
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 96 place count 120 transition count 170
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 120 transition count 170
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 116 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 117 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 124 place count 115 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 114 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 113 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 113 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 112 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 112 transition count 152
Applied a total of 132 rules in 31 ms. Remains 112 /170 variables (removed 58) and now considering 152/407 (removed 255) transitions.
// Phase 1: matrix 152 rows 112 cols
[2023-03-18 23:26:28] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 23:26:29] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-18 23:26:29] [INFO ] Invariant cache hit.
[2023-03-18 23:26:29] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-18 23:26:29] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2023-03-18 23:26:29] [INFO ] Invariant cache hit.
[2023-03-18 23:26:29] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/170 places, 152/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 671 ms. Remains : 112/170 places, 152/407 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s107 1)), p1:(OR (LT s1 1) (LT s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 finished in 953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 149 transition count 202
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 130 transition count 183
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 130 transition count 183
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 130 transition count 176
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 117 transition count 154
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 117 transition count 154
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 117 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 113 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 113 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 110 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 108 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 105 transition count 129
Applied a total of 149 rules in 49 ms. Remains 105 /170 variables (removed 65) and now considering 129/407 (removed 278) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-18 23:26:29] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 23:26:29] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-18 23:26:30] [INFO ] Invariant cache hit.
[2023-03-18 23:26:30] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:26:30] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-18 23:26:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:26:30] [INFO ] Invariant cache hit.
[2023-03-18 23:26:30] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/170 places, 129/407 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 510 ms. Remains : 105/170 places, 129/407 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22600 reset in 232 ms.
Product exploration explored 100000 steps with 22438 reset in 267 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 376 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2186 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1275048 steps, run visited all 1 properties in 2098 ms. (steps per millisecond=607 )
Probabilistic random walk after 1275048 steps, saw 537553 distinct states, run finished after 2098 ms. (steps per millisecond=607 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-18 23:26:33] [INFO ] Invariant cache hit.
[2023-03-18 23:26:34] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-18 23:26:34] [INFO ] Invariant cache hit.
[2023-03-18 23:26:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:26:34] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-18 23:26:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:26:34] [INFO ] Invariant cache hit.
[2023-03-18 23:26:34] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 419 ms. Remains : 105/105 places, 129/129 transitions.
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.6 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2229 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 477 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1275048 steps, run visited all 1 properties in 1848 ms. (steps per millisecond=689 )
Probabilistic random walk after 1275048 steps, saw 537553 distinct states, run finished after 1848 ms. (steps per millisecond=689 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22501 reset in 153 ms.
Product exploration explored 100000 steps with 22349 reset in 146 ms.
Built C files in :
/tmp/ltsmin6866006422409366774
[2023-03-18 23:26:37] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2023-03-18 23:26:37] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:26:37] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2023-03-18 23:26:37] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:26:37] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2023-03-18 23:26:37] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:26:37] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6866006422409366774
Running compilation step : cd /tmp/ltsmin6866006422409366774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 370 ms.
Running link step : cd /tmp/ltsmin6866006422409366774;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin6866006422409366774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11365787259359711597.hoa' '--buchi-type=spotba'
LTSmin run took 1185 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 finished in 8848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(G(p1))||p0))&&F(p2))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 150 transition count 205
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 150 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 150 transition count 204
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 131 transition count 185
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 131 transition count 185
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 86 place count 131 transition count 178
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 99 place count 118 transition count 156
Iterating global reduction 2 with 13 rules applied. Total rules applied 112 place count 118 transition count 156
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 120 place count 118 transition count 148
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 115 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 115 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 113 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 113 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 111 transition count 139
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 111 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 111 transition count 137
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 138 place count 109 transition count 135
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 109 transition count 135
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 108 transition count 134
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 108 transition count 134
Applied a total of 142 rules in 12 ms. Remains 108 /170 variables (removed 62) and now considering 134/407 (removed 273) transitions.
// Phase 1: matrix 134 rows 108 cols
[2023-03-18 23:26:38] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 23:26:38] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-18 23:26:38] [INFO ] Invariant cache hit.
[2023-03-18 23:26:38] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-18 23:26:39] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-18 23:26:39] [INFO ] Invariant cache hit.
[2023-03-18 23:26:39] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/170 places, 134/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 108/170 places, 134/407 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(OR (LT s1 1) (LT s103 1)), p1:(AND (GEQ s1 1) (GEQ s96 1)), p0:(OR (LT s1 1) (LT s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22492 reset in 372 ms.
Product exploration explored 100000 steps with 22425 reset in 275 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 354 edges and 108 vertex of which 107 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 p2 (NOT p1) p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 747 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2225 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2454748 steps, run timeout after 3001 ms. (steps per millisecond=817 ) properties seen :{0=1}
Probabilistic random walk after 2454748 steps, saw 1015229 distinct states, run finished after 3001 ms. (steps per millisecond=817 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-18 23:26:44] [INFO ] Invariant cache hit.
[2023-03-18 23:26:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:26:44] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-18 23:26:44] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:26:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:26:44] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:26:44] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:26:44] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-18 23:26:44] [INFO ] After 31ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:26:44] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2023-03-18 23:26:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-18 23:26:44] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-18 23:26:44] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 134/134 transitions.
Graph (complete) has 317 edges and 108 vertex of which 107 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 107 transition count 132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 106 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 105 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 105 transition count 128
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 104 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 104 transition count 127
Applied a total of 10 rules in 13 ms. Remains 104 /108 variables (removed 4) and now considering 127/134 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 104/108 places, 127/134 transitions.
Incomplete random walk after 10000 steps, including 2228 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2252526 steps, run timeout after 3001 ms. (steps per millisecond=750 ) properties seen :{}
Probabilistic random walk after 2252526 steps, saw 946125 distinct states, run finished after 3001 ms. (steps per millisecond=750 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2023-03-18 23:26:47] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-18 23:26:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:26:47] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:26:47] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:26:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:26:47] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:26:47] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:26:47] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-18 23:26:47] [INFO ] After 22ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:26:47] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-18 23:26:47] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-18 23:26:47] [INFO ] Invariant cache hit.
[2023-03-18 23:26:47] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-18 23:26:47] [INFO ] Invariant cache hit.
[2023-03-18 23:26:48] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-18 23:26:48] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-18 23:26:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:26:48] [INFO ] Invariant cache hit.
[2023-03-18 23:26:48] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 453 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 74 transition count 106
Applied a total of 61 rules in 7 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2023-03-18 23:26:48] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 23:26:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:26:48] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:26:48] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:26:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:26:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:26:48] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:26:48] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-18 23:26:48] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 13 factoid took 839 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 134/134 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 108 cols
[2023-03-18 23:26:49] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-18 23:26:49] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-18 23:26:49] [INFO ] Invariant cache hit.
[2023-03-18 23:26:50] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-18 23:26:50] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2023-03-18 23:26:50] [INFO ] Invariant cache hit.
[2023-03-18 23:26:50] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 108/108 places, 134/134 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 354 edges and 108 vertex of which 107 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 p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2229 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2054238 steps, run timeout after 3001 ms. (steps per millisecond=684 ) properties seen :{0=1}
Probabilistic random walk after 2054238 steps, saw 852622 distinct states, run finished after 3002 ms. (steps per millisecond=684 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-18 23:26:53] [INFO ] Invariant cache hit.
[2023-03-18 23:26:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:26:53] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 23:26:54] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:26:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:26:54] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:26:54] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:26:54] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-18 23:26:54] [INFO ] After 24ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:26:54] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2023-03-18 23:26:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-18 23:26:54] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-18 23:26:54] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 134/134 transitions.
Graph (complete) has 317 edges and 108 vertex of which 107 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 107 transition count 132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 106 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 105 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 105 transition count 128
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 104 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 104 transition count 127
Applied a total of 10 rules in 16 ms. Remains 104 /108 variables (removed 4) and now considering 127/134 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 104/108 places, 127/134 transitions.
Incomplete random walk after 10000 steps, including 2227 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2123451 steps, run timeout after 3001 ms. (steps per millisecond=707 ) properties seen :{}
Probabilistic random walk after 2123451 steps, saw 890322 distinct states, run finished after 3001 ms. (steps per millisecond=707 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2023-03-18 23:26:57] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-18 23:26:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:26:57] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:26:57] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:26:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:26:57] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:26:57] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:26:57] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-18 23:26:57] [INFO ] After 20ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:26:57] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-18 23:26:57] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-18 23:26:57] [INFO ] Invariant cache hit.
[2023-03-18 23:26:57] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-18 23:26:57] [INFO ] Invariant cache hit.
[2023-03-18 23:26:57] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-18 23:26:57] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-18 23:26:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:26:57] [INFO ] Invariant cache hit.
[2023-03-18 23:26:57] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 74 transition count 106
Applied a total of 61 rules in 16 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2023-03-18 23:26:57] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 23:26:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:26:58] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:26:58] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:26:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:26:58] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:26:58] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:26:58] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-18 23:26:58] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 22507 reset in 142 ms.
Product exploration explored 100000 steps with 22426 reset in 124 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2023-03-18 23:26:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 134 rows 108 cols
[2023-03-18 23:26:59] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 23:26:59] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 108/108 places, 134/134 transitions.
Built C files in :
/tmp/ltsmin5391971131729013648
[2023-03-18 23:26:59] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5391971131729013648
Running compilation step : cd /tmp/ltsmin5391971131729013648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 307 ms.
Running link step : cd /tmp/ltsmin5391971131729013648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5391971131729013648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6770389215916151014.hoa' '--buchi-type=spotba'
LTSmin run took 7728 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 finished in 28756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 149 transition count 202
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 130 transition count 183
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 130 transition count 183
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 130 transition count 176
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 117 transition count 154
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 117 transition count 154
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 117 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 113 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 113 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 110 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 108 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 105 transition count 129
Applied a total of 149 rules in 18 ms. Remains 105 /170 variables (removed 65) and now considering 129/407 (removed 278) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-18 23:27:07] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 23:27:07] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-18 23:27:07] [INFO ] Invariant cache hit.
[2023-03-18 23:27:07] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:27:07] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-18 23:27:07] [INFO ] Invariant cache hit.
[2023-03-18 23:27:07] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/170 places, 129/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 105/170 places, 129/407 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22510 reset in 126 ms.
Product exploration explored 100000 steps with 22444 reset in 112 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 252 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2241 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3121 steps, run visited all 1 properties in 9 ms. (steps per millisecond=346 )
Probabilistic random walk after 3121 steps, saw 1576 distinct states, run finished after 9 ms. (steps per millisecond=346 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-18 23:27:08] [INFO ] Invariant cache hit.
[2023-03-18 23:27:09] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-18 23:27:09] [INFO ] Invariant cache hit.
[2023-03-18 23:27:09] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:27:09] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-18 23:27:09] [INFO ] Invariant cache hit.
[2023-03-18 23:27:09] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 488 ms. Remains : 105/105 places, 129/129 transitions.
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.2 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 237 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2208 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3121 steps, run visited all 1 properties in 11 ms. (steps per millisecond=283 )
Probabilistic random walk after 3121 steps, saw 1576 distinct states, run finished after 11 ms. (steps per millisecond=283 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 254 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22536 reset in 159 ms.
Product exploration explored 100000 steps with 22404 reset in 144 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-18 23:27:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:27:11] [INFO ] Invariant cache hit.
[2023-03-18 23:27:11] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 105/105 places, 129/129 transitions.
Built C files in :
/tmp/ltsmin195491004364273380
[2023-03-18 23:27:11] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin195491004364273380
Running compilation step : cd /tmp/ltsmin195491004364273380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 255 ms.
Running link step : cd /tmp/ltsmin195491004364273380;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin195491004364273380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10033046351720461719.hoa' '--buchi-type=spotba'
LTSmin run took 5000 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 finished in 9018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 151 transition count 217
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 151 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 151 transition count 216
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 133 transition count 198
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 133 transition count 198
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 82 place count 133 transition count 191
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 121 transition count 171
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 121 transition count 171
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 114 place count 121 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 118 transition count 160
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 118 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 116 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 116 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 115 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 115 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 114 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 113 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 113 transition count 153
Applied a total of 130 rules in 15 ms. Remains 113 /170 variables (removed 57) and now considering 153/407 (removed 254) transitions.
// Phase 1: matrix 153 rows 113 cols
[2023-03-18 23:27:16] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 23:27:16] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-18 23:27:16] [INFO ] Invariant cache hit.
[2023-03-18 23:27:16] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-18 23:27:16] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2023-03-18 23:27:16] [INFO ] Invariant cache hit.
[2023-03-18 23:27:17] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/170 places, 153/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 595 ms. Remains : 113/170 places, 153/407 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s107 1) (OR (LT s1 1) (LT s41 1)) (OR (LT s1 1) (LT s108 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 finished in 742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p1)&&p0))&&X(F(p1))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 150 transition count 216
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 150 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 150 transition count 215
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 59 place count 132 transition count 197
Iterating global reduction 1 with 18 rules applied. Total rules applied 77 place count 132 transition count 197
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 84 place count 132 transition count 190
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 96 place count 120 transition count 170
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 120 transition count 170
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 116 place count 120 transition count 162
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 120 place count 116 transition count 158
Iterating global reduction 3 with 4 rules applied. Total rules applied 124 place count 116 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 113 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 113 transition count 155
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 111 transition count 151
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 111 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 137 place count 111 transition count 148
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 109 transition count 146
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 108 transition count 145
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 108 transition count 145
Applied a total of 143 rules in 21 ms. Remains 108 /170 variables (removed 62) and now considering 145/407 (removed 262) transitions.
// Phase 1: matrix 145 rows 108 cols
[2023-03-18 23:27:17] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 23:27:17] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-18 23:27:17] [INFO ] Invariant cache hit.
[2023-03-18 23:27:17] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-18 23:27:17] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-18 23:27:17] [INFO ] Invariant cache hit.
[2023-03-18 23:27:17] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/170 places, 145/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 416 ms. Remains : 108/170 places, 145/407 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s102 1)), p1:(AND (GEQ s1 1) (GEQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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-d2m36-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-07 finished in 564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&G(F(p2))))))'
Support contains 5 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 151 transition count 206
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 151 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 151 transition count 205
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 56 place count 134 transition count 188
Iterating global reduction 1 with 17 rules applied. Total rules applied 73 place count 134 transition count 188
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 81 place count 134 transition count 180
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 92 place count 123 transition count 160
Iterating global reduction 2 with 11 rules applied. Total rules applied 103 place count 123 transition count 160
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 111 place count 123 transition count 152
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 121 transition count 150
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 121 transition count 150
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 119 transition count 148
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 119 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 118 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 118 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 123 place count 118 transition count 145
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 117 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 117 transition count 144
Applied a total of 125 rules in 21 ms. Remains 117 /170 variables (removed 53) and now considering 144/407 (removed 263) transitions.
// Phase 1: matrix 144 rows 117 cols
[2023-03-18 23:27:17] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 23:27:17] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-18 23:27:17] [INFO ] Invariant cache hit.
[2023-03-18 23:27:17] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-18 23:27:18] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-18 23:27:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:27:18] [INFO ] Invariant cache hit.
[2023-03-18 23:27:18] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/170 places, 144/407 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 462 ms. Remains : 117/170 places, 144/407 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s112 1)), p1:(OR (LT s10 1) (LT s35 1)), p2:(OR (AND (GEQ s1 1) (GEQ s63 1)) (AND (GEQ s10 1) (GEQ s35 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 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 finished in 616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((F(p1)&&p0)) U p2))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 150 transition count 204
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 150 transition count 204
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 58 place count 132 transition count 186
Iterating global reduction 0 with 18 rules applied. Total rules applied 76 place count 132 transition count 186
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 84 place count 132 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 120 transition count 157
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 120 transition count 157
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 117 place count 120 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 116 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 116 transition count 144
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 128 place count 113 transition count 141
Iterating global reduction 2 with 3 rules applied. Total rules applied 131 place count 113 transition count 141
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 111 transition count 137
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 111 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 111 transition count 135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 109 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 109 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 108 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 108 transition count 132
Applied a total of 143 rules in 15 ms. Remains 108 /170 variables (removed 62) and now considering 132/407 (removed 275) transitions.
// Phase 1: matrix 132 rows 108 cols
[2023-03-18 23:27:18] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 23:27:18] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-18 23:27:18] [INFO ] Invariant cache hit.
[2023-03-18 23:27:18] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-18 23:27:18] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-18 23:27:18] [INFO ] Invariant cache hit.
[2023-03-18 23:27:18] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/170 places, 132/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 450 ms. Remains : 108/170 places, 132/407 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s81 1) (GEQ s38 1)), p0:(AND (GEQ s1 1) (GEQ s38 1)), p1:(OR (AND (GEQ s1 1) (GEQ s103 1)) (AND (GEQ s1 1) (GEQ s81 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 finished in 613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 149 transition count 202
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 130 transition count 183
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 130 transition count 183
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 130 transition count 176
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 117 transition count 154
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 117 transition count 154
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 117 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 113 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 113 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 110 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 108 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 105 transition count 129
Applied a total of 149 rules in 36 ms. Remains 105 /170 variables (removed 65) and now considering 129/407 (removed 278) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-18 23:27:19] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 23:27:19] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-18 23:27:19] [INFO ] Invariant cache hit.
[2023-03-18 23:27:19] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:27:19] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-18 23:27:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:27:19] [INFO ] Invariant cache hit.
[2023-03-18 23:27:19] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/170 places, 129/407 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 510 ms. Remains : 105/170 places, 129/407 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22425 reset in 122 ms.
Product exploration explored 100000 steps with 22491 reset in 116 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2236 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1758576 steps, run timeout after 3001 ms. (steps per millisecond=585 ) properties seen :{}
Probabilistic random walk after 1758576 steps, saw 741648 distinct states, run finished after 3001 ms. (steps per millisecond=585 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:27:23] [INFO ] Invariant cache hit.
[2023-03-18 23:27:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:27:23] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 23:27:23] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:27:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:27:23] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 23:27:23] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:27:23] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:27:23] [INFO ] After 22ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:27:23] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2023-03-18 23:27:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-18 23:27:23] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 23:27:23] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 129/129 transitions.
Graph (complete) has 307 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 104 transition count 127
Applied a total of 3 rules in 4 ms. Remains 104 /105 variables (removed 1) and now considering 127/129 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/105 places, 127/129 transitions.
Incomplete random walk after 10000 steps, including 2215 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 518 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2195161 steps, run timeout after 3001 ms. (steps per millisecond=731 ) properties seen :{}
Probabilistic random walk after 2195161 steps, saw 922040 distinct states, run finished after 3001 ms. (steps per millisecond=731 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2023-03-18 23:27:26] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-18 23:27:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:27:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:27:26] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:27:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:27:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:27:26] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:27:26] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-18 23:27:26] [INFO ] After 22ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:27:26] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-18 23:27:26] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-18 23:27:26] [INFO ] Invariant cache hit.
[2023-03-18 23:27:26] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-18 23:27:26] [INFO ] Invariant cache hit.
[2023-03-18 23:27:26] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-18 23:27:26] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-18 23:27:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:27:26] [INFO ] Invariant cache hit.
[2023-03-18 23:27:27] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 74 transition count 106
Applied a total of 61 rules in 8 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2023-03-18 23:27:27] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 23:27:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:27:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:27:27] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:27:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:27:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:27:27] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:27:27] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-18 23:27:27] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-18 23:27:27] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 23:27:27] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-18 23:27:27] [INFO ] Invariant cache hit.
[2023-03-18 23:27:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:27:27] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-18 23:27:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:27:27] [INFO ] Invariant cache hit.
[2023-03-18 23:27:27] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 442 ms. Remains : 105/105 places, 129/129 transitions.
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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2151 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 450 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1972803 steps, run timeout after 3001 ms. (steps per millisecond=657 ) properties seen :{}
Probabilistic random walk after 1972803 steps, saw 828538 distinct states, run finished after 3003 ms. (steps per millisecond=656 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:27:31] [INFO ] Invariant cache hit.
[2023-03-18 23:27:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:27:31] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:27:31] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:27:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:27:31] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 23:27:31] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:27:31] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:27:31] [INFO ] After 20ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:27:31] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2023-03-18 23:27:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-18 23:27:31] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-18 23:27:31] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 129/129 transitions.
Graph (complete) has 307 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 104 transition count 127
Applied a total of 3 rules in 5 ms. Remains 104 /105 variables (removed 1) and now considering 127/129 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 104/105 places, 127/129 transitions.
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2570709 steps, run timeout after 3001 ms. (steps per millisecond=856 ) properties seen :{}
Probabilistic random walk after 2570709 steps, saw 1078038 distinct states, run finished after 3001 ms. (steps per millisecond=856 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2023-03-18 23:27:34] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-18 23:27:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:27:34] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:27:34] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:27:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:27:34] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:27:34] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:27:34] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-18 23:27:34] [INFO ] After 22ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:27:34] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 23:27:34] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-18 23:27:34] [INFO ] Invariant cache hit.
[2023-03-18 23:27:34] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-18 23:27:34] [INFO ] Invariant cache hit.
[2023-03-18 23:27:35] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-18 23:27:35] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-18 23:27:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:27:35] [INFO ] Invariant cache hit.
[2023-03-18 23:27:35] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 74 transition count 106
Applied a total of 61 rules in 6 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2023-03-18 23:27:35] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 23:27:35] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-18 23:27:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 23:27:35] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:27:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:27:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:27:35] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:27:35] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-18 23:27:35] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22414 reset in 128 ms.
Product exploration explored 100000 steps with 22329 reset in 118 ms.
Built C files in :
/tmp/ltsmin12843103141378414583
[2023-03-18 23:27:35] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2023-03-18 23:27:35] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:27:35] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2023-03-18 23:27:35] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:27:36] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2023-03-18 23:27:36] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:27:36] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12843103141378414583
Running compilation step : cd /tmp/ltsmin12843103141378414583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 261 ms.
Running link step : cd /tmp/ltsmin12843103141378414583;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin12843103141378414583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5687890228639144484.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-18 23:27:51] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 23:27:51] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-18 23:27:51] [INFO ] Invariant cache hit.
[2023-03-18 23:27:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:27:51] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-18 23:27:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:27:51] [INFO ] Invariant cache hit.
[2023-03-18 23:27:51] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 460 ms. Remains : 105/105 places, 129/129 transitions.
Built C files in :
/tmp/ltsmin14928419071604376085
[2023-03-18 23:27:51] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2023-03-18 23:27:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:27:51] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2023-03-18 23:27:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:27:51] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2023-03-18 23:27:51] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:27:51] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14928419071604376085
Running compilation step : cd /tmp/ltsmin14928419071604376085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 216 ms.
Running link step : cd /tmp/ltsmin14928419071604376085;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin14928419071604376085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased751472666122174935.hoa' '--buchi-type=spotba'
LTSmin run took 5884 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 finished in 38769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1 U (p2||(p1 U G(p2)))))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 151 transition count 229
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 151 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 151 transition count 228
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 56 place count 134 transition count 211
Iterating global reduction 1 with 17 rules applied. Total rules applied 73 place count 134 transition count 211
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 134 transition count 205
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 123 transition count 187
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 123 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 108 place count 123 transition count 180
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 120 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 120 transition count 177
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 118 transition count 175
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 118 transition count 175
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 116 transition count 171
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 116 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 126 place count 116 transition count 167
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 128 place count 114 transition count 165
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 114 transition count 165
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 131 place count 113 transition count 164
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 113 transition count 164
Applied a total of 132 rules in 8 ms. Remains 113 /170 variables (removed 57) and now considering 164/407 (removed 243) transitions.
// Phase 1: matrix 164 rows 113 cols
[2023-03-18 23:27:57] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 23:27:57] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-18 23:27:57] [INFO ] Invariant cache hit.
[2023-03-18 23:27:57] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-18 23:27:58] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-18 23:27:58] [INFO ] Invariant cache hit.
[2023-03-18 23:27:58] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/170 places, 164/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 113/170 places, 164/407 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s1 1) (GEQ s108 1)), p1:(AND (GEQ s1 1) (GEQ s107 1)), p0:(AND (GEQ s1 1) (GEQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-13 finished in 673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p0||X(F(p1)))))&&(p2||(p1 U p3)))))'
Support contains 5 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 152 transition count 231
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 152 transition count 231
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 152 transition count 230
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 53 place count 136 transition count 214
Iterating global reduction 1 with 16 rules applied. Total rules applied 69 place count 136 transition count 214
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 136 transition count 207
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 86 place count 126 transition count 190
Iterating global reduction 2 with 10 rules applied. Total rules applied 96 place count 126 transition count 190
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 126 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 125 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 125 transition count 183
Applied a total of 104 rules in 9 ms. Remains 125 /170 variables (removed 45) and now considering 183/407 (removed 224) transitions.
// Phase 1: matrix 183 rows 125 cols
[2023-03-18 23:27:58] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 23:27:58] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-18 23:27:58] [INFO ] Invariant cache hit.
[2023-03-18 23:27:58] [INFO ] State equation strengthened by 95 read => feed constraints.
[2023-03-18 23:27:58] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2023-03-18 23:27:58] [INFO ] Invariant cache hit.
[2023-03-18 23:27:58] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/170 places, 183/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 527 ms. Remains : 125/170 places, 183/407 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=1 dest: 3}, { cond=(OR p2 p3 p1), acceptance={} source=1 dest: 4}, { cond=(OR (AND p2 (NOT p1) (NOT p0)) (AND p3 (NOT p1) (NOT p0))), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s120 1)), p3:(AND (GEQ s1 1) (GEQ s118 1)), p1:(AND (GEQ s1 1) (GEQ s119 1)), p0:(AND (GEQ s1 1) (GEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, 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-d2m36-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-15 finished in 865 ms.
All properties solved by simple procedures.
Total runtime 144944 ms.

BK_STOP 1679182079547

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-d2m36"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d2m36, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r421-tajo-167905975300476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m36.tgz
mv SieveSingleMsgMbox-PT-d2m36 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;