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.r425-tajo-167905978200419.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 ltsminxred
Input is SieveSingleMsgMbox-PT-d1m18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978200419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.3K Feb 26 10:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 10:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 10:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 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-d1m18-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679314836601

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m18
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:20:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 12:20:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:20:38] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-20 12:20:38] [INFO ] Transformed 1295 places.
[2023-03-20 12:20:38] [INFO ] Transformed 749 transitions.
[2023-03-20 12:20:38] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 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 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 316 place count 183 transition count 236
Iterating global reduction 1 with 59 rules applied. Total rules applied 375 place count 183 transition count 236
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 383 place count 183 transition count 228
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 426 place count 140 transition count 185
Iterating global reduction 2 with 43 rules applied. Total rules applied 469 place count 140 transition count 185
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 485 place count 140 transition count 169
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 509 place count 116 transition count 143
Iterating global reduction 3 with 24 rules applied. Total rules applied 533 place count 116 transition count 143
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 548 place count 116 transition count 128
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 554 place count 110 transition count 120
Iterating global reduction 4 with 6 rules applied. Total rules applied 560 place count 110 transition count 120
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 566 place count 104 transition count 114
Iterating global reduction 4 with 6 rules applied. Total rules applied 572 place count 104 transition count 114
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 575 place count 101 transition count 110
Iterating global reduction 4 with 3 rules applied. Total rules applied 578 place count 101 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 579 place count 101 transition count 109
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 582 place count 98 transition count 106
Iterating global reduction 5 with 3 rules applied. Total rules applied 585 place count 98 transition count 106
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 587 place count 96 transition count 104
Iterating global reduction 5 with 2 rules applied. Total rules applied 589 place count 96 transition count 104
Applied a total of 589 rules in 70 ms. Remains 96 /259 variables (removed 163) and now considering 104/749 (removed 645) transitions.
// Phase 1: matrix 104 rows 96 cols
[2023-03-20 12:20:38] [INFO ] Computed 5 place invariants in 13 ms
[2023-03-20 12:20:38] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-20 12:20:38] [INFO ] Invariant cache hit.
[2023-03-20 12:20:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-20 12:20:39] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-03-20 12:20:39] [INFO ] Invariant cache hit.
[2023-03-20 12:20:39] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/259 places, 104/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 646 ms. Remains : 96/259 places, 104/749 transitions.
Support contains 5 out of 96 places after structural reductions.
[2023-03-20 12:20:39] [INFO ] Flatten gal took : 33 ms
[2023-03-20 12:20:39] [INFO ] Flatten gal took : 12 ms
[2023-03-20 12:20:39] [INFO ] Input system was already deterministic with 104 transitions.
Incomplete random walk after 10000 steps, including 2225 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 1007 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1000 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1051 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1031 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 12:20:40] [INFO ] Invariant cache hit.
[2023-03-20 12:20:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:20:40] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:20:40] [INFO ] After 53ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-20 12:20:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-20 12:20:40] [INFO ] After 35ms SMT Verify possible using 42 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 12:20:40] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 12:20:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:20:40] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:20:40] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 12:20:40] [INFO ] After 26ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 12:20:40] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-20 12:20:40] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 54 ms.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 104/104 transitions.
Graph (complete) has 265 edges and 96 vertex of which 95 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 95 transition count 102
Applied a total of 3 rules in 11 ms. Remains 95 /96 variables (removed 1) and now considering 102/104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 95/96 places, 102/104 transitions.
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1066 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 992 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1051 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 425099 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{2=1}
Probabilistic random walk after 425099 steps, saw 196037 distinct states, run finished after 3003 ms. (steps per millisecond=141 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 102 rows 95 cols
[2023-03-20 12:20:44] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-20 12:20:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:20:44] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 12:20:44] [INFO ] After 74ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-20 12:20:44] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 12:20:44] [INFO ] After 30ms SMT Verify possible using 40 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:20:44] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:20:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:20:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 12:20:44] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:20:44] [INFO ] After 48ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 12:20:44] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-20 12:20:44] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 102/102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 94 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 94 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 93 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 93 transition count 100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 91 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 91 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 90 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 90 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 89 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 89 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 88 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 88 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 87 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 87 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 86 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 85 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 85 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 84 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 84 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 83 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 83 transition count 88
Applied a total of 24 rules in 41 ms. Remains 83 /95 variables (removed 12) and now considering 88/102 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 83/95 places, 88/102 transitions.
Incomplete random walk after 10000 steps, including 2255 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1075 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1081 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 592628 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :{}
Probabilistic random walk after 592628 steps, saw 273003 distinct states, run finished after 3002 ms. (steps per millisecond=197 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 88 rows 83 cols
[2023-03-20 12:20:47] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-20 12:20:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:20:47] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 12:20:47] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-20 12:20:47] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 12:20:48] [INFO ] After 30ms SMT Verify possible using 35 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:20:48] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:20:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:20:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:20:48] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:20:48] [INFO ] After 16ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 12:20:48] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-20 12:20:48] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 83/83 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-20 12:20:48] [INFO ] Invariant cache hit.
[2023-03-20 12:20:48] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-20 12:20:48] [INFO ] Invariant cache hit.
[2023-03-20 12:20:48] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 12:20:48] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-20 12:20:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:20:48] [INFO ] Invariant cache hit.
[2023-03-20 12:20:48] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 434 ms. Remains : 83/83 places, 88/88 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 6 rules applied. Total rules applied 6 place count 83 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 79 transition count 82
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 10 place count 79 transition count 69
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 36 place count 66 transition count 69
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 50 place count 59 transition count 62
Applied a total of 50 rules in 13 ms. Remains 59 /83 variables (removed 24) and now considering 62/88 (removed 26) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 62 rows 59 cols
[2023-03-20 12:20:48] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-20 12:20:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 12:20:48] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:20:48] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-20 12:20:48] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2023-03-20 12:20:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-20 12:20:48] [INFO ] After 125ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:20:48] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:20:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 12:20:48] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:20:48] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:20:48] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2023-03-20 12:20:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-20 12:20:48] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-20 12:20:48] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Computed a total of 19 stabilizing places and 23 stable transitions
Graph (complete) has 300 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 94 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 94 transition count 102
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 92 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 92 transition count 100
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 89 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 89 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 89 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 87 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 87 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 86 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 85 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 85 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 84 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 83 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 82 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 81 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 80 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 80 transition count 85
Applied a total of 33 rules in 51 ms. Remains 80 /96 variables (removed 16) and now considering 85/104 (removed 19) transitions.
// Phase 1: matrix 85 rows 80 cols
[2023-03-20 12:20:49] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:20:49] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-20 12:20:49] [INFO ] Invariant cache hit.
[2023-03-20 12:20:49] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-20 12:20:49] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-03-20 12:20:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:20:49] [INFO ] Invariant cache hit.
[2023-03-20 12:20:49] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/96 places, 85/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 367 ms. Remains : 80/96 places, 85/104 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s67)], 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 22365 reset in 272 ms.
Product exploration explored 100000 steps with 22432 reset in 277 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 250 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 364 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 39 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1033 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2333781 steps, run timeout after 3001 ms. (steps per millisecond=777 ) properties seen :{}
Probabilistic random walk after 2333781 steps, saw 1085184 distinct states, run finished after 3001 ms. (steps per millisecond=777 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 12:20:53] [INFO ] Invariant cache hit.
[2023-03-20 12:20:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:20:53] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:20:53] [INFO ] After 28ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 12:20:53] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-20 12:20:53] [INFO ] After 10ms SMT Verify possible using 34 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:20:53] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:20:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 12:20:53] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:20:53] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:20:53] [INFO ] After 9ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:20:53] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-20 12:20:53] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 85/85 transitions.
Graph (complete) has 221 edges and 80 vertex of which 79 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 79 transition count 83
Applied a total of 3 rules in 10 ms. Remains 79 /80 variables (removed 1) and now considering 83/85 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 79/80 places, 83/85 transitions.
Incomplete random walk after 10000 steps, including 2267 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1044 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2665852 steps, run timeout after 3001 ms. (steps per millisecond=888 ) properties seen :{}
Probabilistic random walk after 2665852 steps, saw 1243042 distinct states, run finished after 3001 ms. (steps per millisecond=888 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 79 cols
[2023-03-20 12:20:56] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-20 12:20:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:20:56] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:20:56] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 12:20:56] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 12:20:56] [INFO ] After 13ms SMT Verify possible using 32 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:20:56] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:20:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:20:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:20:56] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:20:56] [INFO ] After 10ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:20:56] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-20 12:20:56] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 79/79 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-20 12:20:57] [INFO ] Invariant cache hit.
[2023-03-20 12:20:57] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-20 12:20:57] [INFO ] Invariant cache hit.
[2023-03-20 12:20:57] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 12:20:57] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-20 12:20:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:20:57] [INFO ] Invariant cache hit.
[2023-03-20 12:20:57] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 79/79 places, 83/83 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 6 rules applied. Total rules applied 6 place count 79 transition count 77
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 75 transition count 77
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 10 place count 75 transition count 63
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 38 place count 61 transition count 63
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 56 transition count 58
Applied a total of 48 rules in 7 ms. Remains 56 /79 variables (removed 23) and now considering 58/83 (removed 25) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 58 rows 56 cols
[2023-03-20 12:20:57] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-20 12:20:57] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-20 12:20:57] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:20:57] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 12:20:57] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2023-03-20 12:20:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-20 12:20:57] [INFO ] After 67ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:20:57] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:20:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-20 12:20:57] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 12:20:57] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:20:57] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2023-03-20 12:20:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-20 12:20:57] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-20 12:20:57] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 80 cols
[2023-03-20 12:20:57] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:20:58] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-20 12:20:58] [INFO ] Invariant cache hit.
[2023-03-20 12:20:58] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-20 12:20:58] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2023-03-20 12:20:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:20:58] [INFO ] Invariant cache hit.
[2023-03-20 12:20:58] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 455 ms. Remains : 80/80 places, 85/85 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 250 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 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 55 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2263 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1038 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2287316 steps, run timeout after 3001 ms. (steps per millisecond=762 ) properties seen :{}
Probabilistic random walk after 2287316 steps, saw 1062839 distinct states, run finished after 3016 ms. (steps per millisecond=758 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 12:21:01] [INFO ] Invariant cache hit.
[2023-03-20 12:21:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:21:01] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:21:01] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 12:21:01] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-20 12:21:01] [INFO ] After 28ms SMT Verify possible using 34 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:21:01] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:21:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:21:01] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:21:01] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:21:01] [INFO ] After 25ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:21:01] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-20 12:21:01] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 85/85 transitions.
Graph (complete) has 221 edges and 80 vertex of which 79 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 79 transition count 83
Applied a total of 3 rules in 9 ms. Remains 79 /80 variables (removed 1) and now considering 83/85 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 79/80 places, 83/85 transitions.
Incomplete random walk after 10000 steps, including 2261 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1042 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2533940 steps, run timeout after 3001 ms. (steps per millisecond=844 ) properties seen :{}
Probabilistic random walk after 2533940 steps, saw 1179548 distinct states, run finished after 3001 ms. (steps per millisecond=844 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 79 cols
[2023-03-20 12:21:04] [INFO ] Computed 4 place invariants in 15 ms
[2023-03-20 12:21:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:21:05] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 12:21:05] [INFO ] After 35ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 12:21:05] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 12:21:05] [INFO ] After 13ms SMT Verify possible using 32 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:21:05] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:21:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:21:05] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:21:05] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:21:05] [INFO ] After 10ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:21:05] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-20 12:21:05] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 79/79 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-20 12:21:05] [INFO ] Invariant cache hit.
[2023-03-20 12:21:05] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-20 12:21:05] [INFO ] Invariant cache hit.
[2023-03-20 12:21:05] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 12:21:05] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-20 12:21:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:21:05] [INFO ] Invariant cache hit.
[2023-03-20 12:21:05] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 79/79 places, 83/83 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 6 rules applied. Total rules applied 6 place count 79 transition count 77
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 75 transition count 77
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 10 place count 75 transition count 63
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 38 place count 61 transition count 63
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 56 transition count 58
Applied a total of 48 rules in 18 ms. Remains 56 /79 variables (removed 23) and now considering 58/83 (removed 25) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 58 rows 56 cols
[2023-03-20 12:21:05] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-20 12:21:05] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-20 12:21:05] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:21:05] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 12:21:05] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2023-03-20 12:21:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-20 12:21:05] [INFO ] After 88ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:21:05] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:21:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 12:21:05] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 12:21:05] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:21:05] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2023-03-20 12:21:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-20 12:21:05] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-20 12:21:05] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 226 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 70 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22415 reset in 123 ms.
Product exploration explored 100000 steps with 22331 reset in 138 ms.
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 80 cols
[2023-03-20 12:21:06] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:21:06] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-20 12:21:06] [INFO ] Invariant cache hit.
[2023-03-20 12:21:06] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-20 12:21:06] [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-20 12:21:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:21:06] [INFO ] Invariant cache hit.
[2023-03-20 12:21:07] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 513 ms. Remains : 80/80 places, 85/85 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02 finished in 18086 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) U p1))'
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 104/104 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 101
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 90 transition count 98
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 90 transition count 98
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 86 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 86 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 86 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 84 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 84 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 83 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 83 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 82 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 81 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 81 transition count 86
Applied a total of 32 rules in 17 ms. Remains 81 /96 variables (removed 15) and now considering 86/104 (removed 18) transitions.
// Phase 1: matrix 86 rows 81 cols
[2023-03-20 12:21:07] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 12:21:07] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-20 12:21:07] [INFO ] Invariant cache hit.
[2023-03-20 12:21:07] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-20 12:21:07] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-20 12:21:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:21:07] [INFO ] Invariant cache hit.
[2023-03-20 12:21:09] [INFO ] Dead Transitions using invariants and state equation in 2103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/96 places, 86/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2448 ms. Remains : 81/96 places, 86/104 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s42), p0:(LEQ 1 s10)], nbAcceptance=0, 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 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLCardinality-07 finished in 2622 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))'
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 94 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 94 transition count 102
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 92 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 92 transition count 100
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 89 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 89 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 89 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 88 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 88 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 87 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 87 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 86 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 85 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 85 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 84 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 83 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 83 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 82 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 81 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 81 transition count 86
Applied a total of 31 rules in 26 ms. Remains 81 /96 variables (removed 15) and now considering 86/104 (removed 18) transitions.
// Phase 1: matrix 86 rows 81 cols
[2023-03-20 12:21:09] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:21:09] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-20 12:21:09] [INFO ] Invariant cache hit.
[2023-03-20 12:21:09] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 12:21:09] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-20 12:21:10] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 12:21:10] [INFO ] Invariant cache hit.
[2023-03-20 12:21:10] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/96 places, 86/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 376 ms. Remains : 81/96 places, 86/104 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s72)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLCardinality-09 finished in 487 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 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 94 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 94 transition count 102
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 92 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 92 transition count 100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 90 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 90 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 90 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 89 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 89 transition count 95
Applied a total of 16 rules in 13 ms. Remains 89 /96 variables (removed 7) and now considering 95/104 (removed 9) transitions.
// Phase 1: matrix 95 rows 89 cols
[2023-03-20 12:21:10] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:21:10] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-20 12:21:10] [INFO ] Invariant cache hit.
[2023-03-20 12:21:10] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:21:10] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-20 12:21:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:21:10] [INFO ] Invariant cache hit.
[2023-03-20 12:21:10] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/96 places, 95/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 488 ms. Remains : 89/96 places, 95/104 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14 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:(GT 1 s57)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22508 reset in 160 ms.
Product exploration explored 100000 steps with 22469 reset in 142 ms.
Computed a total of 19 stabilizing places and 23 stable transitions
Graph (complete) has 278 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 208 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 994 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4140 steps, run visited all 1 properties in 12 ms. (steps per millisecond=345 )
Probabilistic random walk after 4140 steps, saw 1903 distinct states, run finished after 13 ms. (steps per millisecond=318 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-20 12:21:11] [INFO ] Invariant cache hit.
[2023-03-20 12:21:12] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-20 12:21:12] [INFO ] Invariant cache hit.
[2023-03-20 12:21:12] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:21:12] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2023-03-20 12:21:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:21:12] [INFO ] Invariant cache hit.
[2023-03-20 12:21:12] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 535 ms. Remains : 89/89 places, 95/95 transitions.
Computed a total of 19 stabilizing places and 23 stable transitions
Graph (complete) has 278 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 220 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2261 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1031 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4140 steps, run visited all 1 properties in 27 ms. (steps per millisecond=153 )
Probabilistic random walk after 4140 steps, saw 1903 distinct states, run finished after 28 ms. (steps per millisecond=147 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22421 reset in 107 ms.
Product exploration explored 100000 steps with 22472 reset in 120 ms.
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-20 12:21:13] [INFO ] Invariant cache hit.
[2023-03-20 12:21:13] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-20 12:21:13] [INFO ] Invariant cache hit.
[2023-03-20 12:21:13] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:21:13] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-20 12:21:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:21:14] [INFO ] Invariant cache hit.
[2023-03-20 12:21:14] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 400 ms. Remains : 89/89 places, 95/95 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14 finished in 3909 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' '!(G(F(p0)))'
[2023-03-20 12:21:14] [INFO ] Flatten gal took : 18 ms
[2023-03-20 12:21:14] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 12:21:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 96 places, 104 transitions and 413 arcs took 1 ms.
Total runtime 36122 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/934/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/934/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14

BK_STOP 1679314874990

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02
ltl formula formula --ltl=/tmp/934/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 96 places, 104 transitions and 413 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/934/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/934/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/934/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/934/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14
ltl formula formula --ltl=/tmp/934/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 96 places, 104 transitions and 413 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/934/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/934/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/934/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/934/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-d1m18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d1m18, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905978200419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m18.tgz
mv SieveSingleMsgMbox-PT-d1m18 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;