Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 10K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 03:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 12 03:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 03:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 03:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 127K May 18 16:42 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 IBMB2S565S3960-PT-none-LTLFireability-00
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-01
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-02
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-03
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-04
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-05
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-06
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-07
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-08
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-09
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-10
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-11
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-12
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-13
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-14
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716803077136

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBMB2S565S3960-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 09:44:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 09:44:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 09:44:39] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-27 09:44:39] [INFO ] Transformed 273 places.
[2024-05-27 09:44:39] [INFO ] Transformed 179 transitions.
[2024-05-27 09:44:39] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 179/179 transitions.
Ensure Unique test removed 82 places
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 181 transition count 178
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 110 place count 164 transition count 161
Iterating global reduction 1 with 17 rules applied. Total rules applied 127 place count 164 transition count 161
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 129 place count 162 transition count 159
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 162 transition count 159
Applied a total of 131 rules in 102 ms. Remains 162 /273 variables (removed 111) and now considering 159/179 (removed 20) transitions.
// Phase 1: matrix 159 rows 162 cols
[2024-05-27 09:44:39] [INFO ] Computed 15 invariants in 28 ms
[2024-05-27 09:44:40] [INFO ] Implicit Places using invariants in 301 ms returned [129]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 346 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/273 places, 159/179 transitions.
Applied a total of 0 rules in 10 ms. Remains 161 /161 variables (removed 0) and now considering 159/159 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 486 ms. Remains : 161/273 places, 159/179 transitions.
Support contains 42 out of 161 places after structural reductions.
[2024-05-27 09:44:40] [INFO ] Flatten gal took : 55 ms
[2024-05-27 09:44:40] [INFO ] Flatten gal took : 22 ms
[2024-05-27 09:44:40] [INFO ] Input system was already deterministic with 159 transitions.
Support contains 40 out of 161 places (down from 42) after GAL structural reductions.
RANDOM walk for 40002 steps (153 resets) in 2060 ms. (19 steps per ms) remains 11/28 properties
BEST_FIRST walk for 40002 steps (23 resets) in 475 ms. (84 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (24 resets) in 400 ms. (99 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40003 steps (22 resets) in 216 ms. (184 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (24 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (23 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
// Phase 1: matrix 159 rows 161 cols
[2024-05-27 09:44:41] [INFO ] Computed 14 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 9/15 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/27 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/28 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 24/52 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 15/67 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 22/89 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 21/110 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/110 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/110 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 33/143 variables, 14/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 6/149 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/149 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/149 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 36/185 variables, 18/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/185 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 36/221 variables, 19/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/221 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/221 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 29/250 variables, 15/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/250 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 25/275 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/275 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 15/290 variables, 8/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/290 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 14/304 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/304 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 11/315 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/315 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/315 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 5/320 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 39 (INCLUDED_ONLY) 0/320 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 0/320 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 175 constraints, problems are : Problem set: 0 solved, 3 unsolved in 702 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 9/15 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/27 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/28 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 24/52 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 15/67 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/67 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 22/89 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/89 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 21/110 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/110 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/110 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 33/143 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/143 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 6/149 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/149 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/149 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 36/185 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/185 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 36/221 variables, 19/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/221 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/221 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 29/250 variables, 15/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/250 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 25/275 variables, 14/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/275 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 15/290 variables, 8/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/290 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 14/304 variables, 7/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/304 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 11/315 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/315 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/315 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 5/320 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/320 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 0/320 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 178 constraints, problems are : Problem set: 0 solved, 3 unsolved in 546 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1287ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 506 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=56 )
Parikh walk visited 3 properties in 17 ms.
Computed a total of 67 stabilizing places and 69 stable transitions
Graph (complete) has 198 edges and 161 vertex of which 108 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(p1)||F(p2))))'
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 154 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 148 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 148 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 148 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 147 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 147 transition count 151
Applied a total of 22 rules in 21 ms. Remains 147 /161 variables (removed 14) and now considering 151/159 (removed 8) transitions.
// Phase 1: matrix 151 rows 147 cols
[2024-05-27 09:44:43] [INFO ] Computed 7 invariants in 3 ms
[2024-05-27 09:44:43] [INFO ] Implicit Places using invariants in 81 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/161 places, 151/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 145 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 145 transition count 150
Applied a total of 2 rules in 8 ms. Remains 145 /146 variables (removed 1) and now considering 150/151 (removed 1) transitions.
// Phase 1: matrix 150 rows 145 cols
[2024-05-27 09:44:43] [INFO ] Computed 6 invariants in 3 ms
[2024-05-27 09:44:43] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-27 09:44:43] [INFO ] Invariant cache hit.
[2024-05-27 09:44:43] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 145/161 places, 150/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 353 ms. Remains : 145/161 places, 150/159 transitions.
Stuttering acceptance computed with spot in 368 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-00
Product exploration explored 100000 steps with 480 reset in 378 ms.
Product exploration explored 100000 steps with 476 reset in 305 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 172 edges and 145 vertex of which 98 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.7 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 254 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
RANDOM walk for 40006 steps (171 resets) in 367 ms. (108 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40003 steps (25 resets) in 244 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (28 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (26 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (25 resets) in 154 ms. (258 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (27 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
[2024-05-27 09:44:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 11/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 9/25 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 23/48 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 16/64 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 24/88 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 35/123 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/123 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 45/168 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 4/172 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/172 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/172 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 43/215 variables, 23/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/215 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 34/249 variables, 19/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/249 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 20/269 variables, 11/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/269 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 16/285 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/285 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 9/294 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/294 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 1/295 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 151 constraints, problems are : Problem set: 0 solved, 5 unsolved in 611 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 11/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 9/25 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 23/48 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 16/64 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 24/88 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 35/123 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/123 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 45/168 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 4/172 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/172 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/172 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 43/215 variables, 23/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/215 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 34/249 variables, 19/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/249 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 20/269 variables, 11/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/269 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 16/285 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/285 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 9/294 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/294 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 1/295 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 156 constraints, problems are : Problem set: 0 solved, 5 unsolved in 757 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1379ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 2812 steps, including 6 resets, run visited all 5 properties in 39 ms. (steps per millisecond=72 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 41 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p0))), (F p0), (F (NOT (OR p2 p1))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 569 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 150/150 transitions.
Applied a total of 0 rules in 4 ms. Remains 145 /145 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-05-27 09:44:48] [INFO ] Invariant cache hit.
[2024-05-27 09:44:48] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-27 09:44:48] [INFO ] Invariant cache hit.
[2024-05-27 09:44:48] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-05-27 09:44:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 150/294 variables, 144/150 constraints. Problems are: Problem set: 0 solved, 149 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 1/295 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 151 constraints, problems are : Problem set: 0 solved, 149 unsolved in 5787 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 150/294 variables, 144/150 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 149/299 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 1/295 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 300 constraints, problems are : Problem set: 0 solved, 149 unsolved in 9238 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 15089ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 15101ms
Finished structural reductions in LTL mode , in 1 iterations and 15410 ms. Remains : 145/145 places, 150/150 transitions.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 172 edges and 145 vertex of which 98 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.2 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 173 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
RANDOM walk for 40001 steps (162 resets) in 172 ms. (231 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (25 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (26 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (27 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (25 resets) in 106 ms. (373 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (26 resets) in 66 ms. (597 steps per ms) remains 4/5 properties
[2024-05-27 09:45:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 11/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 9/25 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 23/48 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/64 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 24/88 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 35/123 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/123 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 45/168 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 4/172 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/172 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/172 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 43/215 variables, 23/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/215 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 34/249 variables, 19/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/249 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 20/269 variables, 11/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/269 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 16/285 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/285 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 9/294 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/294 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 1/295 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 151 constraints, problems are : Problem set: 0 solved, 4 unsolved in 510 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 11/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 9/25 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 23/48 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/64 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 24/88 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 35/123 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/123 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 45/168 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 4/172 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/172 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/172 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 43/215 variables, 23/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/215 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 34/249 variables, 19/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 20/269 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/269 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 16/285 variables, 8/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/285 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 9/294 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/294 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 1/295 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/295 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 0/295 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 155 constraints, problems are : Problem set: 0 solved, 4 unsolved in 518 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1040ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 2947 steps, including 6 resets, run visited all 4 properties in 21 ms. (steps per millisecond=140 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 22 ms.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p0))), (F p0), (F (NOT (OR p2 p1))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 553 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Product exploration explored 100000 steps with 482 reset in 121 ms.
Product exploration explored 100000 steps with 479 reset in 274 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 150/150 transitions.
Graph (trivial) has 126 edges and 145 vertex of which 18 / 145 are part of one of the 1 SCC in 5 ms
Free SCC test removed 17 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 153 edges and 128 vertex of which 97 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 27 output transitions
Drop transitions (Output transitions of discarded places.) removed 27 transitions
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 97 transition count 104
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 40 place count 97 transition count 105
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 55 place count 97 transition count 105
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 78 place count 74 transition count 82
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 101 place count 74 transition count 82
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 115 place count 74 transition count 84
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 131 place count 58 transition count 68
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 147 place count 58 transition count 68
Performed 9 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 156 place count 58 transition count 100
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 161 place count 58 transition count 95
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 174 place count 45 transition count 67
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 187 place count 45 transition count 67
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 187 rules in 47 ms. Remains 45 /145 variables (removed 100) and now considering 67/150 (removed 83) transitions.
[2024-05-27 09:45:07] [INFO ] Redundant transitions in 20 ms returned []
Running 65 sub problems to find dead transitions.
// Phase 1: matrix 67 rows 45 cols
[2024-05-27 09:45:07] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 09:45:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 2 (OVERLAPS) 66/110 variables, 44/47 constraints. Problems are: Problem set: 41 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/47 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 1/111 variables, 1/48 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/48 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 1/112 variables, 1/49 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/49 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/49 constraints. Problems are: Problem set: 41 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 49 constraints, problems are : Problem set: 41 solved, 24 unsolved in 825 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 41 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 3/23 variables, 1/3 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 60/83 variables, 23/26 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 24/50 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/50 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 28/111 variables, 22/72 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/72 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 1/112 variables, 1/73 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/73 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 0/112 variables, 0/73 constraints. Problems are: Problem set: 41 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 73 constraints, problems are : Problem set: 41 solved, 24 unsolved in 592 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 1441ms problems are : Problem set: 41 solved, 24 unsolved
Search for dead transitions found 41 dead transitions in 1444ms
Found 41 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 41 transitions
Dead transitions reduction (with SMT) removed 41 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 45/145 places, 26/150 transitions.
Graph (complete) has 35 edges and 45 vertex of which 21 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 4 ms. Remains 20 /45 variables (removed 25) and now considering 27/26 (removed -1) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/145 places, 27/150 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1528 ms. Remains : 20/145 places, 27/150 transitions.
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 150/150 transitions.
Applied a total of 0 rules in 5 ms. Remains 145 /145 variables (removed 0) and now considering 150/150 (removed 0) transitions.
// Phase 1: matrix 150 rows 145 cols
[2024-05-27 09:45:08] [INFO ] Computed 6 invariants in 2 ms
[2024-05-27 09:45:09] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-27 09:45:09] [INFO ] Invariant cache hit.
[2024-05-27 09:45:09] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-05-27 09:45:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 150/294 variables, 144/150 constraints. Problems are: Problem set: 0 solved, 149 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 1/295 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 151 constraints, problems are : Problem set: 0 solved, 149 unsolved in 5095 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 150/294 variables, 144/150 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 149/299 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 1/295 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 300 constraints, problems are : Problem set: 0 solved, 149 unsolved in 9077 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 14199ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 14202ms
Finished structural reductions in LTL mode , in 1 iterations and 14418 ms. Remains : 145/145 places, 150/150 transitions.
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-00 finished in 40126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F((G(p0)&&X(!p1)))&&G(!p2))||G((F(G(p0))&&F(!p1))))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 14 place count 147 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 147 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 147 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 145 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 145 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 144 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 144 transition count 149
Applied a total of 27 rules in 16 ms. Remains 144 /161 variables (removed 17) and now considering 149/159 (removed 10) transitions.
// Phase 1: matrix 149 rows 144 cols
[2024-05-27 09:45:23] [INFO ] Computed 6 invariants in 2 ms
[2024-05-27 09:45:23] [INFO ] Implicit Places using invariants in 265 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 272 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/161 places, 149/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 142 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 148
Applied a total of 2 rules in 6 ms. Remains 142 /143 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 142 cols
[2024-05-27 09:45:23] [INFO ] Computed 5 invariants in 2 ms
[2024-05-27 09:45:23] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 09:45:23] [INFO ] Invariant cache hit.
[2024-05-27 09:45:24] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 142/161 places, 148/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 528 ms. Remains : 142/161 places, 148/159 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-02
Product exploration explored 100000 steps with 650 reset in 307 ms.
Product exploration explored 100000 steps with 630 reset in 302 ms.
Computed a total of 62 stabilizing places and 65 stable transitions
Graph (complete) has 166 edges and 142 vertex of which 98 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.20 ms
Computed a total of 62 stabilizing places and 65 stable transitions
Detected a total of 62/142 stabilizing places and 65/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (AND p0 (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 301 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40003 steps (167 resets) in 41 ms. (952 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40003 steps (28 resets) in 36 ms. (1081 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (25 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
[2024-05-27 09:45:25] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
After SMT solving in domain Real declared 2/290 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 31 ms.
Refiners :[Generalized P Invariants (flows): 0/5 constraints, State Equation: 0/142 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (AND p0 (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 25 factoid took 688 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 444 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-27 09:45:27] [INFO ] Invariant cache hit.
[2024-05-27 09:45:27] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-27 09:45:27] [INFO ] Invariant cache hit.
[2024-05-27 09:45:27] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-05-27 09:45:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/289 variables, 141/146 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/290 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 147 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4821 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/289 variables, 141/146 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 147/293 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 1/290 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 294 constraints, problems are : Problem set: 0 solved, 147 unsolved in 10396 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 15257ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 15261ms
Finished structural reductions in LTL mode , in 1 iterations and 15492 ms. Remains : 142/142 places, 148/148 transitions.
Computed a total of 62 stabilizing places and 65 stable transitions
Graph (complete) has 166 edges and 142 vertex of which 98 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Computed a total of 62 stabilizing places and 65 stable transitions
Detected a total of 62/142 stabilizing places and 65/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 223 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
RANDOM walk for 40008 steps (165 resets) in 46 ms. (851 steps per ms) remains 2/9 properties
BEST_FIRST walk for 30756 steps (18 resets) in 23 ms. (1281 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 19 factoid took 480 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Product exploration explored 100000 steps with 658 reset in 120 ms.
Product exploration explored 100000 steps with 642 reset in 154 ms.
Applying partial POR strategy [false, true, false, false, true, false, true]
Stuttering acceptance computed with spot in 437 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 148/148 transitions.
Graph (trivial) has 121 edges and 142 vertex of which 18 / 142 are part of one of the 1 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 147 edges and 125 vertex of which 81 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.0 ms
Discarding 44 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 81 transition count 89
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 34 place count 81 transition count 89
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 47 place count 81 transition count 89
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 70 place count 58 transition count 65
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 93 place count 58 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 57 transition count 64
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 57 transition count 64
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 106 place count 57 transition count 65
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 117 place count 46 transition count 54
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 128 place count 46 transition count 54
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 46 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 135 place count 46 transition count 76
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 142 place count 39 transition count 59
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 149 place count 39 transition count 59
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 149 rules in 22 ms. Remains 39 /142 variables (removed 103) and now considering 59/148 (removed 89) transitions.
[2024-05-27 09:45:45] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
// Phase 1: matrix 59 rows 39 cols
[2024-05-27 09:45:45] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 09:45:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 2 (OVERLAPS) 58/96 variables, 38/40 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/40 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 1/97 variables, 1/41 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/41 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 1/98 variables, 1/42 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/42 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/42 constraints. Problems are: Problem set: 33 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 42 constraints, problems are : Problem set: 33 solved, 24 unsolved in 688 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 33 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 3/20 variables, 1/2 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 53/73 variables, 20/22 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 24/46 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/46 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 24/97 variables, 19/65 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/65 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 1/98 variables, 1/66 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/66 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 0/98 variables, 0/66 constraints. Problems are: Problem set: 33 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 66 constraints, problems are : Problem set: 33 solved, 24 unsolved in 572 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 1291ms problems are : Problem set: 33 solved, 24 unsolved
Search for dead transitions found 33 dead transitions in 1293ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 39/142 places, 26/148 transitions.
Graph (complete) has 32 edges and 39 vertex of which 18 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 17 /39 variables (removed 22) and now considering 27/26 (removed -1) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/142 places, 27/148 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1323 ms. Remains : 17/142 places, 27/148 transitions.
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 148/148 transitions.
Applied a total of 0 rules in 18 ms. Remains 142 /142 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 142 cols
[2024-05-27 09:45:46] [INFO ] Computed 5 invariants in 1 ms
[2024-05-27 09:45:47] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-27 09:45:47] [INFO ] Invariant cache hit.
[2024-05-27 09:45:47] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-05-27 09:45:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/289 variables, 141/146 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/290 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 147 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4567 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/289 variables, 141/146 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 147/293 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 1/290 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 294 constraints, problems are : Problem set: 0 solved, 147 unsolved in 9822 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 14408ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 14411ms
Finished structural reductions in LTL mode , in 1 iterations and 14746 ms. Remains : 142/142 places, 148/148 transitions.
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-02 finished in 38174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&F(!p0)) U (p0&&F(!p0)&&X(X(!p1))))))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 159
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 13 place count 148 transition count 154
Iterating global reduction 1 with 5 rules applied. Total rules applied 18 place count 148 transition count 154
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 146 transition count 152
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 146 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 145 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 145 transition count 151
Applied a total of 24 rules in 14 ms. Remains 145 /161 variables (removed 16) and now considering 151/159 (removed 8) transitions.
// Phase 1: matrix 151 rows 145 cols
[2024-05-27 09:46:01] [INFO ] Computed 6 invariants in 2 ms
[2024-05-27 09:46:02] [INFO ] Implicit Places using invariants in 486 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 488 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/161 places, 151/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 150
Applied a total of 2 rules in 6 ms. Remains 143 /144 variables (removed 1) and now considering 150/151 (removed 1) transitions.
// Phase 1: matrix 150 rows 143 cols
[2024-05-27 09:46:02] [INFO ] Computed 5 invariants in 1 ms
[2024-05-27 09:46:02] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-27 09:46:02] [INFO ] Invariant cache hit.
[2024-05-27 09:46:02] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 143/161 places, 150/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 704 ms. Remains : 143/161 places, 150/159 transitions.
Stuttering acceptance computed with spot in 277 ms :[p1, p0, (OR p0 p1), (OR p1 p0), true, true, true]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-04 finished in 1008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 152 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 146 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 146 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 146 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 144 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 144 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 143 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 143 transition count 149
Applied a total of 28 rules in 12 ms. Remains 143 /161 variables (removed 18) and now considering 149/159 (removed 10) transitions.
// Phase 1: matrix 149 rows 143 cols
[2024-05-27 09:46:02] [INFO ] Computed 5 invariants in 2 ms
[2024-05-27 09:46:02] [INFO ] Implicit Places using invariants in 103 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/161 places, 149/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 148
Applied a total of 2 rules in 5 ms. Remains 141 /142 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 141 cols
[2024-05-27 09:46:02] [INFO ] Computed 4 invariants in 1 ms
[2024-05-27 09:46:02] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-27 09:46:02] [INFO ] Invariant cache hit.
[2024-05-27 09:46:03] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/161 places, 148/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 375 ms. Remains : 141/161 places, 148/159 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-05
Entered a terminal (fully accepting) state of product in 24797 steps with 114 reset in 27 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-05 finished in 607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(F(p1) U G(p2))))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Graph (trivial) has 121 edges and 161 vertex of which 19 / 161 are part of one of the 1 SCC in 3 ms
Free SCC test removed 18 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 179 edges and 143 vertex of which 106 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Ensure Unique test removed 6 places
Reduce places removed 7 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 99 transition count 53
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 113 place count 45 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 115 place count 43 transition count 50
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 115 place count 43 transition count 37
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 141 place count 30 transition count 37
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 142 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 28 transition count 36
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 28 transition count 36
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 4 with 10 rules applied. Total rules applied 154 place count 23 transition count 31
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 157 place count 23 transition count 28
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 163 place count 20 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 165 place count 20 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 171 place count 20 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 173 place count 19 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 174 place count 18 transition count 23
Ensure Unique test removed 2 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 176 place count 16 transition count 23
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 177 place count 15 transition count 19
Iterating global reduction 7 with 1 rules applied. Total rules applied 178 place count 15 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 179 place count 14 transition count 18
Applied a total of 179 rules in 41 ms. Remains 14 /161 variables (removed 147) and now considering 18/159 (removed 141) transitions.
// Phase 1: matrix 18 rows 14 cols
[2024-05-27 09:46:03] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 09:46:03] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-27 09:46:03] [INFO ] Invariant cache hit.
[2024-05-27 09:46:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 09:46:03] [INFO ] Implicit Places using invariants and state equation in 36 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/161 places, 18/159 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 13/161 places, 18/159 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-06
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-06 finished in 335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Graph (trivial) has 120 edges and 161 vertex of which 19 / 161 are part of one of the 1 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 179 edges and 143 vertex of which 90 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.0 ms
Discarding 53 places :
Also discarding 45 output transitions
Drop transitions (Output transitions of discarded places.) removed 45 transitions
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 85 transition count 47
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 37 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 36 transition count 45
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 101 place count 36 transition count 35
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 121 place count 26 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 25 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 25 transition count 34
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 138 place count 17 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 142 place count 17 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 16 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 148 place count 14 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 150 place count 14 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 14 transition count 20
Applied a total of 151 rules in 15 ms. Remains 14 /161 variables (removed 147) and now considering 20/159 (removed 139) transitions.
// Phase 1: matrix 20 rows 14 cols
[2024-05-27 09:46:03] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 09:46:03] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-27 09:46:03] [INFO ] Invariant cache hit.
[2024-05-27 09:46:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 09:46:03] [INFO ] Implicit Places using invariants and state equation in 34 ms returned [5]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/161 places, 19/159 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 18
Applied a total of 1 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 13 cols
[2024-05-27 09:46:03] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 09:46:03] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-27 09:46:03] [INFO ] Invariant cache hit.
[2024-05-27 09:46:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 09:46:03] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/161 places, 18/159 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 13/161 places, 18/159 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-07
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 2 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-07 finished in 223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Graph (trivial) has 124 edges and 161 vertex of which 19 / 161 are part of one of the 1 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 179 edges and 143 vertex of which 90 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 45 output transitions
Drop transitions (Output transitions of discarded places.) removed 45 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 86 transition count 45
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 37 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 100 place count 37 transition count 34
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 122 place count 26 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 25 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 25 transition count 33
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 136 place count 19 transition count 27
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 139 place count 19 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 145 place count 16 transition count 34
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 148 place count 16 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 158 place count 16 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 15 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 14 transition count 19
Ensure Unique test removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 163 place count 12 transition count 19
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 164 place count 11 transition count 14
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 10 transition count 13
Applied a total of 166 rules in 10 ms. Remains 10 /161 variables (removed 151) and now considering 13/159 (removed 146) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-27 09:46:03] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 09:46:03] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-27 09:46:03] [INFO ] Invariant cache hit.
[2024-05-27 09:46:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 09:46:03] [INFO ] Implicit Places using invariants and state equation in 30 ms returned [2]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/161 places, 12/159 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64 ms. Remains : 9/161 places, 12/159 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-08
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-08 finished in 114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&X((p2 U (p3||G(p2)))))))'
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 152 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 146 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 146 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 146 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 144 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 144 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 143 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 143 transition count 149
Applied a total of 28 rules in 8 ms. Remains 143 /161 variables (removed 18) and now considering 149/159 (removed 10) transitions.
// Phase 1: matrix 149 rows 143 cols
[2024-05-27 09:46:03] [INFO ] Computed 5 invariants in 1 ms
[2024-05-27 09:46:03] [INFO ] Implicit Places using invariants in 54 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/161 places, 149/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 148
Applied a total of 2 rules in 3 ms. Remains 141 /142 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 141 cols
[2024-05-27 09:46:04] [INFO ] Computed 4 invariants in 4 ms
[2024-05-27 09:46:04] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-27 09:46:04] [INFO ] Invariant cache hit.
[2024-05-27 09:46:04] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/161 places, 148/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 238 ms. Remains : 141/161 places, 148/159 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-09
Stuttering criterion allowed to conclude after 1626 steps with 9 reset in 6 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-09 finished in 400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Graph (trivial) has 122 edges and 161 vertex of which 19 / 161 are part of one of the 1 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 179 edges and 143 vertex of which 92 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 43 output transitions
Drop transitions (Output transitions of discarded places.) removed 43 transitions
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 86 transition count 46
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 36 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 103 place count 36 transition count 34
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 125 place count 25 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 24 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 24 transition count 33
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 139 place count 18 transition count 27
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 142 place count 18 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 148 place count 15 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 159 place count 15 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 14 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 13 transition count 21
Ensure Unique test removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 164 place count 11 transition count 21
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 10 transition count 16
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 10 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 9 transition count 15
Applied a total of 167 rules in 12 ms. Remains 9 /161 variables (removed 152) and now considering 15/159 (removed 144) transitions.
// Phase 1: matrix 15 rows 9 cols
[2024-05-27 09:46:04] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 09:46:04] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-27 09:46:04] [INFO ] Invariant cache hit.
[2024-05-27 09:46:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 09:46:04] [INFO ] Implicit Places using invariants and state equation in 32 ms returned [2]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/161 places, 14/159 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 13
Applied a total of 1 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 8 cols
[2024-05-27 09:46:04] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 09:46:04] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-27 09:46:04] [INFO ] Invariant cache hit.
[2024-05-27 09:46:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 09:46:04] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/161 places, 13/159 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 8/161 places, 13/159 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-10
Stuttering criterion allowed to conclude after 38 steps with 2 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-10 finished in 199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(p1)))))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 152 transition count 159
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 14 place count 147 transition count 154
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 147 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 147 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 145 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 145 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 144 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 144 transition count 150
Applied a total of 26 rules in 7 ms. Remains 144 /161 variables (removed 17) and now considering 150/159 (removed 9) transitions.
// Phase 1: matrix 150 rows 144 cols
[2024-05-27 09:46:04] [INFO ] Computed 5 invariants in 1 ms
[2024-05-27 09:46:04] [INFO ] Implicit Places using invariants in 54 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/161 places, 150/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 142 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 149
Applied a total of 2 rules in 3 ms. Remains 142 /143 variables (removed 1) and now considering 149/150 (removed 1) transitions.
// Phase 1: matrix 149 rows 142 cols
[2024-05-27 09:46:04] [INFO ] Computed 4 invariants in 2 ms
[2024-05-27 09:46:04] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-27 09:46:04] [INFO ] Invariant cache hit.
[2024-05-27 09:46:04] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 142/161 places, 149/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 248 ms. Remains : 142/161 places, 149/159 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-11 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||G(p1)||(!p0&&F(p2)))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 159
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 149 transition count 155
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 149 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 149 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 148 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 148 transition count 153
Applied a total of 19 rules in 5 ms. Remains 148 /161 variables (removed 13) and now considering 153/159 (removed 6) transitions.
// Phase 1: matrix 153 rows 148 cols
[2024-05-27 09:46:04] [INFO ] Computed 6 invariants in 1 ms
[2024-05-27 09:46:04] [INFO ] Implicit Places using invariants in 59 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 147/161 places, 153/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 146 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 146 transition count 152
Applied a total of 2 rules in 3 ms. Remains 146 /147 variables (removed 1) and now considering 152/153 (removed 1) transitions.
// Phase 1: matrix 152 rows 146 cols
[2024-05-27 09:46:04] [INFO ] Computed 5 invariants in 1 ms
[2024-05-27 09:46:05] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-27 09:46:05] [INFO ] Invariant cache hit.
[2024-05-27 09:46:05] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 146/161 places, 152/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 260 ms. Remains : 146/161 places, 152/159 transitions.
Stuttering acceptance computed with spot in 343 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-13
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-13 finished in 624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(p1&&X((X(p3)&&p2)))))))'
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 14 place count 147 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 147 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 147 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 145 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 145 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 144 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 144 transition count 149
Applied a total of 27 rules in 8 ms. Remains 144 /161 variables (removed 17) and now considering 149/159 (removed 10) transitions.
// Phase 1: matrix 149 rows 144 cols
[2024-05-27 09:46:05] [INFO ] Computed 6 invariants in 2 ms
[2024-05-27 09:46:05] [INFO ] Implicit Places using invariants in 54 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/161 places, 149/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 142 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 148
Applied a total of 2 rules in 3 ms. Remains 142 /143 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 142 cols
[2024-05-27 09:46:05] [INFO ] Computed 5 invariants in 1 ms
[2024-05-27 09:46:05] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-27 09:46:05] [INFO ] Invariant cache hit.
[2024-05-27 09:46:05] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 142/161 places, 148/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 258 ms. Remains : 142/161 places, 148/159 transitions.
Stuttering acceptance computed with spot in 501 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))), (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND p0 (NOT p3)), (AND p0 (NOT p3)), true, (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-15 finished in 780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(p1)||F(p2))))'
Found a Lengthening insensitive property : IBMB2S565S3960-PT-none-LTLFireability-00
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Graph (trivial) has 123 edges and 161 vertex of which 19 / 161 are part of one of the 1 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 179 edges and 143 vertex of which 107 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.0 ms
Discarding 36 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 101 transition count 55
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 47 transition count 54
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 111 place count 47 transition count 40
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 139 place count 33 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 140 place count 32 transition count 39
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 32 transition count 39
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 153 place count 26 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 156 place count 26 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 162 place count 23 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 164 place count 23 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 22 transition count 37
Ensure Unique test removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 167 place count 20 transition count 37
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 168 place count 19 transition count 31
Iterating global reduction 5 with 1 rules applied. Total rules applied 169 place count 19 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 18 transition count 30
Applied a total of 170 rules in 8 ms. Remains 18 /161 variables (removed 143) and now considering 30/159 (removed 129) transitions.
// Phase 1: matrix 30 rows 18 cols
[2024-05-27 09:46:06] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 09:46:06] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-27 09:46:06] [INFO ] Invariant cache hit.
[2024-05-27 09:46:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 09:46:06] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [10]
Discarding 1 places :
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 70 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 17/161 places, 26/159 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 80 ms. Remains : 17/161 places, 26/159 transitions.
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-00
Product exploration explored 100000 steps with 6520 reset in 153 ms.
Product exploration explored 100000 steps with 6517 reset in 213 ms.
Computed a total of 4 stabilizing places and 11 stable transitions
Graph (complete) has 28 edges and 17 vertex of which 10 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 153 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
RANDOM walk for 40002 steps (2359 resets) in 141 ms. (281 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40002 steps (401 resets) in 66 ms. (597 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (399 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
// Phase 1: matrix 26 rows 17 cols
[2024-05-27 09:46:07] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 09:46:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 13/26 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/28 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/37 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/42 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/42 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/43 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 13/26 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/28 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/37 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/37 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/42 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/43 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/43 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/43 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 21 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 206ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p0))), (F p0), (F (NOT (OR p2 p1))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 565 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-05-27 09:46:08] [INFO ] Invariant cache hit.
[2024-05-27 09:46:08] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-27 09:46:08] [INFO ] Invariant cache hit.
[2024-05-27 09:46:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 09:46:08] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-27 09:46:08] [INFO ] Invariant cache hit.
[2024-05-27 09:46:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 22/37 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 5/42 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/43 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 17 unsolved in 296 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 22/37 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 5/42 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/43 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 37 constraints, problems are : Problem set: 0 solved, 17 unsolved in 263 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 565ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 566ms
Finished structural reductions in LTL mode , in 1 iterations and 638 ms. Remains : 17/17 places, 26/26 transitions.
Computed a total of 4 stabilizing places and 11 stable transitions
Graph (complete) has 28 edges and 17 vertex of which 10 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 150 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
RANDOM walk for 40004 steps (2352 resets) in 59 ms. (666 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (385 resets) in 41 ms. (952 steps per ms) remains 1/4 properties
BEST_FIRST walk for 36928 steps (369 resets) in 24 ms. (1477 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p0))), (F p0), (F (NOT (OR p2 p1))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 539 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Product exploration explored 100000 steps with 6518 reset in 101 ms.
Product exploration explored 100000 steps with 6548 reset in 156 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 26/26 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 17 transition count 21
Applied a total of 5 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 21/26 (removed 5) transitions.
[2024-05-27 09:46:11] [INFO ] Redundant transitions in 14 ms returned []
Running 17 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 17 cols
[2024-05-27 09:46:11] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 09:46:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 19/34 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/36 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/37 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/38 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 20 constraints, problems are : Problem set: 0 solved, 17 unsolved in 386 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 19/34 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2/36 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/38 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/38 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 37 constraints, problems are : Problem set: 0 solved, 17 unsolved in 443 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 837ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 837ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/17 places, 21/26 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 861 ms. Remains : 17/17 places, 21/26 transitions.
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 17 cols
[2024-05-27 09:46:12] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 09:46:12] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-27 09:46:12] [INFO ] Invariant cache hit.
[2024-05-27 09:46:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 09:46:12] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-27 09:46:12] [INFO ] Invariant cache hit.
[2024-05-27 09:46:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 22/37 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 5/42 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/43 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 17 unsolved in 295 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 22/37 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 5/42 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/43 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 37 constraints, problems are : Problem set: 0 solved, 17 unsolved in 290 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 594ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 594ms
Finished structural reductions in LTL mode , in 1 iterations and 668 ms. Remains : 17/17 places, 26/26 transitions.
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-00 finished in 6761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F((G(p0)&&X(!p1)))&&G(!p2))||G((F(G(p0))&&F(!p1))))))'
Found a Shortening insensitive property : IBMB2S565S3960-PT-none-LTLFireability-02
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Graph (trivial) has 119 edges and 161 vertex of which 19 / 161 are part of one of the 1 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 179 edges and 143 vertex of which 90 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 45 output transitions
Drop transitions (Output transitions of discarded places.) removed 45 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 85 transition count 51
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 42 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 40 transition count 48
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 93 place count 40 transition count 37
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 115 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 28 transition count 36
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 28 transition count 36
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 3 with 10 rules applied. Total rules applied 127 place count 23 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 23 transition count 29
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 135 place count 20 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 136 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 19 transition count 32
Ensure Unique test removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 139 place count 17 transition count 32
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 140 place count 16 transition count 28
Iterating global reduction 6 with 1 rules applied. Total rules applied 141 place count 16 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 142 place count 15 transition count 27
Applied a total of 142 rules in 19 ms. Remains 15 /161 variables (removed 146) and now considering 27/159 (removed 132) transitions.
// Phase 1: matrix 27 rows 15 cols
[2024-05-27 09:46:13] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 09:46:13] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-27 09:46:13] [INFO ] Invariant cache hit.
[2024-05-27 09:46:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 09:46:13] [INFO ] Implicit Places using invariants and state equation in 35 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 78 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 14/161 places, 27/159 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 99 ms. Remains : 14/161 places, 27/159 transitions.
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-02
Stuttering criterion allowed to conclude after 44 steps with 1 reset in 0 ms.
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-02 finished in 553 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-27 09:46:13] [INFO ] Flatten gal took : 19 ms
[2024-05-27 09:46:13] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-27 09:46:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 161 places, 159 transitions and 357 arcs took 7 ms.
Total runtime 94710 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running IBMB2S565S3960-PT-none

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 161
TRANSITIONS: 159
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1937
MODEL NAME: /home/mcc/execution/418/model
161 places, 159 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA IBMB2S565S3960-PT-none-LTLFireability-00 CANNOT_COMPUTE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-02 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716804306092

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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="IBMB2S565S3960-PT-none"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is IBMB2S565S3960-PT-none, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r201-smll-171649587100356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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