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.r423-tajo-167905976700444.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 lolaxred
Input is SieveSingleMsgMbox-PT-d1m96, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976700444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 7.5K Feb 26 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:25 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.2K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 10:27 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 450K 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-d1m96-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679247583446

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m96
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:39:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 17:39:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:39:45] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2023-03-19 17:39:45] [INFO ] Transformed 1295 places.
[2023-03-19 17:39:45] [INFO ] Transformed 749 transitions.
[2023-03-19 17:39:45] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 297 place count 202 transition count 433
Iterating global reduction 1 with 40 rules applied. Total rules applied 337 place count 202 transition count 433
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 343 place count 202 transition count 427
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 365 place count 180 transition count 405
Iterating global reduction 2 with 22 rules applied. Total rules applied 387 place count 180 transition count 405
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 393 place count 180 transition count 399
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 409 place count 164 transition count 381
Iterating global reduction 3 with 16 rules applied. Total rules applied 425 place count 164 transition count 381
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 3 with 66 rules applied. Total rules applied 491 place count 164 transition count 315
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 492 place count 163 transition count 314
Iterating global reduction 4 with 1 rules applied. Total rules applied 493 place count 163 transition count 314
Applied a total of 493 rules in 59 ms. Remains 163 /259 variables (removed 96) and now considering 314/749 (removed 435) transitions.
// Phase 1: matrix 314 rows 163 cols
[2023-03-19 17:39:45] [INFO ] Computed 5 place invariants in 19 ms
[2023-03-19 17:39:45] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-19 17:39:45] [INFO ] Invariant cache hit.
[2023-03-19 17:39:46] [INFO ] State equation strengthened by 203 read => feed constraints.
[2023-03-19 17:39:46] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
[2023-03-19 17:39:46] [INFO ] Invariant cache hit.
[2023-03-19 17:39:47] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 163/259 places, 314/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1593 ms. Remains : 163/259 places, 314/749 transitions.
Support contains 31 out of 163 places after structural reductions.
[2023-03-19 17:39:47] [INFO ] Flatten gal took : 63 ms
[2023-03-19 17:39:47] [INFO ] Flatten gal took : 27 ms
[2023-03-19 17:39:47] [INFO ] Input system was already deterministic with 314 transitions.
Incomplete random walk after 10000 steps, including 2210 resets, run finished after 821 ms. (steps per millisecond=12 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2023-03-19 17:39:48] [INFO ] Invariant cache hit.
[2023-03-19 17:39:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:39:48] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-19 17:39:49] [INFO ] After 1140ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:26
[2023-03-19 17:39:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:39:50] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-19 17:39:51] [INFO ] After 766ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :26
[2023-03-19 17:39:51] [INFO ] State equation strengthened by 203 read => feed constraints.
[2023-03-19 17:39:53] [INFO ] After 1877ms SMT Verify possible using 203 Read/Feed constraints in natural domain returned unsat :1 sat :26
[2023-03-19 17:39:53] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 14 ms to minimize.
[2023-03-19 17:39:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-19 17:39:53] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2023-03-19 17:39:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-19 17:39:55] [INFO ] After 4668ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :25
Attempting to minimize the solution found.
Minimization took 1750 ms.
[2023-03-19 17:39:57] [INFO ] After 7831ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :25
Fused 27 Parikh solutions to 25 different solutions.
Parikh walk visited 4 properties in 1412 ms.
Support contains 20 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 314/314 transitions.
Graph (complete) has 566 edges and 163 vertex of which 162 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 162 transition count 312
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 155 transition count 293
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 155 transition count 293
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 150 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 150 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 150 transition count 287
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 146 transition count 281
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 146 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 146 transition count 279
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 40 place count 144 transition count 277
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 144 transition count 277
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 143 transition count 276
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 143 transition count 276
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 142 transition count 274
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 142 transition count 274
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 141 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 141 transition count 273
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 140 transition count 272
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 140 transition count 272
Applied a total of 50 rules in 61 ms. Remains 140 /163 variables (removed 23) and now considering 272/314 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 140/163 places, 272/314 transitions.
Incomplete random walk after 10000 steps, including 2270 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 253630 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{1=1, 2=1, 3=1, 5=1, 8=1, 9=1, 10=1, 14=1, 15=1, 17=1, 18=1, 19=1, 20=1}
Probabilistic random walk after 253630 steps, saw 118394 distinct states, run finished after 3004 ms. (steps per millisecond=84 ) properties seen :13
Running SMT prover for 8 properties.
// Phase 1: matrix 272 rows 140 cols
[2023-03-19 17:40:02] [INFO ] Computed 4 place invariants in 9 ms
[2023-03-19 17:40:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:40:02] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 17:40:03] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 17:40:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:03] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:40:03] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 17:40:03] [INFO ] State equation strengthened by 176 read => feed constraints.
[2023-03-19 17:40:03] [INFO ] After 511ms SMT Verify possible using 176 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-19 17:40:04] [INFO ] After 1031ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 365 ms.
[2023-03-19 17:40:04] [INFO ] After 1710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 425 ms.
Support contains 8 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 272/272 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 129 transition count 189
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 129 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 129 transition count 187
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 119 transition count 175
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 119 transition count 175
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 48 place count 119 transition count 171
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 115 transition count 167
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 115 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 115 transition count 165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 113 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 113 transition count 163
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 111 transition count 161
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 111 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 109 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 109 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 75 place count 109 transition count 154
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 76 place count 108 transition count 153
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 108 transition count 153
Applied a total of 77 rules in 41 ms. Remains 108 /140 variables (removed 32) and now considering 153/272 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 108/140 places, 153/272 transitions.
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 495 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 461 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 374324 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 374324 steps, saw 163274 distinct states, run finished after 3002 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 153 rows 108 cols
[2023-03-19 17:40:09] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-19 17:40:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:09] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:40:10] [INFO ] After 792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 17:40:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 17:40:10] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 17:40:10] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-19 17:40:10] [INFO ] After 220ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-19 17:40:11] [INFO ] After 557ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 327 ms.
[2023-03-19 17:40:11] [INFO ] After 1220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 354 ms.
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 153/153 transitions.
Applied a total of 0 rules in 7 ms. Remains 108 /108 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 108/108 places, 153/153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 153/153 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 153/153 (removed 0) transitions.
[2023-03-19 17:40:11] [INFO ] Invariant cache hit.
[2023-03-19 17:40:11] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-19 17:40:11] [INFO ] Invariant cache hit.
[2023-03-19 17:40:12] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-19 17:40:12] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-03-19 17:40:12] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:40:12] [INFO ] Invariant cache hit.
[2023-03-19 17:40:12] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 692 ms. Remains : 108/108 places, 153/153 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 108 transition count 148
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 104 transition count 148
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 9 place count 104 transition count 133
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 39 place count 89 transition count 133
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 57 place count 80 transition count 124
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 80 transition count 124
Applied a total of 59 rules in 33 ms. Remains 80 /108 variables (removed 28) and now considering 124/153 (removed 29) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 124 rows 80 cols
[2023-03-19 17:40:12] [INFO ] Computed 4 place invariants in 20 ms
[2023-03-19 17:40:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:12] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-19 17:40:12] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 17:40:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:12] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:40:13] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 17:40:13] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2023-03-19 17:40:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-19 17:40:13] [INFO ] After 392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-19 17:40:13] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 44 stabilizing places and 74 stable transitions
Graph (complete) has 628 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 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(F((p1||G(p2))))&&p0))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 141 transition count 183
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 141 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 141 transition count 182
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 65 place count 121 transition count 158
Iterating global reduction 1 with 20 rules applied. Total rules applied 85 place count 121 transition count 158
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 96 place count 121 transition count 147
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 109 transition count 134
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 109 transition count 134
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 109 transition count 129
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 130 place count 104 transition count 124
Iterating global reduction 3 with 5 rules applied. Total rules applied 135 place count 104 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 139 place count 100 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 100 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 98 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 98 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 149 place count 98 transition count 116
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 151 place count 96 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 153 place count 96 transition count 114
Applied a total of 153 rules in 32 ms. Remains 96 /163 variables (removed 67) and now considering 114/314 (removed 200) transitions.
// Phase 1: matrix 114 rows 96 cols
[2023-03-19 17:40:13] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:40:14] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-19 17:40:14] [INFO ] Invariant cache hit.
[2023-03-19 17:40:14] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-19 17:40:14] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-19 17:40:14] [INFO ] Invariant cache hit.
[2023-03-19 17:40:14] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/163 places, 114/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 96/163 places, 114/314 transitions.
Stuttering acceptance computed with spot in 519 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s48 1)), p2:(AND (GEQ s1 1) (GEQ s54 1)), p1:(AND (GEQ s1 1) (GEQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-00 finished in 1066 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((!p0||G(!p1))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 180
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 179
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 120 transition count 155
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 120 transition count 155
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 96 place count 120 transition count 146
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 108 transition count 134
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 108 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 126 place count 108 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 130 place count 104 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 104 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 138 place count 100 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 142 place count 100 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 145 place count 97 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 148 place count 97 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 150 place count 97 transition count 114
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 95 transition count 112
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 95 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 94 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 94 transition count 111
Applied a total of 156 rules in 25 ms. Remains 94 /163 variables (removed 69) and now considering 111/314 (removed 203) transitions.
// Phase 1: matrix 111 rows 94 cols
[2023-03-19 17:40:14] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:40:15] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-19 17:40:15] [INFO ] Invariant cache hit.
[2023-03-19 17:40:15] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 17:40:15] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-19 17:40:15] [INFO ] Invariant cache hit.
[2023-03-19 17:40:15] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/163 places, 111/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 525 ms. Remains : 94/163 places, 111/314 transitions.
Stuttering acceptance computed with spot in 448 ms :[true, (AND p1 p0), p1, (AND p1 p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s10 1) (GEQ s29 1)), p0:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 598 ms.
Product exploration explored 100000 steps with 50000 reset in 295 ms.
Computed a total of 23 stabilizing places and 30 stable transitions
Graph (complete) has 302 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 23 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-01 finished in 2078 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(X((X((p1||F(p2)))&&p0))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 182
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 181
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 120 transition count 157
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 120 transition count 157
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 98 place count 120 transition count 146
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 110 place count 108 transition count 133
Iterating global reduction 2 with 12 rules applied. Total rules applied 122 place count 108 transition count 133
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 127 place count 108 transition count 128
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 132 place count 103 transition count 123
Iterating global reduction 3 with 5 rules applied. Total rules applied 137 place count 103 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 141 place count 99 transition count 119
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 99 transition count 119
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 96 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 96 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 153 place count 96 transition count 113
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 156 place count 93 transition count 110
Iterating global reduction 4 with 3 rules applied. Total rules applied 159 place count 93 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 160 place count 92 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 92 transition count 109
Applied a total of 161 rules in 29 ms. Remains 92 /163 variables (removed 71) and now considering 109/314 (removed 205) transitions.
// Phase 1: matrix 109 rows 92 cols
[2023-03-19 17:40:16] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:40:17] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-19 17:40:17] [INFO ] Invariant cache hit.
[2023-03-19 17:40:17] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 17:40:17] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-19 17:40:17] [INFO ] Invariant cache hit.
[2023-03-19 17:40:17] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/163 places, 109/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 359 ms. Remains : 92/163 places, 109/314 transitions.
Stuttering acceptance computed with spot in 335 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p2:(AND (GEQ s1 1) (GEQ s53 1)), p1:(AND (GEQ s1 1) (GEQ s87 1)), p0:(AND (GEQ s1 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-03 finished in 712 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(((!p0&&F(!p1))||X((G(F(!p1))||p2))))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 188
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 187
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 120 transition count 163
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 120 transition count 163
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 96 place count 120 transition count 154
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 108 transition count 141
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 108 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 108 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 104 transition count 132
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 104 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 100 transition count 128
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 100 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 97 transition count 124
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 97 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 95 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 95 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 153 place count 93 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 158 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 91 transition count 117
Applied a total of 159 rules in 31 ms. Remains 91 /163 variables (removed 72) and now considering 117/314 (removed 197) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-19 17:40:17] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-19 17:40:17] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-19 17:40:17] [INFO ] Invariant cache hit.
[2023-03-19 17:40:18] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-19 17:40:18] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-19 17:40:18] [INFO ] Invariant cache hit.
[2023-03-19 17:40:18] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/163 places, 117/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 538 ms. Remains : 91/163 places, 117/314 transitions.
Stuttering acceptance computed with spot in 292 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s85 1)), p1:(AND (GEQ s1 1) (GEQ s30 1)), p2:(OR (LT s1 1) (LT s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 324 ms.
Product exploration explored 100000 steps with 50000 reset in 301 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-04 finished in 1764 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' '!(G(F(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 139 transition count 179
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 139 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 139 transition count 178
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 70 place count 118 transition count 153
Iterating global reduction 1 with 21 rules applied. Total rules applied 91 place count 118 transition count 153
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 101 place count 118 transition count 143
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 114 place count 105 transition count 129
Iterating global reduction 2 with 13 rules applied. Total rules applied 127 place count 105 transition count 129
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 133 place count 105 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 138 place count 100 transition count 118
Iterating global reduction 3 with 5 rules applied. Total rules applied 143 place count 100 transition count 118
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 148 place count 95 transition count 113
Iterating global reduction 3 with 5 rules applied. Total rules applied 153 place count 95 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 157 place count 91 transition count 108
Iterating global reduction 3 with 4 rules applied. Total rules applied 161 place count 91 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 163 place count 91 transition count 106
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 166 place count 88 transition count 103
Iterating global reduction 4 with 3 rules applied. Total rules applied 169 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 171 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 173 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 174 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 176 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 177 place count 84 transition count 98
Applied a total of 177 rules in 43 ms. Remains 84 /163 variables (removed 79) and now considering 98/314 (removed 216) transitions.
// Phase 1: matrix 98 rows 84 cols
[2023-03-19 17:40:19] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:40:19] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-19 17:40:19] [INFO ] Invariant cache hit.
[2023-03-19 17:40:19] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 17:40:19] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-19 17:40:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:40:19] [INFO ] Invariant cache hit.
[2023-03-19 17:40:19] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/163 places, 98/314 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 391 ms. Remains : 84/163 places, 98/314 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-05 finished in 504 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)&&F(p1)))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 188
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 187
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 120 transition count 163
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 120 transition count 163
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 96 place count 120 transition count 154
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 108 transition count 141
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 108 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 108 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 104 transition count 132
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 104 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 100 transition count 128
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 100 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 97 transition count 124
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 97 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 95 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 95 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 153 place count 93 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 158 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 91 transition count 117
Applied a total of 159 rules in 36 ms. Remains 91 /163 variables (removed 72) and now considering 117/314 (removed 197) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-19 17:40:19] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:40:20] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-19 17:40:20] [INFO ] Invariant cache hit.
[2023-03-19 17:40:20] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-19 17:40:20] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-19 17:40:20] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 17:40:20] [INFO ] Invariant cache hit.
[2023-03-19 17:40:20] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/163 places, 117/314 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 444 ms. Remains : 91/163 places, 117/314 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s85 1)), p0:(AND (GEQ s1 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-07 finished in 609 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)))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 173
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 173
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 67 place count 119 transition count 148
Iterating global reduction 0 with 21 rules applied. Total rules applied 88 place count 119 transition count 148
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 97 place count 119 transition count 139
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 111 place count 105 transition count 123
Iterating global reduction 1 with 14 rules applied. Total rules applied 125 place count 105 transition count 123
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 132 place count 105 transition count 116
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 138 place count 99 transition count 110
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 99 transition count 110
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 150 place count 93 transition count 104
Iterating global reduction 2 with 6 rules applied. Total rules applied 156 place count 93 transition count 104
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 161 place count 88 transition count 98
Iterating global reduction 2 with 5 rules applied. Total rules applied 166 place count 88 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 168 place count 88 transition count 96
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 84 transition count 92
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 84 transition count 92
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 178 place count 82 transition count 89
Iterating global reduction 3 with 2 rules applied. Total rules applied 180 place count 82 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 81 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 81 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 80 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 80 transition count 87
Applied a total of 184 rules in 31 ms. Remains 80 /163 variables (removed 83) and now considering 87/314 (removed 227) transitions.
// Phase 1: matrix 87 rows 80 cols
[2023-03-19 17:40:20] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:40:20] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-19 17:40:20] [INFO ] Invariant cache hit.
[2023-03-19 17:40:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-19 17:40:20] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-19 17:40:20] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:40:20] [INFO ] Invariant cache hit.
[2023-03-19 17:40:20] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/163 places, 87/314 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 321 ms. Remains : 80/163 places, 87/314 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s48 1)), p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-08 finished in 431 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(X((!p0 U G(!p1)))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 180
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 179
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 120 transition count 157
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 120 transition count 157
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 97 place count 120 transition count 147
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 109 place count 108 transition count 134
Iterating global reduction 2 with 12 rules applied. Total rules applied 121 place count 108 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 127 place count 108 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 131 place count 104 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 104 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 139 place count 100 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 100 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 146 place count 97 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 149 place count 97 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 151 place count 97 transition count 114
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 154 place count 94 transition count 111
Iterating global reduction 4 with 3 rules applied. Total rules applied 157 place count 94 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 158 place count 93 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 93 transition count 110
Applied a total of 159 rules in 13 ms. Remains 93 /163 variables (removed 70) and now considering 110/314 (removed 204) transitions.
// Phase 1: matrix 110 rows 93 cols
[2023-03-19 17:40:21] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-19 17:40:21] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-19 17:40:21] [INFO ] Invariant cache hit.
[2023-03-19 17:40:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 17:40:21] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2023-03-19 17:40:21] [INFO ] Invariant cache hit.
[2023-03-19 17:40:21] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/163 places, 110/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 493 ms. Remains : 93/163 places, 110/314 transitions.
Stuttering acceptance computed with spot in 476 ms :[p1, p1, p1, true, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s88 1)), p0:(AND (GEQ s1 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22486 reset in 274 ms.
Product exploration explored 100000 steps with 22420 reset in 266 ms.
Computed a total of 19 stabilizing places and 24 stable transitions
Graph (complete) has 299 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 19 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 376 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[p1, p1, p1, true, p1]
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 542983 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{0=1, 1=1, 4=1}
Probabilistic random walk after 542983 steps, saw 240698 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :3
Running SMT prover for 2 properties.
[2023-03-19 17:40:26] [INFO ] Invariant cache hit.
[2023-03-19 17:40:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:26] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 17:40:26] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-19 17:40:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:26] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:40:26] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-19 17:40:26] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 17:40:26] [INFO ] After 32ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-19 17:40:27] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-19 17:40:27] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 110/110 transitions.
Graph (complete) has 265 edges and 93 vertex of which 92 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 92 transition count 108
Applied a total of 3 rules in 14 ms. Remains 92 /93 variables (removed 1) and now considering 108/110 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 92/93 places, 108/110 transitions.
Incomplete random walk after 10000 steps, including 2258 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2177449 steps, run timeout after 3001 ms. (steps per millisecond=725 ) properties seen :{}
Probabilistic random walk after 2177449 steps, saw 958913 distinct states, run finished after 3001 ms. (steps per millisecond=725 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 92 cols
[2023-03-19 17:40:30] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-19 17:40:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:40:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:40:30] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:40:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:40:30] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:40:30] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-19 17:40:30] [INFO ] After 21ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:40:30] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-19 17:40:30] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 92/92 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-19 17:40:30] [INFO ] Invariant cache hit.
[2023-03-19 17:40:30] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-19 17:40:30] [INFO ] Invariant cache hit.
[2023-03-19 17:40:30] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-19 17:40:30] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-19 17:40:30] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:40:30] [INFO ] Invariant cache hit.
[2023-03-19 17:40:30] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 408 ms. Remains : 92/92 places, 108/108 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 92 transition count 102
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 87 transition count 102
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 11 place count 87 transition count 87
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 41 place count 72 transition count 87
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 65 transition count 80
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 65 transition count 80
Applied a total of 57 rules in 8 ms. Remains 65 /92 variables (removed 27) and now considering 80/108 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 80 rows 65 cols
[2023-03-19 17:40:30] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 17:40:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:30] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 17:40:30] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:40:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:40:31] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:40:31] [INFO ] After 46ms 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-19 17:40:31] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 393 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 282 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 93 cols
[2023-03-19 17:40:32] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:40:32] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-19 17:40:32] [INFO ] Invariant cache hit.
[2023-03-19 17:40:32] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 17:40:32] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-19 17:40:32] [INFO ] Invariant cache hit.
[2023-03-19 17:40:32] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 443 ms. Remains : 93/93 places, 110/110 transitions.
Computed a total of 19 stabilizing places and 24 stable transitions
Graph (complete) has 299 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 273 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[p1, p1, p1, true, p1]
Incomplete random walk after 10000 steps, including 2258 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1890818 steps, run timeout after 3001 ms. (steps per millisecond=630 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1890818 steps, saw 814030 distinct states, run finished after 3001 ms. (steps per millisecond=630 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-19 17:40:36] [INFO ] Invariant cache hit.
[2023-03-19 17:40:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:36] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-19 17:40:36] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:40:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 26 ms returned sat
[2023-03-19 17:40:36] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 13 ms returned sat
[2023-03-19 17:40:36] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:40:36] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 17:40:36] [INFO ] After 37ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:40:36] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-19 17:40:36] [INFO ] After 285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 110/110 transitions.
Graph (complete) has 265 edges and 93 vertex of which 92 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 92 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 91 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 91 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 90 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 90 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 90 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 89 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 89 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 89 transition count 96
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 88 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 88 transition count 95
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 87 transition count 94
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 86 transition count 93
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 86 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 19 place count 85 transition count 91
Iterating global reduction 4 with 1 rules applied. Total rules applied 20 place count 85 transition count 91
Applied a total of 20 rules in 20 ms. Remains 85 /93 variables (removed 8) and now considering 91/110 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 85/93 places, 91/110 transitions.
Incomplete random walk after 10000 steps, including 2252 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 444 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2292269 steps, run timeout after 3001 ms. (steps per millisecond=763 ) properties seen :{}
Probabilistic random walk after 2292269 steps, saw 1063542 distinct states, run finished after 3001 ms. (steps per millisecond=763 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 91 rows 85 cols
[2023-03-19 17:40:39] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 17:40:39] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 17:40:39] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:40:40] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:40:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:40] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:40:40] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:40:40] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-19 17:40:40] [INFO ] After 17ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:40:40] [INFO ] After 29ms 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-19 17:40:40] [INFO ] After 140ms 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 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 85/85 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-19 17:40:40] [INFO ] Invariant cache hit.
[2023-03-19 17:40:40] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-19 17:40:40] [INFO ] Invariant cache hit.
[2023-03-19 17:40:40] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-19 17:40:40] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-19 17:40:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:40:40] [INFO ] Invariant cache hit.
[2023-03-19 17:40:40] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 85/85 places, 91/91 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 85
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 80 transition count 85
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 11 place count 80 transition count 69
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 43 place count 64 transition count 69
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 51 place count 60 transition count 65
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 60 transition count 65
Applied a total of 53 rules in 6 ms. Remains 60 /85 variables (removed 25) and now considering 65/91 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 65 rows 60 cols
[2023-03-19 17:40:40] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-19 17:40:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:40] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:40:40] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:40:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 17:40:40] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:40:40] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:40:40] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-19 17:40:40] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 4 factoid took 317 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 344 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 410 ms :[p1, p1, p1, true, p1]
Product exploration explored 100000 steps with 22466 reset in 152 ms.
Product exploration explored 100000 steps with 22386 reset in 178 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 285 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 6 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-19 17:40:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 110 rows 93 cols
[2023-03-19 17:40:42] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:40:43] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 93/93 places, 110/110 transitions.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-19 17:40:43] [INFO ] Invariant cache hit.
[2023-03-19 17:40:43] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-19 17:40:43] [INFO ] Invariant cache hit.
[2023-03-19 17:40:43] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 17:40:43] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-19 17:40:43] [INFO ] Invariant cache hit.
[2023-03-19 17:40:43] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 419 ms. Remains : 93/93 places, 110/110 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 finished in 22658 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' '!(((G(p0)||p1) U (X(X(p2)) U p3)))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 141 transition count 183
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 141 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 141 transition count 182
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 64 place count 122 transition count 161
Iterating global reduction 1 with 19 rules applied. Total rules applied 83 place count 122 transition count 161
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 93 place count 122 transition count 151
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 104 place count 111 transition count 139
Iterating global reduction 2 with 11 rules applied. Total rules applied 115 place count 111 transition count 139
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 120 place count 111 transition count 134
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 124 place count 107 transition count 130
Iterating global reduction 3 with 4 rules applied. Total rules applied 128 place count 107 transition count 130
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 132 place count 103 transition count 126
Iterating global reduction 3 with 4 rules applied. Total rules applied 136 place count 103 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 139 place count 100 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 142 place count 100 transition count 122
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 100 transition count 120
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 147 place count 97 transition count 117
Iterating global reduction 4 with 3 rules applied. Total rules applied 150 place count 97 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 151 place count 96 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 152 place count 96 transition count 116
Applied a total of 152 rules in 15 ms. Remains 96 /163 variables (removed 67) and now considering 116/314 (removed 198) transitions.
// Phase 1: matrix 116 rows 96 cols
[2023-03-19 17:40:43] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-19 17:40:44] [INFO ] Implicit Places using invariants in 875 ms returned []
[2023-03-19 17:40:44] [INFO ] Invariant cache hit.
[2023-03-19 17:40:44] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-19 17:40:44] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
[2023-03-19 17:40:44] [INFO ] Invariant cache hit.
[2023-03-19 17:40:44] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/163 places, 116/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1195 ms. Remains : 96/163 places, 116/314 transitions.
Stuttering acceptance computed with spot in 505 ms :[(NOT p3), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s45 1)), p1:(AND (GEQ s1 1) (GEQ s37 1)), p0:(AND (GEQ s1 1) (GEQ s91 1)), p2:(AND (GEQ s1 1) (GEQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-10 finished in 1748 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((p0||G(p1)))||(p2 U p3)))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 142 transition count 198
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 142 transition count 198
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 142 transition count 197
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 61 place count 124 transition count 177
Iterating global reduction 1 with 18 rules applied. Total rules applied 79 place count 124 transition count 177
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 88 place count 124 transition count 168
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 99 place count 113 transition count 156
Iterating global reduction 2 with 11 rules applied. Total rules applied 110 place count 113 transition count 156
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 115 place count 113 transition count 151
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 109 transition count 147
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 109 transition count 147
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 106 transition count 144
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 106 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 104 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 104 transition count 141
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 103 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 103 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 102 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 102 transition count 139
Applied a total of 137 rules in 24 ms. Remains 102 /163 variables (removed 61) and now considering 139/314 (removed 175) transitions.
// Phase 1: matrix 139 rows 102 cols
[2023-03-19 17:40:45] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:40:45] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-19 17:40:45] [INFO ] Invariant cache hit.
[2023-03-19 17:40:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-19 17:40:45] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2023-03-19 17:40:46] [INFO ] Invariant cache hit.
[2023-03-19 17:40:46] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/163 places, 139/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 751 ms. Remains : 102/163 places, 139/314 transitions.
Stuttering acceptance computed with spot in 388 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s97 1)), p3:(AND (GEQ s1 1) (GEQ s96 1)), p2:(AND (GEQ s1 1) (GEQ s47 1)), p1:(OR (LT s1 1) (LT s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22388 reset in 215 ms.
Product exploration explored 100000 steps with 22426 reset in 199 ms.
Computed a total of 19 stabilizing places and 26 stable transitions
Graph (complete) has 343 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) p1), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 964 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 377 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 438 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 705192 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :{0=1, 2=1, 4=1}
Probabilistic random walk after 705192 steps, saw 314097 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :3
Running SMT prover for 2 properties.
[2023-03-19 17:40:52] [INFO ] Invariant cache hit.
[2023-03-19 17:40:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:52] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 17:40:52] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-19 17:40:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:52] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 17 ms returned sat
[2023-03-19 17:40:52] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-19 17:40:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-19 17:40:52] [INFO ] After 32ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-19 17:40:52] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-19 17:40:52] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Graph (complete) has 305 edges and 102 vertex of which 101 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 101 transition count 137
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 99 transition count 127
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 99 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 97 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 97 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 97 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 95 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 95 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 95 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 20 place count 93 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 93 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 24 place count 91 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 89 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 89 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 33 place count 89 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 35 place count 87 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 87 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 38 place count 86 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 39 place count 86 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 40 place count 85 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 85 transition count 105
Applied a total of 41 rules in 28 ms. Remains 85 /102 variables (removed 17) and now considering 105/139 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 85/102 places, 105/139 transitions.
Incomplete random walk after 10000 steps, including 2216 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 477 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2267945 steps, run timeout after 3001 ms. (steps per millisecond=755 ) properties seen :{}
Probabilistic random walk after 2267945 steps, saw 984404 distinct states, run finished after 3001 ms. (steps per millisecond=755 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 85 cols
[2023-03-19 17:40:55] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 17:40:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:55] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 17:40:55] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:40:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:40:55] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-19 17:40:55] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:40:55] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-19 17:40:55] [INFO ] After 21ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:40:56] [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 14 ms.
[2023-03-19 17:40:56] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 85/85 places, 105/105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2023-03-19 17:40:56] [INFO ] Invariant cache hit.
[2023-03-19 17:40:56] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-19 17:40:56] [INFO ] Invariant cache hit.
[2023-03-19 17:40:56] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-19 17:40:56] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-19 17:40:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:40:56] [INFO ] Invariant cache hit.
[2023-03-19 17:40:56] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 491 ms. Remains : 85/85 places, 105/105 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 99
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 80 transition count 99
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 80 transition count 86
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 67 transition count 86
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 60 transition count 79
Applied a total of 51 rules in 5 ms. Remains 60 /85 variables (removed 25) and now considering 79/105 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 79 rows 60 cols
[2023-03-19 17:40:56] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-19 17:40:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:56] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:40:56] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:40:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:40:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 17:40:56] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:40:56] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-19 17:40:56] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) p1), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (G (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F (AND p1 p2 (NOT p0) (NOT p3))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 10 factoid took 1449 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
// Phase 1: matrix 139 rows 102 cols
[2023-03-19 17:40:58] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:40:59] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-19 17:40:59] [INFO ] Invariant cache hit.
[2023-03-19 17:40:59] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-19 17:40:59] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2023-03-19 17:40:59] [INFO ] Invariant cache hit.
[2023-03-19 17:40:59] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 685 ms. Remains : 102/102 places, 139/139 transitions.
Computed a total of 19 stabilizing places and 26 stable transitions
Graph (complete) has 343 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 19 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND p1 (NOT p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 557 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 450 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2110265 steps, run timeout after 3001 ms. (steps per millisecond=703 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 2110265 steps, saw 908678 distinct states, run finished after 3001 ms. (steps per millisecond=703 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-19 17:41:03] [INFO ] Invariant cache hit.
[2023-03-19 17:41:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:03] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 17:41:03] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:41:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:03] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:41:03] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:41:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-19 17:41:03] [INFO ] After 54ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:41:03] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-19 17:41:04] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Graph (complete) has 305 edges and 102 vertex of which 101 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 101 transition count 137
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 99 transition count 127
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 99 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 97 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 97 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 97 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 95 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 95 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 95 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 20 place count 93 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 93 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 24 place count 91 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 89 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 89 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 33 place count 89 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 35 place count 87 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 87 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 38 place count 86 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 39 place count 86 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 40 place count 85 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 85 transition count 105
Applied a total of 41 rules in 34 ms. Remains 85 /102 variables (removed 17) and now considering 105/139 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 85/102 places, 105/139 transitions.
Incomplete random walk after 10000 steps, including 2226 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 498 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2547375 steps, run timeout after 3001 ms. (steps per millisecond=848 ) properties seen :{}
Probabilistic random walk after 2547375 steps, saw 1106601 distinct states, run finished after 3001 ms. (steps per millisecond=848 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 85 cols
[2023-03-19 17:41:07] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-19 17:41:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:07] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:41:07] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:41:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:07] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:41:07] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:41:07] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-19 17:41:07] [INFO ] After 19ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:41:07] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-19 17:41:07] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 15 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 85/85 places, 105/105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2023-03-19 17:41:07] [INFO ] Invariant cache hit.
[2023-03-19 17:41:07] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-19 17:41:07] [INFO ] Invariant cache hit.
[2023-03-19 17:41:07] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-19 17:41:07] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-19 17:41:07] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-19 17:41:07] [INFO ] Invariant cache hit.
[2023-03-19 17:41:08] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 525 ms. Remains : 85/85 places, 105/105 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 99
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 80 transition count 99
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 80 transition count 86
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 67 transition count 86
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 60 transition count 79
Applied a total of 51 rules in 15 ms. Remains 60 /85 variables (removed 25) and now considering 79/105 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 79 rows 60 cols
[2023-03-19 17:41:08] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 17:41:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 17:41:08] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:41:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 17:41:08] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:41:08] [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 9 ms.
[2023-03-19 17:41:08] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND p1 (NOT p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 342 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22514 reset in 244 ms.
Product exploration explored 100000 steps with 22439 reset in 186 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2023-03-19 17:41:09] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 139 rows 102 cols
[2023-03-19 17:41:09] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:41:10] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 102/102 places, 139/139 transitions.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2023-03-19 17:41:10] [INFO ] Invariant cache hit.
[2023-03-19 17:41:10] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-19 17:41:10] [INFO ] Invariant cache hit.
[2023-03-19 17:41:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-19 17:41:10] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2023-03-19 17:41:10] [INFO ] Invariant cache hit.
[2023-03-19 17:41:10] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 602 ms. Remains : 102/102 places, 139/139 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 finished in 25459 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 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 188
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 187
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 120 transition count 163
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 120 transition count 163
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 96 place count 120 transition count 154
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 108 transition count 141
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 108 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 108 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 104 transition count 132
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 104 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 100 transition count 128
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 100 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 97 transition count 124
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 97 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 95 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 95 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 153 place count 93 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 158 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 91 transition count 117
Applied a total of 159 rules in 28 ms. Remains 91 /163 variables (removed 72) and now considering 117/314 (removed 197) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-19 17:41:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:41:11] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-19 17:41:11] [INFO ] Invariant cache hit.
[2023-03-19 17:41:11] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-19 17:41:11] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2023-03-19 17:41:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:41:11] [INFO ] Invariant cache hit.
[2023-03-19 17:41:11] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/163 places, 117/314 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 549 ms. Remains : 91/163 places, 117/314 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-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:(AND (OR (LT s1 1) (LT s84 1)) (OR (LT s1 1) (LT s86 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 22429 reset in 110 ms.
Product exploration explored 100000 steps with 22461 reset in 121 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 236 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 43 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2230 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4402 steps, run visited all 1 properties in 11 ms. (steps per millisecond=400 )
Probabilistic random walk after 4402 steps, saw 1996 distinct states, run finished after 12 ms. (steps per millisecond=366 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 352 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 4 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-19 17:41:12] [INFO ] Invariant cache hit.
[2023-03-19 17:41:12] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-19 17:41:12] [INFO ] Invariant cache hit.
[2023-03-19 17:41:12] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-19 17:41:12] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-19 17:41:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:41:12] [INFO ] Invariant cache hit.
[2023-03-19 17:41:13] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 540 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 194 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 44 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2224 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 468 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4402 steps, run visited all 1 properties in 25 ms. (steps per millisecond=176 )
Probabilistic random walk after 4402 steps, saw 1996 distinct states, run finished after 26 ms. (steps per millisecond=169 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 387 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 89 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22421 reset in 141 ms.
Product exploration explored 100000 steps with 22403 reset in 163 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-19 17:41:14] [INFO ] Invariant cache hit.
[2023-03-19 17:41:14] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-19 17:41:14] [INFO ] Invariant cache hit.
[2023-03-19 17:41:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-19 17:41:15] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned []
Implicit Place search using SMT with State Equation took 1511 ms to find 0 implicit places.
[2023-03-19 17:41:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:41:15] [INFO ] Invariant cache hit.
[2023-03-19 17:41:15] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1619 ms. Remains : 91/91 places, 117/117 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-12 finished in 5166 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' '!((G((X(!p1)||p0))&&X(X(X(F(p2))))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 188
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 187
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 120 transition count 163
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 120 transition count 163
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 96 place count 120 transition count 154
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 108 transition count 141
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 108 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 108 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 104 transition count 132
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 104 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 100 transition count 128
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 100 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 96 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 96 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 152 place count 96 transition count 120
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 155 place count 93 transition count 117
Iterating global reduction 4 with 3 rules applied. Total rules applied 158 place count 93 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 160 place count 91 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 91 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 163 place count 90 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 164 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 89 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 89 transition count 112
Applied a total of 166 rules in 11 ms. Remains 89 /163 variables (removed 74) and now considering 112/314 (removed 202) transitions.
// Phase 1: matrix 112 rows 89 cols
[2023-03-19 17:41:16] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:41:16] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-19 17:41:16] [INFO ] Invariant cache hit.
[2023-03-19 17:41:16] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-19 17:41:16] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-19 17:41:16] [INFO ] Invariant cache hit.
[2023-03-19 17:41:16] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/163 places, 112/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 473 ms. Remains : 89/163 places, 112/314 transitions.
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p2) (AND (NOT p0) p1)), p1, (AND (NOT p0) p1), (NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s83 1)), p1:(AND (GEQ s1 1) (GEQ s84 1)), p2:(AND (GEQ s1 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 19 steps with 3 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-13 finished in 899 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 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 139 transition count 179
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 139 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 139 transition count 178
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 70 place count 118 transition count 153
Iterating global reduction 1 with 21 rules applied. Total rules applied 91 place count 118 transition count 153
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 101 place count 118 transition count 143
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 114 place count 105 transition count 129
Iterating global reduction 2 with 13 rules applied. Total rules applied 127 place count 105 transition count 129
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 133 place count 105 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 138 place count 100 transition count 118
Iterating global reduction 3 with 5 rules applied. Total rules applied 143 place count 100 transition count 118
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 148 place count 95 transition count 113
Iterating global reduction 3 with 5 rules applied. Total rules applied 153 place count 95 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 157 place count 91 transition count 108
Iterating global reduction 3 with 4 rules applied. Total rules applied 161 place count 91 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 163 place count 91 transition count 106
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 166 place count 88 transition count 103
Iterating global reduction 4 with 3 rules applied. Total rules applied 169 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 171 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 173 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 174 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 176 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 177 place count 84 transition count 98
Applied a total of 177 rules in 17 ms. Remains 84 /163 variables (removed 79) and now considering 98/314 (removed 216) transitions.
// Phase 1: matrix 98 rows 84 cols
[2023-03-19 17:41:16] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-19 17:41:17] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-03-19 17:41:17] [INFO ] Invariant cache hit.
[2023-03-19 17:41:17] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 17:41:17] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2023-03-19 17:41:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:41:17] [INFO ] Invariant cache hit.
[2023-03-19 17:41:17] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/163 places, 98/314 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 911 ms. Remains : 84/163 places, 98/314 transitions.
Stuttering acceptance computed with spot in 48 ms :[p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s78 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 22538 reset in 91 ms.
Product exploration explored 100000 steps with 22537 reset in 100 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 167 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 :[p0]
Incomplete random walk after 10000 steps, including 2225 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 446 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3968 steps, run visited all 1 properties in 11 ms. (steps per millisecond=360 )
Probabilistic random walk after 3968 steps, saw 1817 distinct states, run finished after 11 ms. (steps per millisecond=360 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 204 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 49 ms :[p0]
Stuttering acceptance computed with spot in 64 ms :[p0]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-19 17:41:18] [INFO ] Invariant cache hit.
[2023-03-19 17:41:18] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-19 17:41:18] [INFO ] Invariant cache hit.
[2023-03-19 17:41:18] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 17:41:19] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2023-03-19 17:41:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:41:19] [INFO ] Invariant cache hit.
[2023-03-19 17:41:19] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 931 ms. Remains : 84/84 places, 98/98 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 147 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 51 ms :[p0]
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3968 steps, run visited all 1 properties in 23 ms. (steps per millisecond=172 )
Probabilistic random walk after 3968 steps, saw 1817 distinct states, run finished after 23 ms. (steps per millisecond=172 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 162 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 :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
Stuttering acceptance computed with spot in 57 ms :[p0]
Product exploration explored 100000 steps with 22423 reset in 126 ms.
Product exploration explored 100000 steps with 22260 reset in 162 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 15 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-19 17:41:20] [INFO ] Invariant cache hit.
[2023-03-19 17:41:20] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-19 17:41:20] [INFO ] Invariant cache hit.
[2023-03-19 17:41:20] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 17:41:20] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-19 17:41:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:41:20] [INFO ] Invariant cache hit.
[2023-03-19 17:41:20] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 404 ms. Remains : 84/84 places, 98/98 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-15 finished in 4087 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(X((!p0 U G(!p1)))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-09
Stuttering acceptance computed with spot in 269 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 180
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 179
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 120 transition count 157
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 120 transition count 157
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 97 place count 120 transition count 147
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 109 place count 108 transition count 134
Iterating global reduction 2 with 12 rules applied. Total rules applied 121 place count 108 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 127 place count 108 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 131 place count 104 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 104 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 139 place count 100 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 100 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 146 place count 97 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 149 place count 97 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 151 place count 97 transition count 114
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 154 place count 94 transition count 111
Iterating global reduction 4 with 3 rules applied. Total rules applied 157 place count 94 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 158 place count 93 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 93 transition count 110
Applied a total of 159 rules in 39 ms. Remains 93 /163 variables (removed 70) and now considering 110/314 (removed 204) transitions.
// Phase 1: matrix 110 rows 93 cols
[2023-03-19 17:41:21] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:41:21] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-19 17:41:21] [INFO ] Invariant cache hit.
[2023-03-19 17:41:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 17:41:21] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-19 17:41:21] [INFO ] Invariant cache hit.
[2023-03-19 17:41:21] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 93/163 places, 110/314 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 562 ms. Remains : 93/163 places, 110/314 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s88 1)), p0:(AND (GEQ s1 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22471 reset in 139 ms.
Product exploration explored 100000 steps with 22346 reset in 148 ms.
Computed a total of 19 stabilizing places and 24 stable transitions
Graph (complete) has 299 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 344 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[p1, p1, p1, true, p1]
Incomplete random walk after 10000 steps, including 2250 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 492 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 570774 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{0=1, 1=1, 4=1}
Probabilistic random walk after 570774 steps, saw 253083 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :3
Running SMT prover for 2 properties.
[2023-03-19 17:41:26] [INFO ] Invariant cache hit.
[2023-03-19 17:41:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:26] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:41:26] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-19 17:41:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:26] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:41:26] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-19 17:41:26] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 17:41:26] [INFO ] After 25ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-19 17:41:26] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-19 17:41:26] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 110/110 transitions.
Graph (complete) has 265 edges and 93 vertex of which 92 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 92 transition count 108
Applied a total of 3 rules in 4 ms. Remains 92 /93 variables (removed 1) and now considering 108/110 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 92/93 places, 108/110 transitions.
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2589160 steps, run timeout after 3001 ms. (steps per millisecond=862 ) properties seen :{}
Probabilistic random walk after 2589160 steps, saw 1139380 distinct states, run finished after 3001 ms. (steps per millisecond=862 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 92 cols
[2023-03-19 17:41:29] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-19 17:41:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:41:29] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 17:41:29] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:41:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:29] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:41:29] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:41:29] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-19 17:41:29] [INFO ] After 35ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:41:29] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-19 17:41:29] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 92/92 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-19 17:41:30] [INFO ] Invariant cache hit.
[2023-03-19 17:41:30] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-19 17:41:30] [INFO ] Invariant cache hit.
[2023-03-19 17:41:31] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-19 17:41:31] [INFO ] Implicit Places using invariants and state equation in 1645 ms returned []
Implicit Place search using SMT with State Equation took 1778 ms to find 0 implicit places.
[2023-03-19 17:41:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:41:31] [INFO ] Invariant cache hit.
[2023-03-19 17:41:31] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1871 ms. Remains : 92/92 places, 108/108 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 92 transition count 102
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 87 transition count 102
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 11 place count 87 transition count 87
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 41 place count 72 transition count 87
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 65 transition count 80
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 65 transition count 80
Applied a total of 57 rules in 24 ms. Remains 65 /92 variables (removed 27) and now considering 80/108 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 80 rows 65 cols
[2023-03-19 17:41:31] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 17:41:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:31] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:41:32] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:41:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:32] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:41:32] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:41:32] [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 13 ms.
[2023-03-19 17:41:32] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 551 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 430 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 276 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 0 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 93 cols
[2023-03-19 17:41:33] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:41:33] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-19 17:41:33] [INFO ] Invariant cache hit.
[2023-03-19 17:41:33] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 17:41:33] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2023-03-19 17:41:33] [INFO ] Invariant cache hit.
[2023-03-19 17:41:33] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 567 ms. Remains : 93/93 places, 110/110 transitions.
Computed a total of 19 stabilizing places and 24 stable transitions
Graph (complete) has 299 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 19 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 355 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[p1, p1, p1, true, p1]
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 524 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1884786 steps, run timeout after 3001 ms. (steps per millisecond=628 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1884786 steps, saw 811386 distinct states, run finished after 3012 ms. (steps per millisecond=625 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-19 17:41:38] [INFO ] Invariant cache hit.
[2023-03-19 17:41:38] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 17:41:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:41:38] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:41:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:38] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:41:38] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:41:38] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 17:41:38] [INFO ] After 26ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:41:38] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-19 17:41:38] [INFO ] After 189ms 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 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 110/110 transitions.
Graph (complete) has 265 edges and 93 vertex of which 92 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 92 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 91 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 91 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 90 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 90 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 90 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 89 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 89 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 89 transition count 96
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 88 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 88 transition count 95
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 87 transition count 94
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 86 transition count 93
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 86 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 19 place count 85 transition count 91
Iterating global reduction 4 with 1 rules applied. Total rules applied 20 place count 85 transition count 91
Applied a total of 20 rules in 28 ms. Remains 85 /93 variables (removed 8) and now considering 91/110 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 85/93 places, 91/110 transitions.
Incomplete random walk after 10000 steps, including 2251 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 504 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2605238 steps, run timeout after 3001 ms. (steps per millisecond=868 ) properties seen :{}
Probabilistic random walk after 2605238 steps, saw 1208724 distinct states, run finished after 3001 ms. (steps per millisecond=868 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 91 rows 85 cols
[2023-03-19 17:41:41] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 17:41:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:41] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:41:41] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:41:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:41:41] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:41:41] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-19 17:41:41] [INFO ] After 16ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:41:41] [INFO ] After 30ms 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-19 17:41:41] [INFO ] After 147ms 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 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 85/85 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-19 17:41:41] [INFO ] Invariant cache hit.
[2023-03-19 17:41:41] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-19 17:41:41] [INFO ] Invariant cache hit.
[2023-03-19 17:41:41] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-19 17:41:42] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-19 17:41:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:41:42] [INFO ] Invariant cache hit.
[2023-03-19 17:41:42] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 368 ms. Remains : 85/85 places, 91/91 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 85
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 80 transition count 85
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 11 place count 80 transition count 69
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 43 place count 64 transition count 69
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 51 place count 60 transition count 65
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 60 transition count 65
Applied a total of 53 rules in 10 ms. Remains 60 /85 variables (removed 25) and now considering 65/91 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 65 rows 60 cols
[2023-03-19 17:41:42] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:41:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:42] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:41:42] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:41:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:42] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:41:42] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:41:42] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-19 17:41:42] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 4 factoid took 300 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 214 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 267 ms :[p1, p1, p1, true, p1]
Product exploration explored 100000 steps with 22494 reset in 147 ms.
Product exploration explored 100000 steps with 22355 reset in 149 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 259 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-19 17:41:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 110 rows 93 cols
[2023-03-19 17:41:44] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:41:44] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 93/93 places, 110/110 transitions.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 9 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-19 17:41:44] [INFO ] Invariant cache hit.
[2023-03-19 17:41:44] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-19 17:41:44] [INFO ] Invariant cache hit.
[2023-03-19 17:41:44] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 17:41:44] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-19 17:41:44] [INFO ] Invariant cache hit.
[2023-03-19 17:41:44] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 452 ms. Remains : 93/93 places, 110/110 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 finished in 23753 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((p0||G(p1)))||(p2 U p3)))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-11
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 142 transition count 198
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 142 transition count 198
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 142 transition count 197
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 61 place count 124 transition count 177
Iterating global reduction 1 with 18 rules applied. Total rules applied 79 place count 124 transition count 177
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 88 place count 124 transition count 168
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 99 place count 113 transition count 156
Iterating global reduction 2 with 11 rules applied. Total rules applied 110 place count 113 transition count 156
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 115 place count 113 transition count 151
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 109 transition count 147
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 109 transition count 147
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 106 transition count 144
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 106 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 104 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 104 transition count 141
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 103 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 103 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 102 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 102 transition count 139
Applied a total of 137 rules in 29 ms. Remains 102 /163 variables (removed 61) and now considering 139/314 (removed 175) transitions.
// Phase 1: matrix 139 rows 102 cols
[2023-03-19 17:41:45] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:41:45] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-19 17:41:45] [INFO ] Invariant cache hit.
[2023-03-19 17:41:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-19 17:41:45] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-19 17:41:45] [INFO ] Invariant cache hit.
[2023-03-19 17:41:45] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 102/163 places, 139/314 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 488 ms. Remains : 102/163 places, 139/314 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s97 1)), p3:(AND (GEQ s1 1) (GEQ s96 1)), p2:(AND (GEQ s1 1) (GEQ s47 1)), p1:(OR (LT s1 1) (LT s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22440 reset in 113 ms.
Product exploration explored 100000 steps with 22453 reset in 136 ms.
Computed a total of 19 stabilizing places and 26 stable transitions
Graph (complete) has 343 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) p1), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 801 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 435 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 528815 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{0=1, 2=1, 4=1}
Probabilistic random walk after 528815 steps, saw 234923 distinct states, run finished after 3002 ms. (steps per millisecond=176 ) properties seen :3
Running SMT prover for 2 properties.
[2023-03-19 17:41:50] [INFO ] Invariant cache hit.
[2023-03-19 17:41:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:50] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 15 ms returned sat
[2023-03-19 17:41:50] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-19 17:41:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:50] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:41:50] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-19 17:41:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-19 17:41:50] [INFO ] After 52ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-19 17:41:50] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-19 17:41:50] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Graph (complete) has 305 edges and 102 vertex of which 101 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 101 transition count 137
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 99 transition count 127
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 99 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 97 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 97 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 97 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 95 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 95 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 95 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 20 place count 93 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 93 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 24 place count 91 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 89 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 89 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 33 place count 89 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 35 place count 87 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 87 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 38 place count 86 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 39 place count 86 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 40 place count 85 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 85 transition count 105
Applied a total of 41 rules in 17 ms. Remains 85 /102 variables (removed 17) and now considering 105/139 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 85/102 places, 105/139 transitions.
Incomplete random walk after 10000 steps, including 2235 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 466 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2661115 steps, run timeout after 3001 ms. (steps per millisecond=886 ) properties seen :{}
Probabilistic random walk after 2661115 steps, saw 1155059 distinct states, run finished after 3001 ms. (steps per millisecond=886 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 85 cols
[2023-03-19 17:41:53] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-19 17:41:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:54] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 17:41:54] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:41:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:54] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:41:54] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:41:54] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-19 17:41:54] [INFO ] After 23ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:41:54] [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 15 ms.
[2023-03-19 17:41:54] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 85/85 places, 105/105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2023-03-19 17:41:54] [INFO ] Invariant cache hit.
[2023-03-19 17:41:54] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-19 17:41:54] [INFO ] Invariant cache hit.
[2023-03-19 17:41:54] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-19 17:41:54] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-19 17:41:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:41:54] [INFO ] Invariant cache hit.
[2023-03-19 17:41:54] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 85/85 places, 105/105 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 99
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 80 transition count 99
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 80 transition count 86
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 67 transition count 86
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 60 transition count 79
Applied a total of 51 rules in 3 ms. Remains 60 /85 variables (removed 25) and now considering 79/105 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 79 rows 60 cols
[2023-03-19 17:41:54] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 17:41:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:41:54] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:41:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:41:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:41:54] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:41:54] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-19 17:41:54] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) p1), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (G (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F (AND p1 p2 (NOT p0) (NOT p3))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 10 factoid took 597 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
// Phase 1: matrix 139 rows 102 cols
[2023-03-19 17:41:55] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:41:56] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-19 17:41:56] [INFO ] Invariant cache hit.
[2023-03-19 17:41:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-19 17:41:56] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-19 17:41:56] [INFO ] Invariant cache hit.
[2023-03-19 17:41:56] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 102/102 places, 139/139 transitions.
Computed a total of 19 stabilizing places and 26 stable transitions
Graph (complete) has 343 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND p1 (NOT p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 406 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2184 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2010194 steps, run timeout after 3001 ms. (steps per millisecond=669 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 2010194 steps, saw 862348 distinct states, run finished after 3001 ms. (steps per millisecond=669 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-19 17:42:00] [INFO ] Invariant cache hit.
[2023-03-19 17:42:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:42:00] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:42:00] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:42:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:42:00] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-19 17:42:00] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:42:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-19 17:42:00] [INFO ] After 54ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:42:00] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-19 17:42:00] [INFO ] After 286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Graph (complete) has 305 edges and 102 vertex of which 101 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 101 transition count 137
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 99 transition count 127
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 99 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 97 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 97 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 97 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 95 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 95 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 95 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 20 place count 93 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 93 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 24 place count 91 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 89 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 89 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 33 place count 89 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 35 place count 87 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 87 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 38 place count 86 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 39 place count 86 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 40 place count 85 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 85 transition count 105
Applied a total of 41 rules in 25 ms. Remains 85 /102 variables (removed 17) and now considering 105/139 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 85/102 places, 105/139 transitions.
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 422 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2161417 steps, run timeout after 3001 ms. (steps per millisecond=720 ) properties seen :{}
Probabilistic random walk after 2161417 steps, saw 936882 distinct states, run finished after 3001 ms. (steps per millisecond=720 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 85 cols
[2023-03-19 17:42:03] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 17:42:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:42:03] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:42:03] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:42:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:42:04] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:42:04] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:42:04] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-19 17:42:04] [INFO ] After 21ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:42:04] [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 16 ms.
[2023-03-19 17:42:04] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 85/85 places, 105/105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2023-03-19 17:42:04] [INFO ] Invariant cache hit.
[2023-03-19 17:42:04] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-19 17:42:04] [INFO ] Invariant cache hit.
[2023-03-19 17:42:04] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-19 17:42:04] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-19 17:42:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:42:04] [INFO ] Invariant cache hit.
[2023-03-19 17:42:04] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 85/85 places, 105/105 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 99
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 80 transition count 99
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 80 transition count 86
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 67 transition count 86
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 60 transition count 79
Applied a total of 51 rules in 4 ms. Remains 60 /85 variables (removed 25) and now considering 79/105 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 79 rows 60 cols
[2023-03-19 17:42:04] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 17:42:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:42:04] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:42:04] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:42:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:42:04] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:42:04] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:42:04] [INFO ] After 39ms 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-19 17:42:04] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND p1 (NOT p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 560 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22433 reset in 180 ms.
Product exploration explored 100000 steps with 22359 reset in 161 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2023-03-19 17:42:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 139 rows 102 cols
[2023-03-19 17:42:06] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:42:06] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 102/102 places, 139/139 transitions.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2023-03-19 17:42:06] [INFO ] Invariant cache hit.
[2023-03-19 17:42:06] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-19 17:42:06] [INFO ] Invariant cache hit.
[2023-03-19 17:42:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-19 17:42:07] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-19 17:42:07] [INFO ] Invariant cache hit.
[2023-03-19 17:42:07] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 102/102 places, 139/139 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 finished in 22398 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)))'
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)))'
[2023-03-19 17:42:07] [INFO ] Flatten gal took : 35 ms
[2023-03-19 17:42:07] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-19 17:42:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 163 places, 314 transitions and 1239 arcs took 11 ms.
Total runtime 142299 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SieveSingleMsgMbox-PT-d1m96
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

