Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961073900059.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is FunctionPointer-PT-b002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961073900059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 7.9K Mar 7 07:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 7 07:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 07:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 7 07:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 07:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 7 07:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 07:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 7 07:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 391K Mar 3 18:30 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 FunctionPointer-PT-b002-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779667740147

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 00:09:01] [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]
[2026-05-25 00:09:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 00:09:01] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2026-05-25 00:09:01] [INFO ] Transformed 306 places.
[2026-05-25 00:09:01] [INFO ] Transformed 840 transitions.
[2026-05-25 00:09:01] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b002-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 214 transition count 648
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 35 place count 187 transition count 490
Iterating global reduction 1 with 27 rules applied. Total rules applied 62 place count 187 transition count 490
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 92 place count 187 transition count 460
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 107 place count 172 transition count 430
Iterating global reduction 2 with 15 rules applied. Total rules applied 122 place count 172 transition count 430
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 126 place count 172 transition count 426
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 131 place count 167 transition count 416
Iterating global reduction 3 with 5 rules applied. Total rules applied 136 place count 167 transition count 416
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 140 place count 163 transition count 400
Iterating global reduction 3 with 4 rules applied. Total rules applied 144 place count 163 transition count 400
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 148 place count 159 transition count 392
Iterating global reduction 3 with 4 rules applied. Total rules applied 152 place count 159 transition count 392
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 155 place count 156 transition count 380
Iterating global reduction 3 with 3 rules applied. Total rules applied 158 place count 156 transition count 380
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 161 place count 153 transition count 368
Iterating global reduction 3 with 3 rules applied. Total rules applied 164 place count 153 transition count 368
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 166 place count 151 transition count 364
Iterating global reduction 3 with 2 rules applied. Total rules applied 168 place count 151 transition count 364
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 170 place count 149 transition count 360
Iterating global reduction 3 with 2 rules applied. Total rules applied 172 place count 149 transition count 360
Applied a total of 172 rules in 85 ms. Remains 149 /222 variables (removed 73) and now considering 360/648 (removed 288) transitions.
[2026-05-25 00:09:01] [INFO ] Flow matrix only has 253 transitions (discarded 107 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2675622070353578914.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5360807356763944155.kers'
[2026-05-25 00:09:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2675622070353578914.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5360807356763944155.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 253 rows 149 cols 722 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-25 00:09:01] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5360807356763944155.kers
Total runtime 1 ms.
[2026-05-25 00:09:02] [INFO ] Implicit Places using invariants in 387 ms returned []
[2026-05-25 00:09:02] [INFO ] Flow matrix only has 253 transitions (discarded 107 similar events)
[2026-05-25 00:09:02] [INFO ] Invariant cache hit.
[2026-05-25 00:09:02] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-25 00:09:02] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2026-05-25 00:09:02] [INFO ] Flow matrix only has 253 transitions (discarded 107 similar events)
[2026-05-25 00:09:02] [INFO ] Invariant cache hit.
[2026-05-25 00:09:02] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (OVERLAPS) 253/401 variables, 148/151 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 57/208 constraints. Problems are: Problem set: 0 solved, 358 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (OVERLAPS) 1/402 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 9 (OVERLAPS) 0/402 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 358 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 209 constraints, problems are : Problem set: 0 solved, 358 unsolved in 18354 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 149/149 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (OVERLAPS) 253/401 variables, 148/151 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 57/208 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 32/240 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 7/247 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 9 (OVERLAPS) 1/402 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 326/574 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/402 variables, and 574 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 149/149 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 48682ms problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 48695ms
Starting structural reductions in LTL mode, iteration 1 : 149/222 places, 360/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49667 ms. Remains : 149/222 places, 360/648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 360/360 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 360/360 (removed 0) transitions.
[2026-05-25 00:09:51] [INFO ] Flow matrix only has 253 transitions (discarded 107 similar events)
[2026-05-25 00:09:51] [INFO ] Invariant cache hit.
[2026-05-25 00:09:51] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-25 00:09:51] [INFO ] Flow matrix only has 253 transitions (discarded 107 similar events)
[2026-05-25 00:09:51] [INFO ] Invariant cache hit.
[2026-05-25 00:09:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-25 00:09:51] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 149/149 places, 360/360 transitions.
Support contains 28 out of 149 places after structural reductions.
[2026-05-25 00:09:52] [INFO ] Flatten gal took : 55 ms
[2026-05-25 00:09:52] [INFO ] Flatten gal took : 25 ms
[2026-05-25 00:09:52] [INFO ] Input system was already deterministic with 360 transitions.
RANDOM walk for 36783 steps (68 resets) in 913 ms. (40 steps per ms) remains 0/23 properties
FORMULA FunctionPointer-PT-b002-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 800 edges and 149 vertex of which 147 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U X(X(X(p1)))))))'
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 360/360 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 360
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 139 transition count 340
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 139 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 139 transition count 338
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 132 transition count 320
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 132 transition count 320
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 41 place count 125 transition count 304
Iterating global reduction 2 with 7 rules applied. Total rules applied 48 place count 125 transition count 304
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 120 transition count 288
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 115 transition count 276
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 115 transition count 276
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 111 transition count 266
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 111 transition count 266
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 107 transition count 256
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 107 transition count 256
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 104 transition count 250
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 104 transition count 250
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 93 place count 101 transition count 244
Iterating global reduction 2 with 3 rules applied. Total rules applied 96 place count 101 transition count 244
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 99 transition count 240
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 98 transition count 238
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 97 transition count 236
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 97 transition count 236
Applied a total of 104 rules in 51 ms. Remains 97 /149 variables (removed 52) and now considering 236/360 (removed 124) transitions.
[2026-05-25 00:09:52] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14796277906815265050.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15688180887622145785.kers'
[2026-05-25 00:09:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14796277906815265050.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15688180887622145785.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 159 rows 97 cols 440 entries
Finished phase 1 with 94 SingleSign rule and 1 generalized
[2026-05-25 00:09:52] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-15688180887622145785.kers
Total runtime 6 ms.
[2026-05-25 00:09:53] [INFO ] Implicit Places using invariants in 520 ms returned []
[2026-05-25 00:09:53] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2026-05-25 00:09:53] [INFO ] Invariant cache hit.
[2026-05-25 00:09:53] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 00:09:53] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2026-05-25 00:09:53] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2026-05-25 00:09:53] [INFO ] Invariant cache hit.
[2026-05-25 00:09:53] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 7249 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 8/378 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 378 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 37461ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 37462ms
Starting structural reductions in LTL mode, iteration 1 : 97/149 places, 236/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38376 ms. Remains : 97/149 places, 236/360 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U X(X(X(p1)))))))'
Stuttering acceptance computed with spot in 551 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 158 steps with 2 reset in 4 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-00 finished in 39037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 360/360 transitions.
Graph (complete) has 800 edges and 149 vertex of which 148 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 142 transition count 346
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 142 transition count 346
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 15 place count 142 transition count 344
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 137 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 137 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 132 transition count 320
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 132 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 129 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 129 transition count 312
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 126 transition count 304
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 126 transition count 304
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 124 transition count 300
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 124 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 122 transition count 296
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 122 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 121 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 121 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 120 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 120 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 119 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 119 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 67 place count 119 transition count 284
Applied a total of 67 rules in 86 ms. Remains 119 /149 variables (removed 30) and now considering 284/360 (removed 76) transitions.
[2026-05-25 00:10:32] [INFO ] Flow matrix only has 195 transitions (discarded 89 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-319331906714422707.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3755760819420971765.kers'
[2026-05-25 00:10:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-319331906714422707.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3755760819420971765.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 119 cols 548 entries
Finished phase 1 with 116 SingleSign rule and 1 generalized
[2026-05-25 00:10:32] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3755760819420971765.kers
Total runtime 3 ms.
[2026-05-25 00:10:32] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 00:10:32] [INFO ] Flow matrix only has 195 transitions (discarded 89 similar events)
[2026-05-25 00:10:32] [INFO ] Invariant cache hit.
[2026-05-25 00:10:32] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-25 00:10:32] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2026-05-25 00:10:32] [INFO ] Redundant transitions in 18 ms returned []
Running 282 sub problems to find dead transitions.
[2026-05-25 00:10:32] [INFO ] Flow matrix only has 195 transitions (discarded 89 similar events)
[2026-05-25 00:10:32] [INFO ] Invariant cache hit.
[2026-05-25 00:10:32] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 195/313 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 44/164 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 282 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/314 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 165 constraints, problems are : Problem set: 0 solved, 282 unsolved in 9290 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 195/313 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 44/164 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 32/196 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 8/204 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 250/455 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/314 variables, and 455 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 39419ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 39425ms
Starting structural reductions in SI_LTL mode, iteration 1 : 119/149 places, 284/360 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39935 ms. Remains : 119/149 places, 284/360 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-01
Stuttering criterion allowed to conclude after 295 steps with 1 reset in 3 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-01 finished in 40080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(((G(F(p1)) U G((p0||F(p2)))) U (p0&&(G(F(p1)) U G((p0||F(p2))))))))))'
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 360/360 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 360
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 140 transition count 342
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 140 transition count 342
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 133 transition count 324
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 133 transition count 324
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 126 transition count 308
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 126 transition count 308
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 121 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 121 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 116 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 116 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 112 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 112 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 108 transition count 260
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 108 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 83 place count 105 transition count 254
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 105 transition count 254
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 102 transition count 248
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 102 transition count 248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 100 transition count 244
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 98 transition count 240
Applied a total of 100 rules in 23 ms. Remains 98 /149 variables (removed 51) and now considering 240/360 (removed 120) transitions.
[2026-05-25 00:11:12] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17762815645302840424.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7906939154341933515.kers'
[2026-05-25 00:11:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17762815645302840424.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7906939154341933515.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 161 rows 98 cols 444 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-25 00:11:12] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7906939154341933515.kers
Total runtime 1 ms.
[2026-05-25 00:11:12] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 00:11:12] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2026-05-25 00:11:12] [INFO ] Invariant cache hit.
[2026-05-25 00:11:12] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 00:11:12] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2026-05-25 00:11:12] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2026-05-25 00:11:12] [INFO ] Invariant cache hit.
[2026-05-25 00:11:12] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 6634 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 8/383 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 0/259 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 383 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 36715ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 36717ms
Starting structural reductions in LTL mode, iteration 1 : 98/149 places, 240/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37108 ms. Remains : 98/149 places, 240/360 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(((G(F(p1)) U G((p0||F(p2)))) U (p0&&(G(F(p1)) U G((p0||F(p2))))))))))'
Stuttering acceptance computed with spot in 326 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-02
Stuttering criterion allowed to conclude after 148 steps with 1 reset in 4 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-02 finished in 37496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 360/360 transitions.
Graph (complete) has 800 edges and 149 vertex of which 147 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 139 transition count 340
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 139 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 19 place count 139 transition count 338
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 132 transition count 320
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 132 transition count 320
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 40 place count 125 transition count 304
Iterating global reduction 1 with 7 rules applied. Total rules applied 47 place count 125 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 120 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 115 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 115 transition count 276
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 111 transition count 266
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 111 transition count 266
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 79 place count 107 transition count 256
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 107 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 104 transition count 250
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 104 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 101 transition count 244
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 101 transition count 244
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 99 transition count 240
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 97 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 97 transition count 234
Applied a total of 105 rules in 55 ms. Remains 97 /149 variables (removed 52) and now considering 234/360 (removed 126) transitions.
[2026-05-25 00:11:49] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16908810643422639726.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2498183132313748283.kers'
[2026-05-25 00:11:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16908810643422639726.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2498183132313748283.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 158 rows 97 cols 438 entries
Finished phase 1 with 94 SingleSign rule and 1 generalized
[2026-05-25 00:11:49] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2498183132313748283.kers
Total runtime 0 ms.
[2026-05-25 00:11:49] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 00:11:49] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2026-05-25 00:11:49] [INFO ] Invariant cache hit.
[2026-05-25 00:11:49] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 00:11:49] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2026-05-25 00:11:49] [INFO ] Redundant transitions in 8 ms returned []
Running 232 sub problems to find dead transitions.
[2026-05-25 00:11:49] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2026-05-25 00:11:49] [INFO ] Invariant cache hit.
[2026-05-25 00:11:49] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 136 constraints, problems are : Problem set: 0 solved, 232 unsolved in 6344 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 232/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 8/376 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 0/255 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 376 constraints, problems are : Problem set: 0 solved, 232 unsolved in 19736 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 26142ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 26143ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/149 places, 234/360 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26527 ms. Remains : 97/149 places, 234/360 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-03
Stuttering criterion allowed to conclude after 110 steps with 2 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-03 finished in 26654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 360/360 transitions.
Graph (complete) has 800 edges and 149 vertex of which 147 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 139 transition count 340
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 139 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 19 place count 139 transition count 338
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 132 transition count 320
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 132 transition count 320
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 40 place count 125 transition count 304
Iterating global reduction 1 with 7 rules applied. Total rules applied 47 place count 125 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 120 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 115 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 115 transition count 276
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 111 transition count 266
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 111 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 108 transition count 258
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 108 transition count 258
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 105 transition count 252
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 105 transition count 252
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 102 transition count 246
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 102 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 100 transition count 242
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 99 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 98 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 98 transition count 236
Applied a total of 103 rules in 40 ms. Remains 98 /149 variables (removed 51) and now considering 236/360 (removed 124) transitions.
[2026-05-25 00:12:16] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2821468040697644070.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5460902027971863494.kers'
[2026-05-25 00:12:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2821468040697644070.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5460902027971863494.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 161 rows 98 cols 446 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-25 00:12:16] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5460902027971863494.kers
Total runtime 0 ms.
[2026-05-25 00:12:16] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-25 00:12:16] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
[2026-05-25 00:12:16] [INFO ] Invariant cache hit.
[2026-05-25 00:12:16] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 00:12:16] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2026-05-25 00:12:16] [INFO ] Redundant transitions in 4 ms returned []
Running 234 sub problems to find dead transitions.
[2026-05-25 00:12:16] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
[2026-05-25 00:12:16] [INFO ] Invariant cache hit.
[2026-05-25 00:12:16] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 139 constraints, problems are : Problem set: 0 solved, 234 unsolved in 6795 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 234/373 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 8/381 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 0/259 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 381 constraints, problems are : Problem set: 0 solved, 234 unsolved in 22501 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 29355ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 29356ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/149 places, 236/360 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29740 ms. Remains : 98/149 places, 236/360 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-04
Stuttering criterion allowed to conclude after 279 steps with 1 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-04 finished in 29815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X(p0))||(!p0 U (G(!p0)||(!p0&&G(p1))))) U (p2&&(X(X(p0))||(!p0 U (G(!p0)||(!p0&&G(p1)))))))))'
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 360/360 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 360
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 142 transition count 346
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 142 transition count 346
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 142 transition count 344
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 138 transition count 334
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 138 transition count 334
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 26 place count 134 transition count 324
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 134 transition count 324
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 34 place count 130 transition count 312
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 130 transition count 312
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 126 transition count 304
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 126 transition count 304
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 123 transition count 296
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 123 transition count 296
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 120 transition count 288
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 120 transition count 288
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 118 transition count 284
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 118 transition count 284
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 116 transition count 280
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 116 transition count 280
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 115 transition count 278
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 115 transition count 278
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 114 transition count 276
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 114 transition count 276
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 113 transition count 274
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 113 transition count 274
Applied a total of 72 rules in 21 ms. Remains 113 /149 variables (removed 36) and now considering 274/360 (removed 86) transitions.
[2026-05-25 00:12:45] [INFO ] Flow matrix only has 190 transitions (discarded 84 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12585939759147683799.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6351886107024465995.kers'
[2026-05-25 00:12:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12585939759147683799.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6351886107024465995.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 113 cols 532 entries
Finished phase 1 with 110 SingleSign rule and 1 generalized
[2026-05-25 00:12:46] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6351886107024465995.kers
Total runtime 1 ms.
[2026-05-25 00:12:46] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 00:12:46] [INFO ] Flow matrix only has 190 transitions (discarded 84 similar events)
[2026-05-25 00:12:46] [INFO ] Invariant cache hit.
[2026-05-25 00:12:46] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-25 00:12:46] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2026-05-25 00:12:46] [INFO ] Flow matrix only has 190 transitions (discarded 84 similar events)
[2026-05-25 00:12:46] [INFO ] Invariant cache hit.
[2026-05-25 00:12:46] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 190/303 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 44/159 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 272 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/303 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 159 constraints, problems are : Problem set: 0 solved, 272 unsolved in 8540 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 190/303 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 44/159 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 272/431 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 8/439 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 439 constraints, problems are : Problem set: 0 solved, 272 unsolved in 28263 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 36887ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 36888ms
Starting structural reductions in LTL mode, iteration 1 : 113/149 places, 274/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37280 ms. Remains : 113/149 places, 274/360 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X(p0))||(!p0 U (G(!p0)||(!p0&&G(p1))))) U (p2&&(X(X(p0))||(!p0 U (G(!p0)||(!p0&&G(p1)))))))))'
Stuttering acceptance computed with spot in 399 ms :[(NOT p2), (NOT p2), (NOT p0), false, false, (NOT p0), true, false, (AND (NOT p1) (NOT p0)), p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-06
Product exploration explored 100000 steps with 20001 reset in 190 ms.
Product exploration explored 100000 steps with 20036 reset in 170 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge based reduction with 13 factoid took 266 ms. Reduced automaton from 12 states, 26 edges and 3 AP (stutter sensitive) to 12 states, 26 edges and 3 AP (stutter sensitive).
RANDOM walk for 40001 steps (74 resets) in 454 ms. (87 steps per ms) remains 1/7 properties
BEST_FIRST walk for 38632 steps (11 resets) in 122 ms. (314 steps per ms) remains 0/1 properties
Knowledge based reduction with 13 factoid took 199 ms. Reduced automaton from 12 states, 26 edges and 3 AP (stutter sensitive) to 12 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 483 ms :[(NOT p2), (NOT p2), (NOT p0), false, false, (NOT p0), true, false, (AND (NOT p1) (NOT p0)), p0, (AND p0 (NOT p1)), (NOT p1)]
[2026-05-25 00:13:25] [INFO ] Flow matrix only has 190 transitions (discarded 84 similar events)
[2026-05-25 00:13:25] [INFO ] Invariant cache hit.
[2026-05-25 00:13:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
Proved EG (NOT p2) asserting that LTL formula F !(NOT p2) is false.
Negative knowledge disproves property using: (F p2)
Knowledge-based reduction took 1287 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-06 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property FunctionPointer-PT-b002-LTLCardinality-06 finished in 39389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&G(p1))))'
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 360/360 transitions.
Graph (complete) has 800 edges and 149 vertex of which 147 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 139 transition count 340
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 139 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 19 place count 139 transition count 338
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 132 transition count 320
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 132 transition count 320
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 40 place count 125 transition count 304
Iterating global reduction 1 with 7 rules applied. Total rules applied 47 place count 125 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 120 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 115 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 115 transition count 276
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 111 transition count 266
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 111 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 108 transition count 258
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 108 transition count 258
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 106 transition count 254
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 106 transition count 254
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 104 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 104 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 103 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 103 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 102 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 102 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 101 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 101 transition count 244
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 101 transition count 242
Applied a total of 97 rules in 37 ms. Remains 101 /149 variables (removed 48) and now considering 242/360 (removed 118) transitions.
[2026-05-25 00:13:25] [INFO ] Flow matrix only has 165 transitions (discarded 77 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10758006082864773764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15067705446953354332.kers'
[2026-05-25 00:13:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10758006082864773764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15067705446953354332.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 101 cols 458 entries
Finished phase 1 with 98 SingleSign rule and 1 generalized
[2026-05-25 00:13:25] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15067705446953354332.kers
Total runtime 0 ms.
[2026-05-25 00:13:25] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 00:13:25] [INFO ] Flow matrix only has 165 transitions (discarded 77 similar events)
[2026-05-25 00:13:25] [INFO ] Invariant cache hit.
[2026-05-25 00:13:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 00:13:25] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2026-05-25 00:13:25] [INFO ] Redundant transitions in 2 ms returned []
Running 240 sub problems to find dead transitions.
[2026-05-25 00:13:25] [INFO ] Flow matrix only has 165 transitions (discarded 77 similar events)
[2026-05-25 00:13:25] [INFO ] Invariant cache hit.
[2026-05-25 00:13:25] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 165/266 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/266 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 143 constraints, problems are : Problem set: 0 solved, 240 unsolved in 6838 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 165/266 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 240/383 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 8/391 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 0/266 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 391 constraints, problems are : Problem set: 0 solved, 240 unsolved in 26231 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 33144ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 33146ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/149 places, 242/360 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33556 ms. Remains : 101/149 places, 242/360 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&G(p1))))'
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-07
Stuttering criterion allowed to conclude after 1605 steps with 8 reset in 10 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-07 finished in 33702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U X(X((p1 U p2)))))))'
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 360/360 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 360
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 140 transition count 342
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 140 transition count 342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 140 transition count 340
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 135 transition count 328
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 135 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 33 place count 130 transition count 316
Iterating global reduction 2 with 5 rules applied. Total rules applied 38 place count 130 transition count 316
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 127 transition count 308
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 127 transition count 308
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 124 transition count 302
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 124 transition count 302
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 122 transition count 298
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 122 transition count 298
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 120 transition count 294
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 120 transition count 294
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 119 transition count 292
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 119 transition count 292
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 118 transition count 290
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 118 transition count 290
Applied a total of 62 rules in 14 ms. Remains 118 /149 variables (removed 31) and now considering 290/360 (removed 70) transitions.
[2026-05-25 00:13:59] [INFO ] Flow matrix only has 198 transitions (discarded 92 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12109772961983717633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15261159136771362490.kers'
[2026-05-25 00:13:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12109772961983717633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15261159136771362490.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 198 rows 118 cols 554 entries
Finished phase 1 with 115 SingleSign rule and 1 generalized
[2026-05-25 00:13:59] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15261159136771362490.kers
Total runtime 1 ms.
[2026-05-25 00:13:59] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 00:13:59] [INFO ] Flow matrix only has 198 transitions (discarded 92 similar events)
[2026-05-25 00:13:59] [INFO ] Invariant cache hit.
[2026-05-25 00:13:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-25 00:13:59] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2026-05-25 00:13:59] [INFO ] Flow matrix only has 198 transitions (discarded 92 similar events)
[2026-05-25 00:13:59] [INFO ] Invariant cache hit.
[2026-05-25 00:13:59] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 198/316 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 44/164 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 288 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 164 constraints, problems are : Problem set: 0 solved, 288 unsolved in 9171 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 198/316 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 44/164 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 288/452 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 8/460 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 460 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 39272ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 39275ms
Starting structural reductions in LTL mode, iteration 1 : 118/149 places, 290/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39641 ms. Remains : 118/149 places, 290/360 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U X(X((p1 U p2)))))))'
Stuttering acceptance computed with spot in 370 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-08
Stuttering criterion allowed to conclude after 116 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-08 finished in 40043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 360/360 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 360
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 139 transition count 340
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 139 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 139 transition count 338
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 132 transition count 320
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 132 transition count 320
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 41 place count 125 transition count 304
Iterating global reduction 2 with 7 rules applied. Total rules applied 48 place count 125 transition count 304
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 120 transition count 288
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 115 transition count 276
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 115 transition count 276
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 71 place count 112 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 112 transition count 270
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 109 transition count 264
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 107 transition count 260
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 107 transition count 260
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 105 transition count 256
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 104 transition count 254
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 104 transition count 254
Applied a total of 90 rules in 15 ms. Remains 104 /149 variables (removed 45) and now considering 254/360 (removed 106) transitions.
[2026-05-25 00:14:39] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12687699702822303909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9932084196685562088.kers'
[2026-05-25 00:14:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12687699702822303909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9932084196685562088.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 104 cols 476 entries
Finished phase 1 with 101 SingleSign rule and 1 generalized
[2026-05-25 00:14:39] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9932084196685562088.kers
Total runtime 1 ms.
[2026-05-25 00:14:39] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 00:14:39] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2026-05-25 00:14:39] [INFO ] Invariant cache hit.
[2026-05-25 00:14:39] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 00:14:39] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-25 00:14:39] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2026-05-25 00:14:39] [INFO ] Invariant cache hit.
[2026-05-25 00:14:39] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/276 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 146 constraints, problems are : Problem set: 0 solved, 252 unsolved in 6960 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/276 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 252/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 8/406 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 406 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 37035ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 37037ms
Starting structural reductions in LTL mode, iteration 1 : 104/149 places, 254/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37424 ms. Remains : 104/149 places, 254/360 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-12 finished in 37558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0))&&F((!p0&&(p1 U p2)))) U X(p3)))'
Support contains 5 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 360/360 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 148 transition count 360
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 142 transition count 346
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 142 transition count 346
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 142 transition count 344
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 20 place count 137 transition count 332
Iterating global reduction 2 with 5 rules applied. Total rules applied 25 place count 137 transition count 332
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 30 place count 132 transition count 320
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 132 transition count 320
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 38 place count 129 transition count 308
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 129 transition count 308
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 126 transition count 300
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 126 transition count 300
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 123 transition count 292
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 123 transition count 292
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 120 transition count 284
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 120 transition count 284
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 117 transition count 278
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 117 transition count 278
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 114 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 114 transition count 272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 112 transition count 268
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 112 transition count 268
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 111 transition count 266
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 111 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 110 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 110 transition count 264
Applied a total of 79 rules in 16 ms. Remains 110 /149 variables (removed 39) and now considering 264/360 (removed 96) transitions.
[2026-05-25 00:15:16] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2724261238536763007.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11594861116113681232.kers'
[2026-05-25 00:15:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2724261238536763007.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11594861116113681232.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 110 cols 512 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-25 00:15:16] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11594861116113681232.kers
Total runtime 1 ms.
[2026-05-25 00:15:16] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 00:15:16] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2026-05-25 00:15:16] [INFO ] Invariant cache hit.
[2026-05-25 00:15:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 00:15:17] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2026-05-25 00:15:17] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2026-05-25 00:15:17] [INFO ] Invariant cache hit.
[2026-05-25 00:15:17] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 181/291 variables, 110/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 156 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 181/291 variables, 110/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 262/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 8/426 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 426 constraints, problems are : Problem set: 0 solved, 262 unsolved in 28214 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 35307ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 35308ms
Starting structural reductions in LTL mode, iteration 1 : 110/149 places, 264/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35698 ms. Remains : 110/149 places, 264/360 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0))&&F((!p0&&(p1 U p2)))) U X(p3)))'
Stuttering acceptance computed with spot in 324 ms :[(NOT p3), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p2) p0), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-14
Stuttering criterion allowed to conclude after 289 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-14 finished in 36089 ms.
All properties solved by simple procedures.
Total runtime 411449 ms.

BK_STOP 1779668152784

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="FunctionPointer-PT-b002"
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-5973"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b002, 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 r146-tall-177961073900059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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