Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422500356.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
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 r114-tall-174876422500356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 127K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml 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 1748836179471

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBMB2S565S3960-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 03:49:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 03:49:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:49:41] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2025-06-02 03:49:41] [INFO ] Transformed 273 places.
[2025-06-02 03:49:41] [INFO ] Transformed 179 transitions.
[2025-06-02 03:49:41] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-08 TRUE 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 36 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 83 places
Reduce places removed 93 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 180 transition count 178
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 111 place count 163 transition count 161
Iterating global reduction 1 with 17 rules applied. Total rules applied 128 place count 163 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 129 place count 163 transition count 160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 161 transition count 158
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 161 transition count 158
Applied a total of 133 rules in 57 ms. Remains 161 /273 variables (removed 112) and now considering 158/179 (removed 21) transitions.
// Phase 1: matrix 158 rows 161 cols
[2025-06-02 03:49:41] [INFO ] Computed 14 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:41] [INFO ] Implicit Places using invariants in 239 ms returned [129, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 275 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/273 places, 158/179 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 158 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 157
Applied a total of 2 rules in 8 ms. Remains 158 /159 variables (removed 1) and now considering 157/158 (removed 1) transitions.
// Phase 1: matrix 157 rows 158 cols
[2025-06-02 03:49:41] [INFO ] Computed 12 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:41] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-02 03:49:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:41] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 158/273 places, 157/179 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 594 ms. Remains : 158/273 places, 157/179 transitions.
Support contains 36 out of 158 places after structural reductions.
[2025-06-02 03:49:41] [INFO ] Flatten gal took : 29 ms
[2025-06-02 03:49:42] [INFO ] Flatten gal took : 14 ms
[2025-06-02 03:49:42] [INFO ] Input system was already deterministic with 157 transitions.
RANDOM walk for 40005 steps (161 resets) in 1082 ms. (36 steps per ms) remains 4/28 properties
BEST_FIRST walk for 40004 steps (25 resets) in 238 ms. (167 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (23 resets) in 145 ms. (274 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (24 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
[2025-06-02 03:49:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 15/21 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 5/26 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/52 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 25/77 variables, 11/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 31/108 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 30/138 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/138 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 52/190 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/190 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/190 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/194 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/194 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 46/240 variables, 25/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/240 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 36/276 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/276 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 25/301 variables, 13/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 12/313 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/313 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 2/315 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/315 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/315 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 170 constraints, problems are : Problem set: 0 solved, 2 unsolved in 395 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 15/21 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 5/26 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/52 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 25/77 variables, 11/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 31/108 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 30/138 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/138 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/138 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 52/190 variables, 24/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/190 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/190 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/194 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/194 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 46/240 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/240 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 36/276 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/276 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/276 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 25/301 variables, 13/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/301 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 12/313 variables, 8/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/313 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 2/315 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/315 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/315 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 172 constraints, problems are : Problem set: 0 solved, 2 unsolved in 508 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 924ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 308 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=102 )
Parikh walk visited 2 properties in 6 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 69 stabilizing places and 69 stable transitions
Graph (complete) has 193 edges and 158 vertex of which 105 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 157/157 transitions.
Graph (complete) has 193 edges and 158 vertex of which 109 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.1 ms
Discarding 49 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 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 103 transition count 56
Reduce places removed 57 places and 0 transitions.
Graph (trivial) has 37 edges and 46 vertex of which 5 / 46 are part of one of the 1 SCC in 1 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 59 rules applied. Total rules applied 117 place count 42 transition count 55
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 124 place count 41 transition count 49
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 124 place count 41 transition count 36
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 150 place count 28 transition count 36
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 152 place count 26 transition count 34
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 26 transition count 34
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 170 place count 18 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 172 place count 18 transition count 23
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 176 place count 16 transition count 24
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 177 place count 16 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 15 transition count 22
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 179 place count 14 transition count 22
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 180 place count 13 transition count 20
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 13 transition count 20
Applied a total of 181 rules in 25 ms. Remains 13 /158 variables (removed 145) and now considering 20/157 (removed 137) transitions.
// Phase 1: matrix 20 rows 13 cols
[2025-06-02 03:49:44] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-02 03:49:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 03:49:44] [INFO ] Implicit Places using invariants and state equation in 29 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 58 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/158 places, 19/157 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 18
Applied a total of 1 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 12 cols
[2025-06-02 03:49:44] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:44] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-02 03:49:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 03:49:44] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/158 places, 18/157 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 128 ms. Remains : 12/158 places, 18/157 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-01
Stuttering criterion allowed to conclude after 408 steps with 23 reset in 10 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-01 finished in 599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U X(((!p1&&F(p2)) U (G((!p1&&F(p2)))||(!p1&&F(p2)&&G(p3))))))))'
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 157/157 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 157
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 147 transition count 152
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 147 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 145 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 145 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 144 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 144 transition count 149
Applied a total of 22 rules in 22 ms. Remains 144 /158 variables (removed 14) and now considering 149/157 (removed 8) transitions.
// Phase 1: matrix 149 rows 144 cols
[2025-06-02 03:49:44] [INFO ] Computed 6 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:44] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-02 03:49:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:44] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2025-06-02 03:49:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 149/292 variables, 143/149 constraints. Problems are: Problem set: 0 solved, 148 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 1/293 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 150 constraints, problems are : Problem set: 0 solved, 148 unsolved in 6773 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 149/292 variables, 143/149 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 148/297 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 1/293 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 298 constraints, problems are : Problem set: 0 solved, 148 unsolved in 8949 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15755ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 15758ms
Starting structural reductions in LTL mode, iteration 1 : 144/158 places, 149/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15944 ms. Remains : 144/158 places, 149/157 transitions.
Stuttering acceptance computed with spot in 517 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), true, (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), p0, (NOT p3), (AND p0 (NOT p3) (NOT p1))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-02
Product exploration explored 100000 steps with 2675 reset in 326 ms.
Product exploration explored 100000 steps with 2727 reset in 268 ms.
Computed a total of 63 stabilizing places and 66 stable transitions
Graph (complete) has 170 edges and 144 vertex of which 100 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Computed a total of 63 stabilizing places and 66 stable transitions
Detected a total of 63/144 stabilizing places and 66/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 p2), (X (NOT p0)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) p3))), (X (X (AND (NOT p0) (NOT p1) p3))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 15 factoid took 376 ms. Reduced automaton from 11 states, 41 edges and 4 AP (stutter sensitive) to 11 states, 40 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 434 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), true, (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), p0, (NOT p3), (AND p0 (NOT p3) (NOT p1))]
RANDOM walk for 40000 steps (163 resets) in 329 ms. (121 steps per ms) remains 7/20 properties
BEST_FIRST walk for 40004 steps (25 resets) in 148 ms. (268 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (32 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (24 resets) in 83 ms. (476 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (35 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
[2025-06-02 03:50:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 40/55 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/59 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 49/108 variables, 24/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 46/154 variables, 25/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 37/191 variables, 19/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/191 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 18/209 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 37/246 variables, 31/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/246 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 15/261 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/261 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 15/276 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/276 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 11/287 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/287 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 5/292 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/292 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/293 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/293 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/293 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 327 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 40/55 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/59 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 49/108 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 46/154 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 37/191 variables, 19/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/191 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/209 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/209 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 37/246 variables, 31/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/246 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 15/261 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/261 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 15/276 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/276 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 11/287 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/287 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 5/292 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/292 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/293 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/293 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/293 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 336 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 668ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 145 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=72 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 p2), (X (NOT p0)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) p3))), (X (X (AND (NOT p0) (NOT p1) p3))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p1) p3))), (F (NOT (OR (NOT p1) (NOT p3) p0))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p3 p0))), (F (NOT (OR p1 (NOT p3) (NOT p0)))), (F (NOT (OR p1 p3))), (F (NOT p3)), (F (NOT (OR (NOT p1) p3 (NOT p0)))), (F (NOT p2)), (F (NOT (OR p1 p3 (NOT p0)))), (F p1), (F (NOT (AND (NOT p1) p3 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p3) (NOT p0)))), (F p0), (F (NOT (OR p1 p3 p0))), (F (NOT (OR p1 p3 p2))), (F (NOT (OR (NOT p1) p0)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p1) p3 (NOT p0))))
Knowledge based reduction with 15 factoid took 903 ms. Reduced automaton from 11 states, 40 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA IBMB2S565S3960-PT-none-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-02 finished in 19743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 157/157 transitions.
Graph (complete) has 193 edges and 158 vertex of which 105 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.2 ms
Discarding 53 places :
Also discarding 46 output transitions
Drop transitions (Output transitions of discarded places.) removed 46 transitions
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 99 transition count 50
Reduce places removed 60 places and 0 transitions.
Graph (trivial) has 33 edges and 39 vertex of which 5 / 39 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 35 transition count 50
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 128 place count 35 transition count 44
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 128 place count 35 transition count 32
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 152 place count 23 transition count 32
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 154 place count 21 transition count 30
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 21 transition count 30
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 170 place count 14 transition count 23
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 173 place count 14 transition count 20
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 177 place count 12 transition count 21
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 179 place count 12 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 182 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 11 transition count 15
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 184 place count 10 transition count 15
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 185 place count 9 transition count 14
Iterating global reduction 6 with 1 rules applied. Total rules applied 186 place count 9 transition count 14
Applied a total of 186 rules in 15 ms. Remains 9 /158 variables (removed 149) and now considering 14/157 (removed 143) transitions.
// Phase 1: matrix 14 rows 9 cols
[2025-06-02 03:50:04] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:50:04] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-02 03:50:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:50:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 03:50:04] [INFO ] Implicit Places using invariants and state equation in 23 ms returned [3]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/158 places, 13/157 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 12
Applied a total of 1 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 8 cols
[2025-06-02 03:50:04] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:50:04] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-02 03:50:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:50:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 03:50:04] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/158 places, 12/157 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 8/158 places, 12/157 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-03
Stuttering criterion allowed to conclude after 16 steps with 2 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-03 finished in 190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||X(G(p0))) U p1)&&F((G(F(!p2))||(p3&&F(!p2))))))'
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 157/157 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 157
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 146 transition count 151
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 146 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 144 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 144 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 143 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 143 transition count 148
Applied a total of 24 rules in 13 ms. Remains 143 /158 variables (removed 15) and now considering 148/157 (removed 9) transitions.
// Phase 1: matrix 148 rows 143 cols
[2025-06-02 03:50:04] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:50:04] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-02 03:50:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:50:04] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-06-02 03:50:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/290 variables, 142/148 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/291 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 149 constraints, problems are : Problem set: 0 solved, 147 unsolved in 6434 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/290 variables, 142/148 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 147/295 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 1/291 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 296 constraints, problems are : Problem set: 0 solved, 147 unsolved in 14608 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21061ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 21062ms
Starting structural reductions in LTL mode, iteration 1 : 143/158 places, 148/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21225 ms. Remains : 143/158 places, 148/157 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p1), p2, p2, 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 21473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(p0) U p1)&&(F(p2) U p3)))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 157/157 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 150 transition count 157
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 13 place count 145 transition count 152
Iterating global reduction 1 with 5 rules applied. Total rules applied 18 place count 145 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 144 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 144 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 143 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 143 transition count 150
Applied a total of 22 rules in 17 ms. Remains 143 /158 variables (removed 15) and now considering 150/157 (removed 7) transitions.
// Phase 1: matrix 150 rows 143 cols
[2025-06-02 03:50:25] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:50:26] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-02 03:50:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:50:26] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2025-06-02 03:50:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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) 1/293 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 147 constraints, problems are : Problem set: 0 solved, 149 unsolved in 6884 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 149/295 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 1/293 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 296 constraints, problems are : Problem set: 0 solved, 149 unsolved in 15206 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22104ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 22106ms
Starting structural reductions in LTL mode, iteration 1 : 143/158 places, 150/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22271 ms. Remains : 143/158 places, 150/157 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p0), (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-09
Stuttering criterion allowed to conclude after 314 steps with 5 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-09 finished in 22576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 157/157 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 150 transition count 157
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 14 place count 144 transition count 151
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 144 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 142 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 141 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 141 transition count 148
Applied a total of 26 rules in 13 ms. Remains 141 /158 variables (removed 17) and now considering 148/157 (removed 9) transitions.
// Phase 1: matrix 148 rows 141 cols
[2025-06-02 03:50:48] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:50:48] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-02 03:50:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:50:48] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-06-02 03:50:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 6302 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 23114 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29432ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 29433ms
Starting structural reductions in LTL mode, iteration 1 : 141/158 places, 148/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29602 ms. Remains : 141/158 places, 148/157 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-10
Stuttering criterion allowed to conclude after 209 steps with 0 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-10 finished in 29796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (F((p1||X(F(p2))))||X(G(p3))))))'
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 157/157 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 157
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 148 transition count 153
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 148 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 146 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 146 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 145 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 145 transition count 150
Applied a total of 20 rules in 12 ms. Remains 145 /158 variables (removed 13) and now considering 150/157 (removed 7) transitions.
// Phase 1: matrix 150 rows 145 cols
[2025-06-02 03:51:18] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:51:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-02 03:51:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:51:18] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2025-06-02 03:51:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 6280 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 14378 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20671ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 20672ms
Starting structural reductions in LTL mode, iteration 1 : 145/158 places, 150/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20841 ms. Remains : 145/158 places, 150/157 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3) p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-11
Stuttering criterion allowed to conclude after 216 steps with 0 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-11 finished in 21077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||G(p1)||(!p0&&F(p2)))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 157/157 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 151 transition count 157
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 11 place count 147 transition count 153
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 147 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 146 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 146 transition count 152
Applied a total of 17 rules in 8 ms. Remains 146 /158 variables (removed 12) and now considering 152/157 (removed 5) transitions.
// Phase 1: matrix 152 rows 146 cols
[2025-06-02 03:51:39] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:51:39] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-02 03:51:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:51:39] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2025-06-02 03:51:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 152/297 variables, 145/150 constraints. Problems are: Problem set: 0 solved, 151 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 1/298 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 0/298 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 151 constraints, problems are : Problem set: 0 solved, 151 unsolved in 7763 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 152/297 variables, 145/150 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 151/301 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 1/298 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 302 constraints, problems are : Problem set: 0 solved, 151 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37787ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 37787ms
Starting structural reductions in LTL mode, iteration 1 : 146/158 places, 152/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37943 ms. Remains : 146/158 places, 152/157 transitions.
Stuttering acceptance computed with spot in 308 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 7 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 38272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(p1&&X((X(p3)&&p2)))))))'
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 157/157 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 151 transition count 157
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 145 transition count 151
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 145 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 143 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 143 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 142 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 142 transition count 148
Applied a total of 25 rules in 13 ms. Remains 142 /158 variables (removed 16) and now considering 148/157 (removed 9) transitions.
// Phase 1: matrix 148 rows 142 cols
[2025-06-02 03:52:17] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:17] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-02 03:52:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:17] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-06-02 03:52:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 6632 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 30014 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36654ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 36654ms
Starting structural reductions in LTL mode, iteration 1 : 142/158 places, 148/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36814 ms. Remains : 142/158 places, 148/157 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT 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 37183 ms.
All properties solved by simple procedures.
Total runtime 194036 ms.

BK_STOP 1748836374902

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IBMB2S565S3960-PT-none"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
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 r114-tall-174876422500356"
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.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 ;