BK_STOP 1679247818053

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 SieveSingleMsgMbox-PT-d1m96-LTLFireability-09
lola: time limit : 900 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/900 8/32 SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 994332 m, 198866 m/sec, 2127898 t fired, .

Time elapsed: 5 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/900 16/32 SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 2024045 m, 205942 m/sec, 4368565 t fired, .

Time elapsed: 10 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/900 24/32 SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 3056832 m, 206557 m/sec, 6621065 t fired, .

Time elapsed: 15 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/900 32/32 SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 4060087 m, 200651 m/sec, 8836511 t fired, .

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 4 (type EXCL) for 3 SieveSingleMsgMbox-PT-d1m96-LTLFireability-11
lola: time limit : 1191 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1191 8/32 SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 922907 m, 184581 m/sec, 1971849 t fired, .

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1191 15/32 SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 1868299 m, 189078 m/sec, 4027204 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1191 23/32 SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 2914644 m, 209269 m/sec, 6309555 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1191 31/32 SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 3919131 m, 200897 m/sec, 8527701 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 4 (type EXCL) for SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 10 (type EXCL) for 9 SieveSingleMsgMbox-PT-d1m96-LTLFireability-15
lola: time limit : 1775 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1775 8/32 SieveSingleMsgMbox-PT-d1m96-LTLFireability-15 1003022 m, 200604 m/sec, 2148618 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1775 17/32 SieveSingleMsgMbox-PT-d1m96-LTLFireability-15 2101314 m, 219658 m/sec, 4536767 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/1775 25/32 SieveSingleMsgMbox-PT-d1m96-LTLFireability-15 3196606 m, 219058 m/sec, 6927857 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for SieveSingleMsgMbox-PT-d1m96-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 7 (type EXCL) for 6 SieveSingleMsgMbox-PT-d1m96-LTLFireability-12
lola: time limit : 3530 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/3530 9/32 SieveSingleMsgMbox-PT-d1m96-LTLFireability-12 1061564 m, 212312 m/sec, 2280513 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/3530 17/32 SieveSingleMsgMbox-PT-d1m96-LTLFireability-12 2158644 m, 219416 m/sec, 4664977 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/3530 26/32 SieveSingleMsgMbox-PT-d1m96-LTLFireability-12 3271862 m, 222643 m/sec, 7089554 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 7 (type EXCL) for SieveSingleMsgMbox-PT-d1m96-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m96-LTLFireability-09: LTL unknown AGGR
SieveSingleMsgMbox-PT-d1m96-LTLFireability-11: LTL unknown AGGR
SieveSingleMsgMbox-PT-d1m96-LTLFireability-12: LTL unknown AGGR
SieveSingleMsgMbox-PT-d1m96-LTLFireability-15: LTL unknown AGGR


Time elapsed: 90 secs. Pages in use: 32

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-d1m96"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is SieveSingleMsgMbox-PT-d1m96, 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 r423-tajo-167905976700444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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