About the Execution of ITS-Tools for ErlangenMainframeV0-PT-1006
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 47631.00 | 0.00 | 0.00 | FFFTFTFFTFFTFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339700323.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 ErlangenMainframeV0-PT-1006, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339700323
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 40M
-rw-r--r-- 1 mcc users 8.5K Jun 6 09:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 6 09:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 6 08:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 6 08:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 11:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 11:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 11:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 14K Jun 6 09:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Jun 6 09:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Jun 6 09:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 6 09:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 11:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 40M Jun 5 20:08 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 ErlangenMainframeV0-PT-1006-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749360947149
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-1006
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 05:35:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 05:35:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 05:35:50] [INFO ] Load time of PNML (sax parser for PT used): 1549 ms
[2025-06-08 05:35:50] [INFO ] Transformed 279 places.
[2025-06-08 05:35:50] [INFO ] Transformed 35278 transitions.
[2025-06-08 05:35:50] [INFO ] Found NUPN structural information;
[2025-06-08 05:35:50] [INFO ] Parsed PT model containing 279 places and 35278 transitions and 817267 arcs in 1952 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ErlangenMainframeV0-PT-1006-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1006-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1006-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1006-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1006-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1006-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1006-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1006-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1006-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1006-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 35278/35278 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 216 transition count 35215
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 216 transition count 35215
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 156 place count 186 transition count 35185
Iterating global reduction 0 with 30 rules applied. Total rules applied 186 place count 186 transition count 35185
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 198 place count 174 transition count 23544
Ensure Unique test removed 6 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 216 place count 168 transition count 23544
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 227 place count 157 transition count 264
Iterating global reduction 0 with 11 rules applied. Total rules applied 238 place count 157 transition count 264
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 240 place count 155 transition count 260
Iterating global reduction 0 with 2 rules applied. Total rules applied 242 place count 155 transition count 260
Applied a total of 242 rules in 4319 ms. Remains 155 /279 variables (removed 124) and now considering 260/35278 (removed 35018) transitions.
// Phase 1: matrix 260 rows 155 cols
[2025-06-08 05:35:55] [INFO ] Computed 20 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:35:55] [INFO ] Implicit Places using invariants in 334 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 385 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 154/279 places, 260/35278 transitions.
Applied a total of 0 rules in 3 ms. Remains 154 /154 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4721 ms. Remains : 154/279 places, 260/35278 transitions.
Support contains 20 out of 154 places after structural reductions.
[2025-06-08 05:35:55] [INFO ] Flatten gal took : 62 ms
[2025-06-08 05:35:55] [INFO ] Flatten gal took : 33 ms
[2025-06-08 05:35:55] [INFO ] Input system was already deterministic with 260 transitions.
RANDOM walk for 40000 steps (8 resets) in 867 ms. (46 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
// Phase 1: matrix 260 rows 154 cols
[2025-06-08 05:35:56] [INFO ] Computed 19 invariants in 11 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/77 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:35:56] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 77/154 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:35:56] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:35:56] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 260/414 variables, 154/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/414 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/77 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 77/154 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:35:56] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 260/414 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/414 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 835ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 84 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 7 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
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(((p0 U X(p1)) U X(X(!p0))))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 260/260 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 142 transition count 248
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 142 transition count 248
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 135 transition count 222
Ensure Unique test removed 1 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 39 place count 134 transition count 222
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 43 place count 130 transition count 180
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 129 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 127 transition count 174
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 127 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 126 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 126 transition count 172
Applied a total of 54 rules in 8 ms. Remains 126 /154 variables (removed 28) and now considering 172/260 (removed 88) transitions.
// Phase 1: matrix 172 rows 126 cols
[2025-06-08 05:35:57] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:35:57] [INFO ] Implicit Places using invariants in 66 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/154 places, 172/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 125/154 places, 172/260 transitions.
Stuttering acceptance computed with spot in 820 ms :[(NOT p1), (OR (NOT p1) p0), p0, p0, p0, p0, p0, p0, p0, p0, p0, true, p0]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 49 steps with 0 reset in 4 ms.
FORMULA ErlangenMainframeV0-PT-1006-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1006-LTLCardinality-01 finished in 1053 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(p0)||F(p1)))))'
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 260/260 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 145 transition count 251
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 145 transition count 251
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 142 transition count 247
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 142 transition count 247
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 140 transition count 229
Ensure Unique test removed 1 places
Iterating global reduction 0 with 3 rules applied. Total rules applied 29 place count 139 transition count 229
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 31 place count 137 transition count 193
Iterating global reduction 0 with 2 rules applied. Total rules applied 33 place count 137 transition count 193
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 34 place count 136 transition count 191
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 136 transition count 191
Applied a total of 35 rules in 14 ms. Remains 136 /154 variables (removed 18) and now considering 191/260 (removed 69) transitions.
// Phase 1: matrix 191 rows 136 cols
[2025-06-08 05:35:58] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:35:58] [INFO ] Implicit Places using invariants in 66 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/154 places, 191/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 135 /135 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 135/154 places, 191/260 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 198 ms.
Product exploration explored 100000 steps with 33333 reset in 107 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-1006-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1006-LTLCardinality-03 finished in 604 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 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 260/260 transitions.
Graph (trivial) has 119 edges and 154 vertex of which 6 / 154 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 150 transition count 238
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 132 transition count 238
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 37 place count 132 transition count 224
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 65 place count 118 transition count 224
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 77 place count 106 transition count 180
Iterating global reduction 2 with 12 rules applied. Total rules applied 89 place count 106 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 106 transition count 179
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 90 place count 106 transition count 177
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 104 transition count 177
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 100 transition count 150
Ensure Unique test removed 1 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 103 place count 99 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 99 transition count 149
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 107 place count 96 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 110 place count 96 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 111 place count 95 transition count 127
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 95 transition count 127
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 198 place count 52 transition count 84
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 201 place count 49 transition count 76
Ensure Unique test removed 2 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 206 place count 47 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 207 place count 47 transition count 75
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 209 place count 45 transition count 72
Iterating global reduction 5 with 2 rules applied. Total rules applied 211 place count 45 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 213 place count 44 transition count 71
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 221 place count 40 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 234 place count 40 transition count 65
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 235 place count 40 transition count 65
Applied a total of 235 rules in 64 ms. Remains 40 /154 variables (removed 114) and now considering 65/260 (removed 195) transitions.
[2025-06-08 05:35:58] [INFO ] Flow matrix only has 48 transitions (discarded 17 similar events)
// Phase 1: matrix 48 rows 40 cols
[2025-06-08 05:35:58] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:35:59] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-08 05:35:59] [INFO ] Flow matrix only has 48 transitions (discarded 17 similar events)
[2025-06-08 05:35:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:35:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-08 05:35:59] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 05:35:59] [INFO ] Redundant transitions in 23 ms returned []
Running 63 sub problems to find dead transitions.
[2025-06-08 05:35:59] [INFO ] Flow matrix only has 48 transitions (discarded 17 similar events)
[2025-06-08 05:35:59] [INFO ] Invariant cache hit.
[2025-06-08 05:35:59] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 47/87 variables, 40/56 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 1/88 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 72 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1304 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 40/40 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 47/87 variables, 40/56 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 63/134 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 1/88 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/88 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 135 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1587 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 40/40 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2920ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2923ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/154 places, 65/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3106 ms. Remains : 40/154 places, 65/260 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLCardinality-04
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV0-PT-1006-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1006-LTLCardinality-04 finished in 3197 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||F(G(p0)))))'
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 260/260 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 140 transition count 246
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 140 transition count 246
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 132 transition count 219
Ensure Unique test removed 1 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 45 place count 131 transition count 219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 50 place count 126 transition count 176
Ensure Unique test removed 2 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 57 place count 124 transition count 176
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 60 place count 121 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 63 place count 121 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 64 place count 120 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 120 transition count 166
Applied a total of 65 rules in 7 ms. Remains 120 /154 variables (removed 34) and now considering 166/260 (removed 94) transitions.
// Phase 1: matrix 166 rows 120 cols
[2025-06-08 05:36:02] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:36:02] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-08 05:36:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:36:02] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-08 05:36:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:36:03] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:36:03] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/286 variables, 120/138 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 138 constraints, problems are : Problem set: 0 solved, 165 unsolved in 6049 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:36:08] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/286 variables, 120/139 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 165/304 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:36:10] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:36:12] [INFO ] Deduced a trap along path composed of 6 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:36:12] [INFO ] Deduced a trap along path composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:36:19] [INFO ] Deduced a trap along path composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/286 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 12 (OVERLAPS) 0/286 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 308 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22862 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 28949ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 28952ms
Starting structural reductions in LTL mode, iteration 1 : 120/154 places, 166/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29172 ms. Remains : 120/154 places, 166/260 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 151 ms.
Stack based approach found an accepted trace after 90 steps with 0 reset with depth 91 and stack size 91 in 6 ms.
FORMULA ErlangenMainframeV0-PT-1006-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1006-LTLCardinality-07 finished in 29445 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' '!(F(G(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 260/260 transitions.
Graph (trivial) has 124 edges and 154 vertex of which 6 / 154 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 150 transition count 236
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 130 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 41 place count 130 transition count 223
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 67 place count 117 transition count 223
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 79 place count 105 transition count 179
Iterating global reduction 2 with 12 rules applied. Total rules applied 91 place count 105 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 105 transition count 178
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 92 place count 105 transition count 175
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 98 place count 102 transition count 175
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 98 transition count 148
Ensure Unique test removed 1 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 107 place count 97 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 97 transition count 147
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 111 place count 94 transition count 127
Iterating global reduction 4 with 3 rules applied. Total rules applied 114 place count 94 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 93 transition count 125
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 93 transition count 125
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 204 place count 49 transition count 81
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 207 place count 46 transition count 73
Ensure Unique test removed 2 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 212 place count 44 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 213 place count 44 transition count 72
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 214 place count 43 transition count 70
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 43 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 217 place count 42 transition count 69
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 225 place count 38 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 240 place count 38 transition count 61
Applied a total of 240 rules in 54 ms. Remains 38 /154 variables (removed 116) and now considering 61/260 (removed 199) transitions.
[2025-06-08 05:36:31] [INFO ] Flow matrix only has 41 transitions (discarded 20 similar events)
// Phase 1: matrix 41 rows 38 cols
[2025-06-08 05:36:31] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:36:31] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-08 05:36:31] [INFO ] Flow matrix only has 41 transitions (discarded 20 similar events)
[2025-06-08 05:36:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:36:31] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-08 05:36:31] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 05:36:31] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2025-06-08 05:36:31] [INFO ] Flow matrix only has 41 transitions (discarded 20 similar events)
[2025-06-08 05:36:31] [INFO ] Invariant cache hit.
[2025-06-08 05:36:31] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 40/78 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 1/79 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/79 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 66 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1102 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 38/38 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 40/78 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 59/124 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/79 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 125 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1428 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 38/38 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2543ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 2543ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/154 places, 61/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2714 ms. Remains : 38/154 places, 61/260 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLCardinality-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1006-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1006-LTLCardinality-14 finished in 2793 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((F(p0)&&X((X(p1)&&G(p2))))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 260/260 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 143 transition count 249
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 143 transition count 249
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 136 transition count 223
Ensure Unique test removed 1 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 37 place count 135 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 41 place count 131 transition count 181
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 130 transition count 181
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 128 transition count 175
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 128 transition count 175
Applied a total of 50 rules in 10 ms. Remains 128 /154 variables (removed 26) and now considering 175/260 (removed 85) transitions.
// Phase 1: matrix 175 rows 128 cols
[2025-06-08 05:36:34] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:36:34] [INFO ] Implicit Places using invariants in 57 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/154 places, 175/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 127/154 places, 175/260 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), true, (AND p2 (NOT p1)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1006-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1006-LTLCardinality-15 finished in 389 ms.
All properties solved by simple procedures.
Total runtime 46377 ms.
BK_STOP 1749360994780
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="ErlangenMainframeV0-PT-1006"
export BK_EXAMINATION="LTLCardinality"
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 ErlangenMainframeV0-PT-1006, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339700323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-1006.tgz
mv ErlangenMainframeV0-PT-1006 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;