Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339600291.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-0707, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339600291
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 7.8K Jun 6 09:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 6 09:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 6 08:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 6 08:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 11:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 11:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 11:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 09:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Jun 6 09:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 6 09:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 6 09:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 11:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:57 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 5.4M 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-0707-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV0-PT-0707-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV0-PT-0707-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV0-PT-0707-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV0-PT-0707-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV0-PT-0707-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV0-PT-0707-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV0-PT-0707-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV0-PT-0707-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV0-PT-0707-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV0-PT-0707-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV0-PT-0707-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV0-PT-0707-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV0-PT-0707-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV0-PT-0707-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV0-PT-0707-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749354063081

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-0707
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 03:41:04] [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 03:41:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 03:41:04] [INFO ] Load time of PNML (sax parser for PT used): 403 ms
[2025-06-08 03:41:04] [INFO ] Transformed 243 places.
[2025-06-08 03:41:04] [INFO ] Transformed 6817 transitions.
[2025-06-08 03:41:04] [INFO ] Found NUPN structural information;
[2025-06-08 03:41:04] [INFO ] Parsed PT model containing 243 places and 6817 transitions and 114442 arcs in 553 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ErlangenMainframeV0-PT-0707-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0707-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0707-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0707-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0707-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0707-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0707-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0707-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0707-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0707-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 6817/6817 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 187 transition count 6761
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 187 transition count 6761
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 139 place count 160 transition count 6734
Iterating global reduction 0 with 27 rules applied. Total rules applied 166 place count 160 transition count 6734
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 177 place count 149 transition count 4562
Ensure Unique test removed 3 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 191 place count 146 transition count 4562
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 198 place count 139 transition count 380
Iterating global reduction 0 with 7 rules applied. Total rules applied 205 place count 139 transition count 380
Applied a total of 205 rules in 567 ms. Remains 139 /243 variables (removed 104) and now considering 380/6817 (removed 6437) transitions.
// Phase 1: matrix 380 rows 139 cols
[2025-06-08 03:41:05] [INFO ] Computed 17 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:41:06] [INFO ] Implicit Places using invariants in 434 ms returned [94]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 488 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/243 places, 380/6817 transitions.
Applied a total of 0 rules in 7 ms. Remains 138 /138 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1086 ms. Remains : 138/243 places, 380/6817 transitions.
Support contains 24 out of 138 places after structural reductions.
[2025-06-08 03:41:06] [INFO ] Flatten gal took : 88 ms
[2025-06-08 03:41:06] [INFO ] Flatten gal took : 49 ms
[2025-06-08 03:41:06] [INFO ] Input system was already deterministic with 380 transitions.
RANDOM walk for 37411 steps (8 resets) in 1333 ms. (28 steps per ms) remains 0/13 properties
Computed a total of 24 stabilizing places and 24 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' '!(F(G(p0)))'
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 380/380 transitions.
Graph (trivial) has 106 edges and 138 vertex of which 6 / 138 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 134 transition count 364
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 122 transition count 364
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 25 place count 122 transition count 350
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 53 place count 108 transition count 350
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 67 place count 94 transition count 189
Ensure Unique test removed 2 places
Iterating global reduction 2 with 16 rules applied. Total rules applied 83 place count 92 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 92 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 84 place count 92 transition count 186
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 90 transition count 186
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 93 place count 85 transition count 127
Ensure Unique test removed 1 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 84 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 82 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 82 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 81 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 81 transition count 119
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 173 place count 47 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 46 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 46 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 176 place count 46 transition count 77
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 186 place count 41 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 198 place count 41 transition count 76
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 41 transition count 76
Applied a total of 200 rules in 65 ms. Remains 41 /138 variables (removed 97) and now considering 76/380 (removed 304) transitions.
[2025-06-08 03:41:07] [INFO ] Flow matrix only has 55 transitions (discarded 21 similar events)
// Phase 1: matrix 55 rows 41 cols
[2025-06-08 03:41:07] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:41:07] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-08 03:41:07] [INFO ] Flow matrix only has 55 transitions (discarded 21 similar events)
[2025-06-08 03:41:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:41:07] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-08 03:41:07] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:41:07] [INFO ] Redundant transitions in 19 ms returned []
Running 74 sub problems to find dead transitions.
[2025-06-08 03:41:07] [INFO ] Flow matrix only has 55 transitions (discarded 21 similar events)
[2025-06-08 03:41:07] [INFO ] Invariant cache hit.
[2025-06-08 03:41:07] [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/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:08] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:08] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 54/95 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 1/96 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 72 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1965 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 54/95 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 74/145 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 1/96 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/96 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 146 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4051ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 4058ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/138 places, 76/380 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4254 ms. Remains : 41/138 places, 76/380 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLCardinality-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0707-LTLCardinality-07 finished in 4614 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((!p0&&F(p0))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 380/380 transitions.
Graph (trivial) has 111 edges and 138 vertex of which 6 / 138 are part of one of the 3 SCC in 0 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 134 transition count 362
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 120 transition count 362
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 29 place count 120 transition count 348
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 57 place count 106 transition count 348
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 73 place count 90 transition count 154
Ensure Unique test removed 2 places
Iterating global reduction 2 with 18 rules applied. Total rules applied 91 place count 88 transition count 154
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 88 transition count 153
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 92 place count 88 transition count 151
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 96 place count 86 transition count 151
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 103 place count 79 transition count 110
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 111 place count 78 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 78 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 114 place count 76 transition count 106
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 76 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 75 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 75 transition count 104
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 184 place count 42 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 185 place count 41 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 186 place count 41 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 187 place count 41 transition count 65
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 199 place count 35 transition count 72
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 212 place count 35 transition count 59
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 213 place count 35 transition count 59
Applied a total of 213 rules in 38 ms. Remains 35 /138 variables (removed 103) and now considering 59/380 (removed 321) transitions.
[2025-06-08 03:41:11] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
// Phase 1: matrix 42 rows 35 cols
[2025-06-08 03:41:11] [INFO ] Computed 13 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:41:12] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-08 03:41:12] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-08 03:41:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:41:12] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-08 03:41:12] [INFO ] Implicit Places using invariants and state equation in 53 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 03:41:12] [INFO ] Redundant transitions in 18 ms returned []
Running 57 sub problems to find dead transitions.
[2025-06-08 03:41:12] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-08 03:41:12] [INFO ] Invariant cache hit.
[2025-06-08 03:41:12] [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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 41/76 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 1/77 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/77 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 60 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1123 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 35/35 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 41/76 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 57/116 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:13] [INFO ] Deduced a trap along path composed of 4 places in 34 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 1/77 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/77 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 118 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1781 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 35/35 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2922ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 2923ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/138 places, 59/380 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3075 ms. Remains : 35/138 places, 59/380 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLCardinality-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0707-LTLCardinality-08 finished in 3163 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)||(X(G(p1))&&G(p2))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 380/380 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 123 transition count 228
Ensure Unique test removed 2 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 32 place count 121 transition count 228
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 112 transition count 165
Ensure Unique test removed 1 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 51 place count 111 transition count 165
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 55 place count 107 transition count 155
Iterating global reduction 0 with 4 rules applied. Total rules applied 59 place count 107 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 60 place count 106 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 61 place count 106 transition count 153
Applied a total of 61 rules in 8 ms. Remains 106 /138 variables (removed 32) and now considering 153/380 (removed 227) transitions.
// Phase 1: matrix 153 rows 106 cols
[2025-06-08 03:41:15] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:41:15] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-08 03:41:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:41:15] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-06-08 03:41:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:16] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:16] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 153/259 variables, 106/121 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 121 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5238 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:20] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 153/259 variables, 106/122 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 152/274 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:22] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:22] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:22] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:22] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:22] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:22] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 6/280 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:24] [INFO ] Deduced a trap along path composed of 6 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:24] [INFO ] Deduced a trap along path composed of 11 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:24] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:30] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/259 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:35] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 5 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/259 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:42] [INFO ] Deduced a trap along path composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/259 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 259/259 variables, and 286 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 35283ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 35284ms
Starting structural reductions in LTL mode, iteration 1 : 106/138 places, 153/380 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35450 ms. Remains : 106/138 places, 153/380 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0707-LTLCardinality-10 finished in 35635 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)&&F(G(p1)))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 380/380 transitions.
Graph (trivial) has 107 edges and 138 vertex of which 6 / 138 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 134 transition count 363
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 121 transition count 363
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 27 place count 121 transition count 349
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 55 place count 107 transition count 349
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 70 place count 92 transition count 187
Ensure Unique test removed 2 places
Iterating global reduction 2 with 17 rules applied. Total rules applied 87 place count 90 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 90 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 88 place count 90 transition count 185
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 89 transition count 185
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 96 place count 83 transition count 116
Ensure Unique test removed 1 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 103 place count 82 transition count 116
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 82 transition count 115
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 107 place count 79 transition count 109
Iterating global reduction 4 with 3 rules applied. Total rules applied 110 place count 79 transition count 109
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 111 place count 78 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 78 transition count 107
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 178 place count 45 transition count 74
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 179 place count 44 transition count 69
Iterating global reduction 4 with 1 rules applied. Total rules applied 180 place count 44 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 181 place count 44 transition count 68
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 195 place count 37 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 206 place count 37 transition count 73
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 207 place count 37 transition count 73
Applied a total of 207 rules in 42 ms. Remains 37 /138 variables (removed 101) and now considering 73/380 (removed 307) transitions.
[2025-06-08 03:41:50] [INFO ] Flow matrix only has 55 transitions (discarded 18 similar events)
// Phase 1: matrix 55 rows 37 cols
[2025-06-08 03:41:50] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:41:50] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-08 03:41:50] [INFO ] Flow matrix only has 55 transitions (discarded 18 similar events)
[2025-06-08 03:41:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:41:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 03:41:50] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:41:50] [INFO ] Redundant transitions in 12 ms returned []
Running 69 sub problems to find dead transitions.
[2025-06-08 03:41:50] [INFO ] Flow matrix only has 55 transitions (discarded 18 similar events)
[2025-06-08 03:41:50] [INFO ] Invariant cache hit.
[2025-06-08 03:41:50] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 54/91 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 1/92 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/92 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 72 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1427 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 54/91 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 69/140 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:41:52] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 1/92 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/92 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 142 constraints, problems are : Problem set: 0 solved, 69 unsolved in 2513 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3956ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 3957ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/138 places, 73/380 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4101 ms. Remains : 37/138 places, 73/380 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLCardinality-11
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0707-LTLCardinality-11 finished in 4251 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)&&((!p1||X(p2)) U (G((!p1||X(p2)))||(p3&&(!p1||X(p2)))))))'
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 380/380 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 124 transition count 201
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 124 transition count 201
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 116 transition count 176
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 116 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 115 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 115 transition count 174
Applied a total of 46 rules in 8 ms. Remains 115 /138 variables (removed 23) and now considering 174/380 (removed 206) transitions.
// Phase 1: matrix 174 rows 115 cols
[2025-06-08 03:41:55] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:41:55] [INFO ] Implicit Places using invariants in 52 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/138 places, 174/380 transitions.
Applied a total of 0 rules in 1 ms. Remains 114 /114 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 114/138 places, 174/380 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p2), (AND p1 (NOT p2)), true]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0707-LTLCardinality-14 finished in 271 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)&&F(p1))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 380/380 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 122 transition count 196
Ensure Unique test removed 1 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 33 place count 121 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 41 place count 113 transition count 164
Iterating global reduction 0 with 8 rules applied. Total rules applied 49 place count 113 transition count 164
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 51 place count 111 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 53 place count 111 transition count 160
Applied a total of 53 rules in 10 ms. Remains 111 /138 variables (removed 27) and now considering 160/380 (removed 220) transitions.
// Phase 1: matrix 160 rows 111 cols
[2025-06-08 03:41:55] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:41:55] [INFO ] Implicit Places using invariants in 44 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/138 places, 160/380 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 110/138 places, 160/380 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLCardinality-15
Product exploration explored 100000 steps with 18 reset in 188 ms.
Stack based approach found an accepted trace after 69 steps with 0 reset with depth 70 and stack size 70 in 0 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0707-LTLCardinality-15 finished in 427 ms.
All properties solved by simple procedures.
Total runtime 51445 ms.

BK_STOP 1749354115750

--------------------
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-0707"
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-0707, 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-174931339600291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-0707.tgz
mv ErlangenMainframeV0-PT-0707 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;