Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 6.6K Jun 6 09:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Jun 6 09:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 6 08:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 6 08:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 11:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Jun 6 11:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 11:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 14K Jun 6 09:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Jun 6 09:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Jun 6 09:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 09:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 11:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:56 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 485K 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-0505-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749352520984

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-0505
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 03:15:22] [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:15:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 03:15:22] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2025-06-08 03:15:22] [INFO ] Transformed 203 places.
[2025-06-08 03:15:22] [INFO ] Transformed 949 transitions.
[2025-06-08 03:15:22] [INFO ] Found NUPN structural information;
[2025-06-08 03:15:22] [INFO ] Parsed PT model containing 203 places and 949 transitions and 10344 arcs in 211 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 3 formulas.
FORMULA ErlangenMainframeV0-PT-0505-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0505-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0505-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0505-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0505-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0505-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0505-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 949/949 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 163 transition count 909
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 163 transition count 909
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 94 place count 149 transition count 895
Iterating global reduction 0 with 14 rules applied. Total rules applied 108 place count 149 transition count 895
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 113 place count 144 transition count 687
Ensure Unique test removed 1 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 119 place count 143 transition count 687
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 123 place count 139 transition count 273
Iterating global reduction 0 with 4 rules applied. Total rules applied 127 place count 139 transition count 273
Applied a total of 127 rules in 81 ms. Remains 139 /203 variables (removed 64) and now considering 273/949 (removed 676) transitions.
// Phase 1: matrix 273 rows 139 cols
[2025-06-08 03:15:22] [INFO ] Computed 15 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:15:22] [INFO ] Implicit Places using invariants in 297 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 329 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/203 places, 273/949 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 433 ms. Remains : 138/203 places, 273/949 transitions.
Support contains 30 out of 138 places after structural reductions.
[2025-06-08 03:15:23] [INFO ] Flatten gal took : 56 ms
[2025-06-08 03:15:23] [INFO ] Flatten gal took : 29 ms
[2025-06-08 03:15:23] [INFO ] Input system was already deterministic with 273 transitions.
RANDOM walk for 32456 steps (7 resets) in 951 ms. (34 steps per ms) remains 0/20 properties
FORMULA ErlangenMainframeV0-PT-0505-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 22 stabilizing places and 22 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' '!(((p0 U (G(p1)&&F(!p0))) U X(p2)))'
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 273/273 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 120 transition count 238
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 120 transition count 238
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 110 transition count 186
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 110 transition count 186
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 104 transition count 161
Ensure Unique test removed 2 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 102 transition count 161
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 99 transition count 141
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 99 transition count 141
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 98 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 98 transition count 139
Applied a total of 78 rules in 9 ms. Remains 98 /138 variables (removed 40) and now considering 139/273 (removed 134) transitions.
// Phase 1: matrix 139 rows 98 cols
[2025-06-08 03:15:23] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:15:23] [INFO ] Implicit Places using invariants in 55 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/138 places, 139/273 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 97/138 places, 139/273 transitions.
Stuttering acceptance computed with spot in 497 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1), (OR (NOT p1) p0), (NOT p1), p0]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 27 factoid took 22 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-0505-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0505-LTLCardinality-00 finished in 997 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&&X(p1)))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 273/273 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 121 transition count 239
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 121 transition count 239
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 45 place count 110 transition count 186
Iterating global reduction 0 with 11 rules applied. Total rules applied 56 place count 110 transition count 186
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 105 transition count 162
Ensure Unique test removed 2 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 103 transition count 162
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 99 transition count 140
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 99 transition count 140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 98 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 98 transition count 138
Applied a total of 78 rules in 9 ms. Remains 98 /138 variables (removed 40) and now considering 138/273 (removed 135) transitions.
// Phase 1: matrix 138 rows 98 cols
[2025-06-08 03:15:24] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:15:24] [INFO ] Implicit Places using invariants in 54 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/138 places, 138/273 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 97/138 places, 138/273 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLCardinality-01 finished in 206 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||X(p1))))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 273/273 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 119 transition count 237
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 119 transition count 237
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 50 place count 107 transition count 178
Ensure Unique test removed 1 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 63 place count 106 transition count 178
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 69 place count 100 transition count 147
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 99 transition count 147
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 96 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 96 transition count 137
Applied a total of 82 rules in 11 ms. Remains 96 /138 variables (removed 42) and now considering 137/273 (removed 136) transitions.
// Phase 1: matrix 137 rows 96 cols
[2025-06-08 03:15:25] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:15:25] [INFO ] Implicit Places using invariants in 49 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 95/138 places, 137/273 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 95/138 places, 137/273 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2879 steps with 0 reset in 6 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLCardinality-02 finished in 242 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((p0&&X(p1)))) U (p1 U X(p2))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 273/273 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 120 transition count 238
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 120 transition count 238
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 108 transition count 179
Ensure Unique test removed 1 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 61 place count 107 transition count 179
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 68 place count 100 transition count 147
Ensure Unique test removed 2 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 77 place count 98 transition count 147
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 81 place count 94 transition count 135
Iterating global reduction 0 with 4 rules applied. Total rules applied 85 place count 94 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 86 place count 93 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 87 place count 93 transition count 133
Applied a total of 87 rules in 6 ms. Remains 93 /138 variables (removed 45) and now considering 133/273 (removed 140) transitions.
// Phase 1: matrix 133 rows 93 cols
[2025-06-08 03:15:25] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:15:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-08 03:15:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:15:25] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-08 03:15:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:26] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:26] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:26] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:26] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/226 variables, 93/108 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/226 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 108 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4458 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:30] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:30] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/226 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 132/242 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:31] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:31] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:31] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:33] [INFO ] Deduced a trap along path composed of 11 places in 47 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:33] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:37] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:37] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/226 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:40] [INFO ] Deduced a trap along path composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 14 (OVERLAPS) 0/226 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 250 constraints, problems are : Problem set: 0 solved, 132 unsolved in 18216 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 22726ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 22733ms
Starting structural reductions in LTL mode, iteration 1 : 93/138 places, 133/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22868 ms. Remains : 93/138 places, 133/273 transitions.
Stuttering acceptance computed with spot in 550 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 176 steps with 30 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLCardinality-05 finished in 23440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 273/273 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 119 transition count 254
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 119 transition count 254
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 49 place count 108 transition count 219
Iterating global reduction 0 with 11 rules applied. Total rules applied 60 place count 108 transition count 219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 103 transition count 161
Ensure Unique test removed 2 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 101 transition count 161
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 97 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 97 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 96 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 96 transition count 137
Applied a total of 82 rules in 10 ms. Remains 96 /138 variables (removed 42) and now considering 137/273 (removed 136) transitions.
// Phase 1: matrix 137 rows 96 cols
[2025-06-08 03:15:48] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:15:48] [INFO ] Implicit Places using invariants in 45 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 95/138 places, 137/273 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 95/138 places, 137/273 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLCardinality-06
Product exploration explored 100000 steps with 662 reset in 107 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 0 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLCardinality-06 finished in 283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 273/273 transitions.
Graph (trivial) has 110 edges and 138 vertex of which 6 / 138 are part of one of the 3 SCC in 3 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 134 transition count 245
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 110 transition count 245
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 49 place count 110 transition count 235
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 69 place count 100 transition count 235
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 83 place count 86 transition count 204
Iterating global reduction 2 with 14 rules applied. Total rules applied 97 place count 86 transition count 204
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 97 place count 86 transition count 201
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 103 place count 83 transition count 201
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 107 place count 79 transition count 143
Ensure Unique test removed 1 places
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 78 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 78 transition count 142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 75 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 75 transition count 116
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 74 transition count 114
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 74 transition count 114
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 179 place count 45 transition count 85
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 182 place count 42 transition count 66
Iterating global reduction 3 with 3 rules applied. Total rules applied 185 place count 42 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 187 place count 42 transition count 64
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 188 place count 41 transition count 62
Iterating global reduction 4 with 1 rules applied. Total rules applied 189 place count 41 transition count 62
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 195 place count 38 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 202 place count 38 transition count 62
Applied a total of 202 rules in 69 ms. Remains 38 /138 variables (removed 100) and now considering 62/273 (removed 211) transitions.
[2025-06-08 03:15:49] [INFO ] Flow matrix only has 48 transitions (discarded 14 similar events)
// Phase 1: matrix 48 rows 38 cols
[2025-06-08 03:15:49] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:15:49] [INFO ] Implicit Places using invariants in 37 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/138 places, 62/273 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 111 ms. Remains : 37/138 places, 62/273 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLCardinality-07
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLCardinality-07 finished in 199 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((!p0 U (G(!p0)||p1)))) U (G(X(X((!p0 U (p2||G(!p0))))))||(p3&&X(X((!p0 U (p2||G(!p0)))))))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 273/273 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 120 transition count 238
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 120 transition count 238
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 108 transition count 180
Ensure Unique test removed 1 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 61 place count 107 transition count 180
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 68 place count 100 transition count 148
Ensure Unique test removed 2 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 77 place count 98 transition count 148
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 81 place count 94 transition count 136
Iterating global reduction 0 with 4 rules applied. Total rules applied 85 place count 94 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 86 place count 93 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 87 place count 93 transition count 134
Applied a total of 87 rules in 10 ms. Remains 93 /138 variables (removed 45) and now considering 134/273 (removed 139) transitions.
// Phase 1: matrix 134 rows 93 cols
[2025-06-08 03:15:49] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:15:49] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-08 03:15:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:15:49] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2025-06-08 03:15: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/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:50] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:50] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/227 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 106 constraints, problems are : Problem set: 0 solved, 133 unsolved in 4023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:53] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 134/227 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 133/240 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:54] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:54] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:54] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:55] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:55] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:56] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:57] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:15:57] [INFO ] Deduced a trap along path composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 0/227 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 248 constraints, problems are : Problem set: 0 solved, 133 unsolved in 11613 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 15657ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 15658ms
Starting structural reductions in LTL mode, iteration 1 : 93/138 places, 134/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15771 ms. Remains : 93/138 places, 134/273 transitions.
Stuttering acceptance computed with spot in 402 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), true, (AND p0 (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 99 ms.
Product exploration explored 100000 steps with 33333 reset in 91 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p3 p1 (NOT p0) p2), (X p2), (X p3), (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) p2)))), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (OR (AND p3 (NOT p0)) (AND p3 p2))), (X (NOT (AND p3 p0 (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (OR (AND p3 (NOT p0)) (AND p3 p2)))), (X (X (NOT (AND p3 p0 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) p2))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 24 factoid took 22 ms. Reduced automaton from 9 states, 31 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-0505-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0505-LTLCardinality-10 finished in 16418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 273/273 transitions.
Graph (trivial) has 112 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 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 134 transition count 244
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 109 transition count 244
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 51 place count 109 transition count 234
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 71 place count 99 transition count 234
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 86 place count 84 transition count 202
Iterating global reduction 2 with 15 rules applied. Total rules applied 101 place count 84 transition count 202
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 101 place count 84 transition count 200
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 82 transition count 200
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 78 transition count 142
Ensure Unique test removed 1 places
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 77 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 77 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 74 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 74 transition count 115
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 73 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 73 transition count 113
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 183 place count 43 transition count 83
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 187 place count 39 transition count 62
Ensure Unique test removed 1 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 192 place count 38 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 194 place count 38 transition count 60
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 196 place count 36 transition count 56
Iterating global reduction 4 with 2 rules applied. Total rules applied 198 place count 36 transition count 56
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 204 place count 33 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 213 place count 33 transition count 54
Applied a total of 213 rules in 30 ms. Remains 33 /138 variables (removed 105) and now considering 54/273 (removed 219) transitions.
[2025-06-08 03:16:05] [INFO ] Flow matrix only has 40 transitions (discarded 14 similar events)
// Phase 1: matrix 40 rows 33 cols
[2025-06-08 03:16:05] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:16:05] [INFO ] Implicit Places using invariants in 35 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/138 places, 54/273 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 52
Applied a total of 4 rules in 3 ms. Remains 30 /32 variables (removed 2) and now considering 52/54 (removed 2) transitions.
[2025-06-08 03:16:05] [INFO ] Flow matrix only has 38 transitions (discarded 14 similar events)
// Phase 1: matrix 38 rows 30 cols
[2025-06-08 03:16:05] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:16:05] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-08 03:16:05] [INFO ] Flow matrix only has 38 transitions (discarded 14 similar events)
[2025-06-08 03:16:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:16:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-08 03:16:05] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/138 places, 52/273 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 30/138 places, 52/273 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLCardinality-15
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLCardinality-15 finished in 199 ms.
All properties solved by simple procedures.
Total runtime 43671 ms.

BK_STOP 1749352565871

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

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