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-177961073900075.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-b008, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961073900075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.3K Mar 7 07:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 07:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 07:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 07:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 7 07:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 7 07:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 7 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Mar 7 07:29 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-b008-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779671445066

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-b008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 01:10:46] [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 01:10:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 01:10:46] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2026-05-25 01:10:46] [INFO ] Transformed 306 places.
[2026-05-25 01:10:46] [INFO ] Transformed 840 transitions.
[2026-05-25 01:10:46] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 205 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 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b008-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-15 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 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 33 place count 189 transition count 510
Iterating global reduction 1 with 23 rules applied. Total rules applied 56 place count 189 transition count 510
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 92 place count 189 transition count 474
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 104 place count 177 transition count 450
Iterating global reduction 2 with 12 rules applied. Total rules applied 116 place count 177 transition count 450
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 124 place count 177 transition count 442
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 128 place count 173 transition count 434
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 173 transition count 434
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 170 transition count 422
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 170 transition count 422
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 168 transition count 418
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 168 transition count 418
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 167 transition count 414
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 167 transition count 414
Applied a total of 144 rules in 75 ms. Remains 167 /222 variables (removed 55) and now considering 414/648 (removed 234) transitions.
[2026-05-25 01:10:46] [INFO ] Flow matrix only has 286 transitions (discarded 128 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-178334210987876387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7807236508441603837.kers'
[2026-05-25 01:10:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-178334210987876387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7807236508441603837.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 286 rows 167 cols 798 entries
Finished phase 1 with 164 SingleSign rule and 1 generalized
[2026-05-25 01:10:46] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7807236508441603837.kers
Total runtime 2 ms.
[2026-05-25 01:10:46] [INFO ] Implicit Places using invariants in 259 ms returned []
[2026-05-25 01:10:46] [INFO ] Flow matrix only has 286 transitions (discarded 128 similar events)
[2026-05-25 01:10:46] [INFO ] Invariant cache hit.
[2026-05-25 01:10:46] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-25 01:10:47] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2026-05-25 01:10:47] [INFO ] Flow matrix only has 286 transitions (discarded 128 similar events)
[2026-05-25 01:10:47] [INFO ] Invariant cache hit.
[2026-05-25 01:10:47] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (OVERLAPS) 286/453 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 61/230 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/453 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 230 constraints, problems are : Problem set: 0 solved, 412 unsolved in 16245 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (OVERLAPS) 286/453 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 61/230 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 412/642 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 4/646 constraints. Problems are: Problem set: 0 solved, 412 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 453/453 variables, and 646 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 46639ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 46652ms
Starting structural reductions in LTL mode, iteration 1 : 167/222 places, 414/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47535 ms. Remains : 167/222 places, 414/648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 414/414 transitions.
Applied a total of 0 rules in 3 ms. Remains 167 /167 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2026-05-25 01:11:34] [INFO ] Flow matrix only has 286 transitions (discarded 128 similar events)
[2026-05-25 01:11:34] [INFO ] Invariant cache hit.
[2026-05-25 01:11:34] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 01:11:34] [INFO ] Flow matrix only has 286 transitions (discarded 128 similar events)
[2026-05-25 01:11:34] [INFO ] Invariant cache hit.
[2026-05-25 01:11:34] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-25 01:11:34] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 167/167 places, 414/414 transitions.
Support contains 28 out of 167 places after structural reductions.
[2026-05-25 01:11:34] [INFO ] Flatten gal took : 47 ms
[2026-05-25 01:11:34] [INFO ] Flatten gal took : 23 ms
[2026-05-25 01:11:34] [INFO ] Input system was already deterministic with 414 transitions.
RANDOM walk for 40005 steps (51 resets) in 1112 ms. (35 steps per ms) remains 2/20 properties
BEST_FIRST walk for 40004 steps (14 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (11 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
[2026-05-25 01:11:35] [INFO ] Flow matrix only has 286 transitions (discarded 128 similar events)
[2026-05-25 01:11:35] [INFO ] Invariant cache hit.
[2026-05-25 01:11:35] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 60/86 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 147/233 variables, 22/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 420/453 variables, and 155 constraints, problems are : Problem set: 2 solved, 0 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/167 constraints, ReadFeed: 12/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA FunctionPointer-PT-b008-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
Computed a total of 24 stabilizing places and 64 stable transitions
FORMULA FunctionPointer-PT-b008-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(p1))))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 414/414 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 159 transition count 394
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 159 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 159 transition count 392
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 152 transition count 376
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 152 transition count 376
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 145 transition count 356
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 145 transition count 356
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 138 transition count 332
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 138 transition count 332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 67 place count 131 transition count 318
Iterating global reduction 1 with 7 rules applied. Total rules applied 74 place count 131 transition count 318
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 81 place count 124 transition count 298
Iterating global reduction 1 with 7 rules applied. Total rules applied 88 place count 124 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 118 transition count 280
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 118 transition count 280
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 106 place count 112 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 112 place count 112 transition count 268
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 116 place count 108 transition count 260
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 108 transition count 260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 106 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 106 transition count 256
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 104 transition count 252
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 104 transition count 252
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 102 transition count 248
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 102 transition count 248
Applied a total of 132 rules in 19 ms. Remains 102 /167 variables (removed 65) and now considering 248/414 (removed 166) transitions.
[2026-05-25 01:11:35] [INFO ] Flow matrix only has 168 transitions (discarded 80 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16113878425070131332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5000845910431649743.kers'
[2026-05-25 01:11:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16113878425070131332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5000845910431649743.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 168 rows 102 cols 464 entries
Finished phase 1 with 99 SingleSign rule and 1 generalized
[2026-05-25 01:11:35] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5000845910431649743.kers
Total runtime 1 ms.
[2026-05-25 01:11:35] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 01:11:35] [INFO ] Flow matrix only has 168 transitions (discarded 80 similar events)
[2026-05-25 01:11:35] [INFO ] Invariant cache hit.
[2026-05-25 01:11:35] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 01:11:35] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2026-05-25 01:11:35] [INFO ] Flow matrix only has 168 transitions (discarded 80 similar events)
[2026-05-25 01:11:35] [INFO ] Invariant cache hit.
[2026-05-25 01:11:35] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 168/270 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 246 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 144 constraints, problems are : Problem set: 0 solved, 246 unsolved in 6274 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 168/270 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 246/390 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 394 constraints, problems are : Problem set: 0 solved, 246 unsolved in 26524 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 32871ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 32872ms
Starting structural reductions in LTL mode, iteration 1 : 102/167 places, 248/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33206 ms. Remains : 102/167 places, 248/414 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(p1)&&p0)))'
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b008-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLCardinality-02 finished in 33568 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((F(p0)&&X((X(p1) U ((p1&&X(p1))||X(G(p1))))))))))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 414/414 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 158 transition count 392
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 158 transition count 392
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 158 transition count 388
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 151 transition count 372
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 151 transition count 372
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 144 transition count 352
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 138 transition count 332
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 138 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 132 transition count 320
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 132 transition count 320
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 126 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 126 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 121 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 116 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 116 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 112 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 112 transition count 272
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 110 transition count 268
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 108 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 108 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 106 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 106 transition count 260
Applied a total of 126 rules in 24 ms. Remains 106 /167 variables (removed 61) and now considering 260/414 (removed 154) transitions.
[2026-05-25 01:12:09] [INFO ] Flow matrix only has 176 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-15919295692540447831.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6077961732052604876.kers'
[2026-05-25 01:12:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15919295692540447831.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6077961732052604876.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 106 cols 488 entries
Finished phase 1 with 103 SingleSign rule and 1 generalized
[2026-05-25 01:12:09] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6077961732052604876.kers
Total runtime 1 ms.
[2026-05-25 01:12:09] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 01:12:09] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2026-05-25 01:12:09] [INFO ] Invariant cache hit.
[2026-05-25 01:12:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 01:12:09] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2026-05-25 01:12:09] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2026-05-25 01:12:09] [INFO ] Invariant cache hit.
[2026-05-25 01:12:09] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 176/282 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 148 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6553 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 176/282 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 258/406 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 409 constraints, problems are : Problem set: 0 solved, 258 unsolved in 26019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 32638ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 32639ms
Starting structural reductions in LTL mode, iteration 1 : 106/167 places, 260/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32986 ms. Remains : 106/167 places, 260/414 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((F(p0)&&X((X(p1) U ((p1&&X(p1))||X(G(p1))))))))))'
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-04
Product exploration explored 100000 steps with 16666 reset in 240 ms.
Product exploration explored 100000 steps with 16666 reset in 167 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 1 factoid took 55 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 13022 steps (8 resets) in 37 ms. (342 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 384 ms.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 260/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2026-05-25 01:12:43] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2026-05-25 01:12:43] [INFO ] Invariant cache hit.
[2026-05-25 01:12:43] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 01:12:43] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2026-05-25 01:12:43] [INFO ] Invariant cache hit.
[2026-05-25 01:12:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 01:12:43] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 106/106 places, 260/260 transitions.
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 1 factoid took 57 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 10149 steps (15 resets) in 26 ms. (375 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 59 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 413 ms.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 16666 reset in 129 ms.
Product exploration explored 100000 steps with 16666 reset in 133 ms.
Spot run failed in 72 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin7497999151737436879
[2026-05-25 01:12:45] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7497999151737436879
Running compilation step : cd /tmp/ltsmin7497999151737436879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 472 ms.
Running link step : cd /tmp/ltsmin7497999151737436879;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin7497999151737436879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased5784742878051195677.hoa' '--buchi-type=spotba'
LTSmin run took 40 ms.
FORMULA FunctionPointer-PT-b008-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-b008-LTLCardinality-04 finished in 36739 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 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 414/414 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 159 transition count 394
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 159 transition count 394
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 159 transition count 390
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 153 transition count 376
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 153 transition count 376
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 147 transition count 360
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 147 transition count 360
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 141 transition count 340
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 141 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 135 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 135 transition count 328
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 130 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 130 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 126 transition count 298
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 126 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 122 transition count 290
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 122 transition count 290
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 97 place count 119 transition count 284
Iterating global reduction 1 with 3 rules applied. Total rules applied 100 place count 119 transition count 284
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 116 transition count 278
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 116 transition count 278
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 113 transition count 272
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 113 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 115 place count 110 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 118 place count 110 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 122 place count 110 transition count 262
Applied a total of 122 rules in 70 ms. Remains 110 /167 variables (removed 57) and now considering 262/414 (removed 152) transitions.
[2026-05-25 01:12:45] [INFO ] Flow matrix only has 179 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-7591800644931648416.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4006504608969751110.kers'
[2026-05-25 01:12:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7591800644931648416.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4006504608969751110.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 110 cols 496 entries
Finished phase 1 with 107 SingleSign rule and 1 generalized
[2026-05-25 01:12:45] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4006504608969751110.kers
Total runtime 4 ms.
[2026-05-25 01:12:46] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 01:12:46] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2026-05-25 01:12:46] [INFO ] Invariant cache hit.
[2026-05-25 01:12:46] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 01:12:46] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2026-05-25 01:12:46] [INFO ] Redundant transitions in 10 ms returned []
Running 260 sub problems to find dead transitions.
[2026-05-25 01:12:46] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2026-05-25 01:12:46] [INFO ] Invariant cache hit.
[2026-05-25 01:12:46] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/289 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 43/155 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 155 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6916 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/289 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 43/155 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 260/415 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/289 variables, and 417 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 37007ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 37008ms
Starting structural reductions in SI_LTL mode, iteration 1 : 110/167 places, 262/414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37485 ms. Remains : 110/167 places, 262/414 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 37 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-05
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b008-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLCardinality-05 finished in 37547 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||(p1&&G(p2))))))'
Support contains 6 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 414/414 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 160 transition count 396
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 160 transition count 396
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 160 transition count 392
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 155 transition count 382
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 155 transition count 382
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 150 transition count 368
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 150 transition count 368
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 146 transition count 352
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 146 transition count 352
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 142 transition count 344
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 142 transition count 344
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 138 transition count 332
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 138 transition count 332
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 135 transition count 324
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 135 transition count 324
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 132 transition count 318
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 132 transition count 318
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 129 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 129 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 128 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 128 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 127 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 127 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 126 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 126 transition count 306
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 92 place count 126 transition count 300
Applied a total of 92 rules in 50 ms. Remains 126 /167 variables (removed 41) and now considering 300/414 (removed 114) transitions.
[2026-05-25 01:13:23] [INFO ] Flow matrix only has 209 transitions (discarded 91 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16515079561142533674.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16723007360286994016.kers'
[2026-05-25 01:13:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16515079561142533674.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16723007360286994016.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 209 rows 126 cols 586 entries
Finished phase 1 with 123 SingleSign rule and 1 generalized
[2026-05-25 01:13:23] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16723007360286994016.kers
Total runtime 1 ms.
[2026-05-25 01:13:23] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-25 01:13:23] [INFO ] Flow matrix only has 209 transitions (discarded 91 similar events)
[2026-05-25 01:13:23] [INFO ] Invariant cache hit.
[2026-05-25 01:13:23] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-25 01:13:23] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2026-05-25 01:13:23] [INFO ] Redundant transitions in 9 ms returned []
Running 298 sub problems to find dead transitions.
[2026-05-25 01:13:23] [INFO ] Flow matrix only has 209 transitions (discarded 91 similar events)
[2026-05-25 01:13:23] [INFO ] Invariant cache hit.
[2026-05-25 01:13:23] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (OVERLAPS) 209/335 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 49/177 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 298 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/335 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 177 constraints, problems are : Problem set: 0 solved, 298 unsolved in 8839 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (OVERLAPS) 209/335 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 49/177 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 298/475 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 479 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 38923ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 38924ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/167 places, 300/414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39391 ms. Remains : 126/167 places, 300/414 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||(p1&&G(p2))))))'
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-08
Stuttering criterion allowed to conclude after 353 steps with 0 reset in 6 ms.
FORMULA FunctionPointer-PT-b008-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLCardinality-08 finished in 39549 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 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 414/414 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 158 transition count 392
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 158 transition count 392
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 158 transition count 388
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 151 transition count 372
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 151 transition count 372
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 144 transition count 352
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 144 transition count 352
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 137 transition count 328
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 137 transition count 328
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 130 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 130 transition count 314
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 123 transition count 294
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 123 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 117 transition count 276
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 117 transition count 276
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 111 transition count 264
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 111 transition count 264
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 121 place count 106 transition count 254
Iterating global reduction 1 with 5 rules applied. Total rules applied 126 place count 106 transition count 254
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 103 transition count 248
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 103 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 135 place count 100 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 138 place count 100 transition count 242
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 141 place count 97 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 144 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 146 place count 97 transition count 234
Applied a total of 146 rules in 39 ms. Remains 97 /167 variables (removed 70) and now considering 234/414 (removed 180) transitions.
[2026-05-25 01:14:03] [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-6394752995913960771.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8701829283233794787.kers'
[2026-05-25 01:14:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6394752995913960771.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8701829283233794787.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 01:14:03] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8701829283233794787.kers
Total runtime 0 ms.
[2026-05-25 01:14:03] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 01:14:03] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2026-05-25 01:14:03] [INFO ] Invariant cache hit.
[2026-05-25 01:14:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 01:14:03] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2026-05-25 01:14:03] [INFO ] Redundant transitions in 4 ms returned []
Running 232 sub problems to find dead transitions.
[2026-05-25 01:14:03] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2026-05-25 01:14:03] [INFO ] Invariant cache hit.
[2026-05-25 01:14:03] [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 5572 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, 5/373 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 0/255 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 373 constraints, problems are : Problem set: 0 solved, 232 unsolved in 24046 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: 5/5 constraints]
After SMT, in 29673ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 29673ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/167 places, 234/414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29976 ms. Remains : 97/167 places, 234/414 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 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-09
Stuttering criterion allowed to conclude after 795 steps with 3 reset in 3 ms.
FORMULA FunctionPointer-PT-b008-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLCardinality-09 finished in 30078 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((((p0 U X(X(p1))) U p2)&&F((p3&&X(G(p4)))))))'
Support contains 7 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 414/414 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 161 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 161 transition count 400
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 161 transition count 398
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 156 transition count 386
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 156 transition count 386
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 151 transition count 372
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 151 transition count 372
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 147 transition count 360
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 147 transition count 360
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 143 transition count 352
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 143 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 140 transition count 344
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 140 transition count 344
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 137 transition count 336
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 137 transition count 336
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 134 transition count 330
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 134 transition count 330
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 132 transition count 326
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 132 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 131 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 131 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 130 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 130 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 129 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 129 transition count 320
Applied a total of 78 rules in 22 ms. Remains 129 /167 variables (removed 38) and now considering 320/414 (removed 94) transitions.
[2026-05-25 01:14:33] [INFO ] Flow matrix only has 220 transitions (discarded 100 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5360346044149888434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5874529363797876128.kers'
[2026-05-25 01:14:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5360346044149888434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5874529363797876128.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 220 rows 129 cols 612 entries
Finished phase 1 with 126 SingleSign rule and 1 generalized
[2026-05-25 01:14:33] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5874529363797876128.kers
Total runtime 2 ms.
[2026-05-25 01:14:33] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 01:14:33] [INFO ] Flow matrix only has 220 transitions (discarded 100 similar events)
[2026-05-25 01:14:33] [INFO ] Invariant cache hit.
[2026-05-25 01:14:33] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-25 01:14:33] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 318 sub problems to find dead transitions.
[2026-05-25 01:14:33] [INFO ] Flow matrix only has 220 transitions (discarded 100 similar events)
[2026-05-25 01:14:33] [INFO ] Invariant cache hit.
[2026-05-25 01:14:33] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (OVERLAPS) 220/349 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 49/180 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 318 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/349 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 180 constraints, problems are : Problem set: 0 solved, 318 unsolved in 9542 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (OVERLAPS) 220/349 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 49/180 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 318/498 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 3/501 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (OVERLAPS) 0/349 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 501 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 39652ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 39654ms
Starting structural reductions in LTL mode, iteration 1 : 129/167 places, 320/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40043 ms. Remains : 129/167 places, 320/414 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((((p0 U X(X(p1))) U p2)&&F((p3&&X(G(p4)))))))'
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p3) (NOT p4) (NOT p2)), (NOT p1), (NOT p2), (OR (NOT p3) (NOT p4)), (NOT p4), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-11
Stuttering criterion allowed to conclude after 133 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b008-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLCardinality-11 finished in 40507 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(G(p0))||(!p0&&X(!p0)))))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 414/414 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 158 transition count 392
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 158 transition count 392
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 158 transition count 388
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 151 transition count 372
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 151 transition count 372
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 144 transition count 352
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 144 transition count 352
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 137 transition count 328
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 137 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 131 transition count 316
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 131 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 126 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 126 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 121 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 121 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 116 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 116 transition count 274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 112 transition count 266
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 112 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 109 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 109 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 106 transition count 254
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 106 transition count 254
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 103 transition count 248
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 103 transition count 248
Applied a total of 132 rules in 18 ms. Remains 103 /167 variables (removed 64) and now considering 248/414 (removed 166) transitions.
[2026-05-25 01:15:13] [INFO ] Flow matrix only has 171 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-6841065971098415552.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12781031892584389731.kers'
[2026-05-25 01:15:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6841065971098415552.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12781031892584389731.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 103 cols 476 entries
Finished phase 1 with 100 SingleSign rule and 1 generalized
[2026-05-25 01:15:13] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12781031892584389731.kers
Total runtime 1 ms.
[2026-05-25 01:15:13] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 01:15:13] [INFO ] Flow matrix only has 171 transitions (discarded 77 similar events)
[2026-05-25 01:15:13] [INFO ] Invariant cache hit.
[2026-05-25 01:15:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-25 01:15:13] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2026-05-25 01:15:13] [INFO ] Flow matrix only has 171 transitions (discarded 77 similar events)
[2026-05-25 01:15:13] [INFO ] Invariant cache hit.
[2026-05-25 01:15:13] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 171/274 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 42/147 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 246 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/274 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 147 constraints, problems are : Problem set: 0 solved, 246 unsolved in 6460 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 171/274 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 42/147 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 246/393 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 4/397 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 398 constraints, problems are : Problem set: 0 solved, 246 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 36521ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 36523ms
Starting structural reductions in LTL mode, iteration 1 : 103/167 places, 248/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36853 ms. Remains : 103/167 places, 248/414 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(G(p0))||(!p0&&X(!p0)))))'
Stuttering acceptance computed with spot in 170 ms :[false, false, (NOT p0), false]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 118 ms.
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 17 ms. Proved property starting from automaton with 4 states, 6 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 23 ms.
FORMULA FunctionPointer-PT-b008-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b008-LTLCardinality-13 finished in 37329 ms.
All properties solved by simple procedures.
Total runtime 304776 ms.

BK_STOP 1779671750956

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

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