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.r500-smll-171649588000355.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 ltsminxred
Input is IBMB2S565S3960-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649588000355
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-01
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-02
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-03
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-04
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-05
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-06
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-07
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-08
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-09
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-10
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-11
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-12
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-13
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-14
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717286459920

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBMB2S565S3960-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 00:01:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 00:01:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 00:01:02] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-06-02 00:01:02] [INFO ] Transformed 273 places.
[2024-06-02 00:01:02] [INFO ] Transformed 179 transitions.
[2024-06-02 00:01:02] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 388 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 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 88 places
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 176 transition count 178
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 115 place count 159 transition count 161
Iterating global reduction 1 with 17 rules applied. Total rules applied 132 place count 159 transition count 161
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 157 transition count 159
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 157 transition count 159
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 155 transition count 157
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 155 transition count 157
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 153 transition count 155
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 153 transition count 155
Applied a total of 144 rules in 134 ms. Remains 153 /273 variables (removed 120) and now considering 155/179 (removed 24) transitions.
// Phase 1: matrix 155 rows 153 cols
[2024-06-02 00:01:03] [INFO ] Computed 9 invariants in 27 ms
[2024-06-02 00:01:03] [INFO ] Implicit Places using invariants in 383 ms returned [126, 139]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 445 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 151/273 places, 155/179 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 150 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 150 transition count 154
Applied a total of 2 rules in 15 ms. Remains 150 /151 variables (removed 1) and now considering 154/155 (removed 1) transitions.
// Phase 1: matrix 154 rows 150 cols
[2024-06-02 00:01:03] [INFO ] Computed 7 invariants in 16 ms
[2024-06-02 00:01:03] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-02 00:01:03] [INFO ] Invariant cache hit.
[2024-06-02 00:01:04] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/273 places, 154/179 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1078 ms. Remains : 150/273 places, 154/179 transitions.
Support contains 30 out of 150 places after structural reductions.
[2024-06-02 00:01:04] [INFO ] Flatten gal took : 82 ms
[2024-06-02 00:01:04] [INFO ] Flatten gal took : 30 ms
[2024-06-02 00:01:04] [INFO ] Input system was already deterministic with 154 transitions.
Support contains 28 out of 150 places (down from 30) after GAL structural reductions.
RANDOM walk for 40007 steps (158 resets) in 1546 ms. (25 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40002 steps (27 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (23 resets) in 139 ms. (285 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (23 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
[2024-06-02 00:01:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/17 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/21 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/33 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 9 (OVERLAPS) 20/53 variables, 8/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/77 variables, 11/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/77 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 25/102 variables, 13/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 1/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/120 variables, 3/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/120 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 30/150 variables, 26/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/150 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 20/170 variables, 9/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/170 variables, 1/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/170 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 26/196 variables, 10/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/196 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 34/230 variables, 15/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/230 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 36/266 variables, 19/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/266 variables, 1/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/266 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 27/293 variables, 15/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/293 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 10/303 variables, 7/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/303 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 1/304 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/304 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/304 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 157 constraints, problems are : Problem set: 1 solved, 1 unsolved in 498 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/13 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/22 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/34 variables, 6/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/34 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/51 variables, 8/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/51 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 18/69 variables, 3/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/69 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 27/96 variables, 24/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/96 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 17/113 variables, 7/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/113 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/135 variables, 8/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/135 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 32/167 variables, 13/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/167 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 48/215 variables, 24/103 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/215 variables, 1/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/215 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/219 variables, 1/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/219 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 45/264 variables, 25/130 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/264 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 25/289 variables, 16/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/289 variables, 1/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/289 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 8/297 variables, 5/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/297 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 6/303 variables, 4/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/303 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/303 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 1/304 variables, 1/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/304 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 0/304 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 158 constraints, problems are : Problem set: 1 solved, 1 unsolved in 353 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 899ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 312 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=78 )
Parikh walk visited 1 properties in 11 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 66 stabilizing places and 69 stable transitions
Graph (complete) has 177 edges and 150 vertex of which 103 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.9 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&&(F(G(p1)) U p2))))||F(p3)))'
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 147 transition count 154
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 144 transition count 151
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 144 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 144 transition count 150
Applied a total of 10 rules in 13 ms. Remains 144 /150 variables (removed 6) and now considering 150/154 (removed 4) transitions.
// Phase 1: matrix 150 rows 144 cols
[2024-06-02 00:01:06] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 00:01:06] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 00:01:06] [INFO ] Invariant cache hit.
[2024-06-02 00:01:07] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-06-02 00:01:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 150/292 variables, 142/146 constraints. Problems are: Problem set: 0 solved, 149 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 2/294 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 148 constraints, problems are : Problem set: 0 solved, 149 unsolved in 7233 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 144/144 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/142 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 150/292 variables, 142/146 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 148/294 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 2/294 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/294 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 297 constraints, problems are : Problem set: 0 solved, 149 unsolved in 10091 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 17393ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 17405ms
Starting structural reductions in LTL mode, iteration 1 : 144/150 places, 150/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17728 ms. Remains : 144/150 places, 150/154 transitions.
Stuttering acceptance computed with spot in 466 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-02
Stuttering criterion allowed to conclude after 5917 steps with 76 reset in 92 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-02 finished in 18392 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||G(p1)))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Graph (trivial) has 124 edges and 150 vertex of which 18 / 150 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 158 edges and 133 vertex of which 86 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.2 ms
Discarding 47 places :
Also discarding 42 output transitions
Drop transitions (Output transitions of discarded places.) removed 42 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 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 82 transition count 49
Reduce places removed 43 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 39 transition count 46
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 36 transition count 46
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 94 place count 36 transition count 37
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 112 place count 27 transition count 37
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 128 place count 19 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 130 place count 19 transition count 26
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
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 136 place count 16 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 16 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 15 transition count 23
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 139 place count 14 transition count 23
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 13 transition count 21
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 13 transition count 21
Applied a total of 141 rules in 51 ms. Remains 13 /150 variables (removed 137) and now considering 21/154 (removed 133) transitions.
// Phase 1: matrix 21 rows 13 cols
[2024-06-02 00:01:25] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 00:01:25] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-02 00:01:25] [INFO ] Invariant cache hit.
[2024-06-02 00:01:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 00:01:25] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [6]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 109 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/150 places, 20/154 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 12 transition count 19
Applied a total of 1 rules in 5 ms. Remains 12 /12 variables (removed 0) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 12 cols
[2024-06-02 00:01:25] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 00:01:25] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-02 00:01:25] [INFO ] Invariant cache hit.
[2024-06-02 00:01:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 00:01:25] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/150 places, 19/154 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 230 ms. Remains : 12/150 places, 19/154 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-04
Stuttering criterion allowed to conclude after 104 steps with 20 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-04 finished in 358 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 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Graph (trivial) has 126 edges and 150 vertex of which 18 / 150 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 158 edges and 133 vertex of which 86 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.1 ms
Discarding 47 places :
Also discarding 42 output transitions
Drop transitions (Output transitions of discarded places.) removed 42 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 82 transition count 47
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 37 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 36 transition count 46
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 94 place count 36 transition count 36
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 114 place count 26 transition count 36
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 130 place count 18 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 131 place count 18 transition count 27
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
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 137 place count 15 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 144 place count 15 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 14 transition count 21
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 146 place count 13 transition count 21
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 147 place count 12 transition count 19
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 12 transition count 19
Applied a total of 148 rules in 13 ms. Remains 12 /150 variables (removed 138) and now considering 19/154 (removed 135) transitions.
// Phase 1: matrix 19 rows 12 cols
[2024-06-02 00:01:25] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 00:01:25] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-02 00:01:25] [INFO ] Invariant cache hit.
[2024-06-02 00:01:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 00:01:25] [INFO ] Implicit Places using invariants and state equation in 39 ms returned [6]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 : 11/150 places, 18/154 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79 ms. Remains : 11/150 places, 18/154 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-05
Stuttering criterion allowed to conclude after 49 steps with 1 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-05 finished in 147 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||G(p1)||X((p0 U p2)))))'
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 146 transition count 154
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 142 transition count 150
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 142 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 141 transition count 148
Applied a total of 15 rules in 11 ms. Remains 141 /150 variables (removed 9) and now considering 148/154 (removed 6) transitions.
// Phase 1: matrix 148 rows 141 cols
[2024-06-02 00:01:25] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 00:01:25] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 00:01:25] [INFO ] Invariant cache hit.
[2024-06-02 00:01:25] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-06-02 00:01:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/288 variables, 140/144 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/289 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 145 constraints, problems are : Problem set: 0 solved, 147 unsolved in 7124 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 141/141 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/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/288 variables, 140/144 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 147/291 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 1/289 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 292 constraints, problems are : Problem set: 0 solved, 147 unsolved in 11702 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 18877ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 18881ms
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 148/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19218 ms. Remains : 141/150 places, 148/154 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 380 ms.
Product exploration explored 100000 steps with 50000 reset in 456 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 164 edges and 141 vertex of which 97 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.7 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Detected a total of 61/141 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 p0 p2 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 31 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-06 finished in 20366 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(X(G(p0)))))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 146 transition count 154
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 142 transition count 150
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 142 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 141 transition count 148
Applied a total of 15 rules in 19 ms. Remains 141 /150 variables (removed 9) and now considering 148/154 (removed 6) transitions.
[2024-06-02 00:01:46] [INFO ] Invariant cache hit.
[2024-06-02 00:01:46] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 00:01:46] [INFO ] Invariant cache hit.
[2024-06-02 00:01:46] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-06-02 00:01:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/288 variables, 140/144 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/289 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 145 constraints, problems are : Problem set: 0 solved, 147 unsolved in 6802 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 141/141 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/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/288 variables, 140/144 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 147/291 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 1/289 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 292 constraints, problems are : Problem set: 0 solved, 147 unsolved in 11571 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 18402ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 18406ms
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 148/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18672 ms. Remains : 141/150 places, 148/154 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-08 finished in 18917 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 ((p1&&X(p0))||X(G(p0)))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 146 transition count 154
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 142 transition count 150
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 142 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 141 transition count 148
Applied a total of 15 rules in 9 ms. Remains 141 /150 variables (removed 9) and now considering 148/154 (removed 6) transitions.
[2024-06-02 00:02:04] [INFO ] Invariant cache hit.
[2024-06-02 00:02:04] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 00:02:04] [INFO ] Invariant cache hit.
[2024-06-02 00:02:05] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-06-02 00:02:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/288 variables, 140/144 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/289 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 145 constraints, problems are : Problem set: 0 solved, 147 unsolved in 6831 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 141/141 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/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/288 variables, 140/144 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 147/291 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 1/289 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 292 constraints, problems are : Problem set: 0 solved, 147 unsolved in 11509 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 18372ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 18376ms
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 148/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18612 ms. Remains : 141/150 places, 148/154 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-10 finished in 18743 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 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Graph (trivial) has 128 edges and 150 vertex of which 12 / 150 are part of one of the 1 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 165 edges and 139 vertex of which 92 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.1 ms
Discarding 47 places :
Also discarding 42 output transitions
Drop transitions (Output transitions of discarded places.) removed 42 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 88 transition count 50
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 39 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 38 transition count 49
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 102 place count 38 transition count 38
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 124 place count 27 transition count 38
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 142 place count 18 transition count 29
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 145 place count 18 transition count 26
Performed 4 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 153 place count 14 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 155 place count 14 transition count 23
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 156 place count 14 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 13 transition count 21
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 158 place count 12 transition count 21
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 159 place count 11 transition count 19
Iterating global reduction 6 with 1 rules applied. Total rules applied 160 place count 11 transition count 19
Applied a total of 160 rules in 12 ms. Remains 11 /150 variables (removed 139) and now considering 19/154 (removed 135) transitions.
// Phase 1: matrix 19 rows 11 cols
[2024-06-02 00:02:23] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 00:02:23] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 00:02:23] [INFO ] Invariant cache hit.
[2024-06-02 00:02:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 00:02:23] [INFO ] Implicit Places using invariants and state equation in 32 ms returned [4]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/150 places, 18/154 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 10 transition count 17
Applied a total of 1 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 10 cols
[2024-06-02 00:02:23] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 00:02:23] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-02 00:02:23] [INFO ] Invariant cache hit.
[2024-06-02 00:02:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 00:02:23] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/150 places, 17/154 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 10/150 places, 17/154 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-11
Stuttering criterion allowed to conclude after 332 steps with 12 reset in 3 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-11 finished in 193 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))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Graph (complete) has 177 edges and 150 vertex of which 103 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.2 ms
Discarding 47 places :
Also discarding 42 output transitions
Drop transitions (Output transitions of discarded places.) removed 42 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 99 transition count 53
Reduce places removed 58 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 41 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 39 transition count 51
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 121 place count 39 transition count 39
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 145 place count 27 transition count 39
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 163 place count 18 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 167 place count 18 transition count 26
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 169 place count 17 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 170 place count 17 transition count 24
Performed 4 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 178 place count 13 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 180 place count 13 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 181 place count 13 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 182 place count 12 transition count 19
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 183 place count 11 transition count 19
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 184 place count 10 transition count 17
Iterating global reduction 7 with 1 rules applied. Total rules applied 185 place count 10 transition count 17
Applied a total of 185 rules in 17 ms. Remains 10 /150 variables (removed 140) and now considering 17/154 (removed 137) transitions.
// Phase 1: matrix 17 rows 10 cols
[2024-06-02 00:02:23] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 00:02:23] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-02 00:02:23] [INFO ] Invariant cache hit.
[2024-06-02 00:02:23] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [4]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 80 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/150 places, 16/154 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 9 transition count 15
Applied a total of 1 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 9 cols
[2024-06-02 00:02:23] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 00:02:23] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-02 00:02:23] [INFO ] Invariant cache hit.
[2024-06-02 00:02:24] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/150 places, 15/154 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 9/150 places, 15/154 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-12
Stuttering criterion allowed to conclude after 63 steps with 5 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-12 finished in 295 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(F(p0)))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 146 transition count 154
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 143 transition count 151
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 143 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 142 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 142 transition count 150
Applied a total of 12 rules in 9 ms. Remains 142 /150 variables (removed 8) and now considering 150/154 (removed 4) transitions.
// Phase 1: matrix 150 rows 142 cols
[2024-06-02 00:02:24] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 00:02:24] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 00:02:24] [INFO ] Invariant cache hit.
[2024-06-02 00:02:24] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-06-02 00:02:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 150/291 variables, 141/145 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 1/292 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 146 constraints, problems are : Problem set: 0 solved, 149 unsolved in 7803 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 142/142 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/141 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 150/291 variables, 141/145 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 149/294 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 1/292 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 295 constraints, problems are : Problem set: 0 solved, 149 unsolved in 11480 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 19312ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 19315ms
Starting structural reductions in LTL mode, iteration 1 : 142/150 places, 150/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19598 ms. Remains : 142/150 places, 150/154 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-13
Stuttering criterion allowed to conclude after 142 steps with 0 reset in 4 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-13 finished in 19707 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(F(p0)))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 154/154 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 146 transition count 154
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 142 transition count 150
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 142 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 141 transition count 148
Applied a total of 15 rules in 7 ms. Remains 141 /150 variables (removed 9) and now considering 148/154 (removed 6) transitions.
// Phase 1: matrix 148 rows 141 cols
[2024-06-02 00:02:43] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 00:02:43] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 00:02:43] [INFO ] Invariant cache hit.
[2024-06-02 00:02:44] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-06-02 00:02:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/288 variables, 140/144 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/289 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 145 constraints, problems are : Problem set: 0 solved, 147 unsolved in 6466 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 141/141 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/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/288 variables, 140/144 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 147/291 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 1/289 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 292 constraints, problems are : Problem set: 0 solved, 147 unsolved in 11380 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 17868ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 17871ms
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 148/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18118 ms. Remains : 141/150 places, 148/154 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Product exploration explored 100000 steps with 50000 reset in 280 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 164 edges and 141 vertex of which 97 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Detected a total of 61/141 stabilizing places and 65/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 26 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-14 finished in 18745 ms.
All properties solved by simple procedures.
Total runtime 120296 ms.
ITS solved all properties within timeout

BK_STOP 1717286582659

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

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="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is IBMB2S565S3960-PT-none, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r500-smll-171649588000355"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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