Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 8.6K Jun 6 09:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 6 09:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 6 09:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 6 09:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:58 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 8.5K Jun 6 09:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 6 09:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 6 09:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Jun 6 09:05 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 26M 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-1005-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV0-PT-1005-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV0-PT-1005-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV0-PT-1005-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV0-PT-1005-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV0-PT-1005-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV0-PT-1005-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV0-PT-1005-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV0-PT-1005-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV0-PT-1005-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV0-PT-1005-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV0-PT-1005-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV0-PT-1005-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV0-PT-1005-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV0-PT-1005-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV0-PT-1005-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749359530913

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-1005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 05:12:12] [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:12:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 05:12:13] [INFO ] Load time of PNML (sax parser for PT used): 1095 ms
[2025-06-08 05:12:13] [INFO ] Transformed 273 places.
[2025-06-08 05:12:13] [INFO ] Transformed 23608 transitions.
[2025-06-08 05:12:13] [INFO ] Found NUPN structural information;
[2025-06-08 05:12:13] [INFO ] Parsed PT model containing 273 places and 23608 transitions and 545089 arcs in 1413 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ErlangenMainframeV0-PT-1005-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1005-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1005-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1005-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1005-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1005-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1005-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1005-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1005-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1005-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 23608/23608 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 212 transition count 23547
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 212 transition count 23547
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 150 place count 184 transition count 23519
Iterating global reduction 0 with 28 rules applied. Total rules applied 178 place count 184 transition count 23519
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 190 place count 172 transition count 15765
Ensure Unique test removed 6 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 208 place count 166 transition count 15765
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 218 place count 156 transition count 261
Iterating global reduction 0 with 10 rules applied. Total rules applied 228 place count 156 transition count 261
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 230 place count 154 transition count 257
Iterating global reduction 0 with 2 rules applied. Total rules applied 232 place count 154 transition count 257
Applied a total of 232 rules in 2368 ms. Remains 154 /273 variables (removed 119) and now considering 257/23608 (removed 23351) transitions.
// Phase 1: matrix 257 rows 154 cols
[2025-06-08 05:12:16] [INFO ] Computed 20 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:12:16] [INFO ] Implicit Places using invariants in 295 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 354 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/273 places, 257/23608 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2744 ms. Remains : 153/273 places, 257/23608 transitions.
Support contains 19 out of 153 places after structural reductions.
[2025-06-08 05:12:16] [INFO ] Flatten gal took : 61 ms
[2025-06-08 05:12:16] [INFO ] Flatten gal took : 29 ms
[2025-06-08 05:12:17] [INFO ] Input system was already deterministic with 257 transitions.
RANDOM walk for 35142 steps (7 resets) in 1208 ms. (29 steps per ms) remains 0/11 properties
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' '!((((F(p0) U p1) U G(p2))&&X(G(p2))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 257/257 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 143 transition count 240
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 143 transition count 240
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 138 transition count 210
Ensure Unique test removed 1 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 31 place count 137 transition count 210
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 35 place count 133 transition count 183
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 132 transition count 183
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 129 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 129 transition count 175
Applied a total of 46 rules in 8 ms. Remains 129 /153 variables (removed 24) and now considering 175/257 (removed 82) transitions.
// Phase 1: matrix 175 rows 129 cols
[2025-06-08 05:12:17] [INFO ] Computed 17 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:12:17] [INFO ] Implicit Places using invariants in 75 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/153 places, 175/257 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 128/153 places, 175/257 transitions.
Stuttering acceptance computed with spot in 349 ms :[true, (NOT p2), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1005-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1005-LTLCardinality-00 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0) U p1))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 257/257 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 140 transition count 230
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 140 transition count 230
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 131 transition count 186
Ensure Unique test removed 2 places
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 129 transition count 186
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 126 transition count 173
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 53 place count 125 transition count 173
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 56 place count 122 transition count 167
Iterating global reduction 0 with 3 rules applied. Total rules applied 59 place count 122 transition count 167
Applied a total of 59 rules in 18 ms. Remains 122 /153 variables (removed 31) and now considering 167/257 (removed 90) transitions.
// Phase 1: matrix 167 rows 122 cols
[2025-06-08 05:12:18] [INFO ] Computed 16 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:12:18] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-08 05:12:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:12:18] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2025-06-08 05:12:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:19] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:19] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/289 variables, 122/140 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 140 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6892 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:25] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 167/289 variables, 122/141 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 166/307 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:27] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:27] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:27] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:27] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:27] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:27] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:28] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:28] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 8/315 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:29] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:31] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:33] [INFO ] Deduced a trap along path composed of 6 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:33] [INFO ] Deduced a trap along path composed of 11 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:33] [INFO ] Deduced a trap along path composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 12 (OVERLAPS) 0/289 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 320 constraints, problems are : Problem set: 0 solved, 166 unsolved in 20709 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 27667ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 27676ms
Starting structural reductions in LTL mode, iteration 1 : 122/153 places, 167/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27873 ms. Remains : 122/153 places, 167/257 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLCardinality-02
Product exploration explored 100000 steps with 33333 reset in 182 ms.
Product exploration explored 100000 steps with 33333 reset in 105 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 15 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-1005-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1005-LTLCardinality-02 finished in 28417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 257/257 transitions.
Graph (trivial) has 118 edges and 153 vertex of which 6 / 153 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 149 transition count 237
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 133 transition count 237
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 33 place count 133 transition count 220
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 67 place count 116 transition count 220
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 80 place count 103 transition count 184
Iterating global reduction 2 with 13 rules applied. Total rules applied 93 place count 103 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 103 transition count 183
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 94 place count 103 transition count 181
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 98 place count 101 transition count 181
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 97 transition count 143
Ensure Unique test removed 2 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 95 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 93 transition count 131
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 93 transition count 131
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 91 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 91 transition count 127
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 196 place count 51 transition count 87
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 199 place count 48 transition count 73
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 203 place count 47 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 205 place count 47 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 206 place count 46 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 207 place count 46 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 4 with 2 rules applied. Total rules applied 209 place count 45 transition count 69
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -7
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 219 place count 40 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 233 place count 40 transition count 62
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 234 place count 40 transition count 62
Applied a total of 234 rules in 64 ms. Remains 40 /153 variables (removed 113) and now considering 62/257 (removed 195) transitions.
[2025-06-08 05:12:46] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
// Phase 1: matrix 44 rows 40 cols
[2025-06-08 05:12:46] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:12:46] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-08 05:12:46] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2025-06-08 05:12:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:12:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-08 05:12:46] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 05:12:46] [INFO ] Redundant transitions in 15 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-08 05:12:46] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2025-06-08 05:12:46] [INFO ] Invariant cache hit.
[2025-06-08 05:12:46] [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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 43/83 variables, 40/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/84 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 68 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1189 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 40/40 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 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, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 43/83 variables, 40/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 60/127 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/84 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/84 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 128 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1502 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 40/40 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2705ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2707ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/153 places, 62/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2878 ms. Remains : 40/153 places, 62/257 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLCardinality-04
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1005-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1005-LTLCardinality-04 finished in 2977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 257/257 transitions.
Graph (trivial) has 122 edges and 153 vertex of which 6 / 153 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 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 149 transition count 235
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 131 transition count 235
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 37 place count 131 transition count 219
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 69 place count 115 transition count 219
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 80 place count 104 transition count 185
Iterating global reduction 2 with 11 rules applied. Total rules applied 91 place count 104 transition count 185
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 104 transition count 184
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 104 transition count 181
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 101 transition count 181
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 101 place count 98 transition count 145
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 97 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 96 transition count 137
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 96 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 95 transition count 135
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 95 transition count 135
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 3 with 86 rules applied. Total rules applied 195 place count 52 transition count 92
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 198 place count 49 transition count 75
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 202 place count 48 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 204 place count 48 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 205 place count 47 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 206 place count 47 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 4 with 8 rules applied. Total rules applied 214 place count 43 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 228 place count 43 transition count 64
Applied a total of 228 rules in 38 ms. Remains 43 /153 variables (removed 110) and now considering 64/257 (removed 193) transitions.
[2025-06-08 05:12:49] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 43 cols
[2025-06-08 05:12:49] [INFO ] Computed 17 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:12:49] [INFO ] Implicit Places using invariants in 44 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/153 places, 64/257 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 41 transition count 63
Applied a total of 2 rules in 9 ms. Remains 41 /42 variables (removed 1) and now considering 63/64 (removed 1) transitions.
[2025-06-08 05:12:49] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
// Phase 1: matrix 44 rows 41 cols
[2025-06-08 05:12:49] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:12:49] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-08 05:12:49] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-08 05:12:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:12:49] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-08 05:12:49] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/153 places, 63/257 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 228 ms. Remains : 41/153 places, 63/257 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLCardinality-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1005-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1005-LTLCardinality-07 finished in 310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 257/257 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 138 transition count 228
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 138 transition count 228
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 129 transition count 184
Ensure Unique test removed 2 places
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 127 transition count 184
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 123 transition count 170
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 59 place count 122 transition count 170
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 62 place count 119 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 65 place count 119 transition count 164
Applied a total of 65 rules in 19 ms. Remains 119 /153 variables (removed 34) and now considering 164/257 (removed 93) transitions.
// Phase 1: matrix 164 rows 119 cols
[2025-06-08 05:12:49] [INFO ] Computed 16 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:12:49] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-08 05:12:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:12:49] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2025-06-08 05:12:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:50] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:51] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/283 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 137 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5927 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:56] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/283 variables, 119/138 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 163/301 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:57] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:57] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:58] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:58] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:12:58] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 5/306 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:13:00] [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 05:13:00] [INFO ] Deduced a trap along path composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 05:13:03] [INFO ] Deduced a trap along path composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 11 (OVERLAPS) 0/283 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 309 constraints, problems are : Problem set: 0 solved, 163 unsolved in 18673 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 24631ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 24631ms
Starting structural reductions in LTL mode, iteration 1 : 119/153 places, 164/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24800 ms. Remains : 119/153 places, 164/257 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 215 steps with 0 reset in 5 ms.
FORMULA ErlangenMainframeV0-PT-1005-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1005-LTLCardinality-10 finished in 24924 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(((!p1 U (!p2||G(!p1)))&&p0))))'
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 257/257 transitions.
Graph (trivial) has 118 edges and 153 vertex of which 6 / 153 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 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 149 transition count 239
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 135 transition count 239
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 29 place count 135 transition count 222
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 63 place count 118 transition count 222
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 71 place count 110 transition count 194
Iterating global reduction 2 with 8 rules applied. Total rules applied 79 place count 110 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 110 transition count 193
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 80 place count 110 transition count 191
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 84 place count 108 transition count 191
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 106 transition count 161
Ensure Unique test removed 1 places
Iterating global reduction 3 with 3 rules applied. Total rules applied 89 place count 105 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 104 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 104 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 103 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 103 transition count 147
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 177 place count 61 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 178 place count 60 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 60 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 180 place count 60 transition count 97
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 188 place count 56 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 199 place count 56 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 55 transition count 96
Applied a total of 200 rules in 55 ms. Remains 55 /153 variables (removed 98) and now considering 96/257 (removed 161) transitions.
[2025-06-08 05:13:14] [INFO ] Flow matrix only has 69 transitions (discarded 27 similar events)
// Phase 1: matrix 69 rows 55 cols
[2025-06-08 05:13:14] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 05:13:14] [INFO ] Implicit Places using invariants in 54 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/153 places, 96/257 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 113 ms. Remains : 54/153 places, 96/257 transitions.
Stuttering acceptance computed with spot in 42 ms :[(OR (NOT p0) (AND p1 p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1005-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1005-LTLCardinality-14 finished in 187 ms.
All properties solved by simple procedures.
Total runtime 62639 ms.

BK_STOP 1749359594942

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

tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-1005.tgz
mv ErlangenMainframeV0-PT-1005 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 ;