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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 6.3K Mar 7 07:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 7 07:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 07:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 07:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 07:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Mar 7 07:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 7 07:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 07:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:24 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-b032-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779675460131

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-b032
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 02:17:41] [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 02:17:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 02:17:41] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2026-05-25 02:17:41] [INFO ] Transformed 306 places.
[2026-05-25 02:17:41] [INFO ] Transformed 840 transitions.
[2026-05-25 02:17:41] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b032-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 34 place count 188 transition count 496
Iterating global reduction 1 with 24 rules applied. Total rules applied 58 place count 188 transition count 496
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 80 place count 188 transition count 474
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 93 place count 175 transition count 448
Iterating global reduction 2 with 13 rules applied. Total rules applied 106 place count 175 transition count 448
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 110 place count 175 transition count 444
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 171 transition count 436
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 171 transition count 436
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 122 place count 167 transition count 420
Iterating global reduction 3 with 4 rules applied. Total rules applied 126 place count 167 transition count 420
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 165 transition count 416
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 165 transition count 416
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 163 transition count 408
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 163 transition count 408
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 162 transition count 404
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 162 transition count 404
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 161 transition count 402
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 161 transition count 402
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 139 place count 160 transition count 400
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 160 transition count 400
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 159 transition count 398
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 159 transition count 398
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 158 transition count 396
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 158 transition count 396
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 157 transition count 394
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 157 transition count 394
Applied a total of 146 rules in 110 ms. Remains 157 /222 variables (removed 65) and now considering 394/648 (removed 254) transitions.
[2026-05-25 02:17:41] [INFO ] Flow matrix only has 268 transitions (discarded 126 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12642109934323952881.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2078030541457185178.kers'
[2026-05-25 02:17:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12642109934323952881.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2078030541457185178.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 157 cols 742 entries
Finished phase 1 with 154 SingleSign rule and 1 generalized
[2026-05-25 02:17:41] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2078030541457185178.kers
Total runtime 1 ms.
[2026-05-25 02:17:42] [INFO ] Implicit Places using invariants in 298 ms returned []
[2026-05-25 02:17:42] [INFO ] Flow matrix only has 268 transitions (discarded 126 similar events)
[2026-05-25 02:17:42] [INFO ] Invariant cache hit.
[2026-05-25 02:17:42] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-25 02:17:42] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2026-05-25 02:17:42] [INFO ] Flow matrix only has 268 transitions (discarded 126 similar events)
[2026-05-25 02:17:42] [INFO ] Invariant cache hit.
[2026-05-25 02:17:42] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 268/425 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 57/216 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 392 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/425 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 216 constraints, problems are : Problem set: 0 solved, 392 unsolved in 13989 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 268/425 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 57/216 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 392/608 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 608 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44367ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 44384ms
Starting structural reductions in LTL mode, iteration 1 : 157/222 places, 394/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45275 ms. Remains : 157/222 places, 394/648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 394/394 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-25 02:18:26] [INFO ] Flow matrix only has 268 transitions (discarded 126 similar events)
[2026-05-25 02:18:26] [INFO ] Invariant cache hit.
[2026-05-25 02:18:27] [INFO ] Implicit Places using invariants in 237 ms returned []
[2026-05-25 02:18:27] [INFO ] Flow matrix only has 268 transitions (discarded 126 similar events)
[2026-05-25 02:18:27] [INFO ] Invariant cache hit.
[2026-05-25 02:18:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-25 02:18:27] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 642 ms. Remains : 157/157 places, 394/394 transitions.
Support contains 24 out of 157 places after structural reductions.
[2026-05-25 02:18:27] [INFO ] Flatten gal took : 47 ms
[2026-05-25 02:18:27] [INFO ] Flatten gal took : 25 ms
[2026-05-25 02:18:27] [INFO ] Input system was already deterministic with 394 transitions.
RANDOM walk for 40037 steps (34 resets) in 652 ms. (61 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40004 steps (20 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2026-05-25 02:18:28] [INFO ] Flow matrix only has 268 transitions (discarded 126 similar events)
[2026-05-25 02:18:28] [INFO ] Invariant cache hit.
[2026-05-25 02:18:28] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/68 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 138/206 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 388/425 variables, and 142 constraints, problems are : Problem set: 1 solved, 0 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/157 constraints, ReadFeed: 10/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 158ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA FunctionPointer-PT-b032-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA FunctionPointer-PT-b032-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 64 stable 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))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 394/394 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 146 transition count 370
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 146 transition count 370
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 146 transition count 360
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 141 transition count 344
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 141 transition count 344
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 136 transition count 328
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 136 transition count 328
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 131 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 131 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 126 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 126 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 121 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 121 transition count 290
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 117 transition count 282
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 117 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 113 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 113 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 111 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 111 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 109 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 108 transition count 264
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 112 place count 108 transition count 260
Applied a total of 112 rules in 77 ms. Remains 108 /157 variables (removed 49) and now considering 260/394 (removed 134) transitions.
[2026-05-25 02:18:28] [INFO ] Flow matrix only has 177 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-5574847607789383520.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3946300782700667864.kers'
[2026-05-25 02:18:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5574847607789383520.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3946300782700667864.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 177 rows 108 cols 494 entries
Finished phase 1 with 105 SingleSign rule and 1 generalized
[2026-05-25 02:18:28] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3946300782700667864.kers
Total runtime 1 ms.
[2026-05-25 02:18:28] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-25 02:18:28] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2026-05-25 02:18:28] [INFO ] Invariant cache hit.
[2026-05-25 02:18:28] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-25 02:18:28] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2026-05-25 02:18:28] [INFO ] Redundant transitions in 10 ms returned []
Running 258 sub problems to find dead transitions.
[2026-05-25 02:18:28] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2026-05-25 02:18:28] [INFO ] Invariant cache hit.
[2026-05-25 02:18:28] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 177/285 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 151 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6466 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 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/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 177/285 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 258/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 409 constraints, problems are : Problem set: 0 solved, 258 unsolved in 27659 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34217ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 34219ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/157 places, 260/394 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34654 ms. Remains : 108/157 places, 260/394 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 153 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-00
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-00 finished in 34884 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(G(p0)))'
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 394/394 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 146 transition count 370
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 146 transition count 370
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 146 transition count 360
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 141 transition count 346
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 141 transition count 346
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 136 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 136 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 131 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 131 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 126 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 126 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 121 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 121 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 117 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 117 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 113 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 113 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 110 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 110 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 107 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 107 transition count 260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 105 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 105 transition count 256
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 118 place count 105 transition count 252
Applied a total of 118 rules in 84 ms. Remains 105 /157 variables (removed 52) and now considering 252/394 (removed 142) transitions.
[2026-05-25 02:19:03] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13485756929424884374.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11882197522960200251.kers'
[2026-05-25 02:19:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13485756929424884374.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11882197522960200251.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 105 cols 474 entries
Finished phase 1 with 102 SingleSign rule and 1 generalized
[2026-05-25 02:19:03] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11882197522960200251.kers
Total runtime 1 ms.
[2026-05-25 02:19:03] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 02:19:03] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2026-05-25 02:19:03] [INFO ] Invariant cache hit.
[2026-05-25 02:19:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 02:19:03] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2026-05-25 02:19:03] [INFO ] Redundant transitions in 4 ms returned []
Running 250 sub problems to find dead transitions.
[2026-05-25 02:19:03] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2026-05-25 02:19:03] [INFO ] Invariant cache hit.
[2026-05-25 02:19:03] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 147 constraints, problems are : Problem set: 0 solved, 250 unsolved in 6222 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 250/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 398 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36286ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 36287ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/157 places, 252/394 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36666 ms. Remains : 105/157 places, 252/394 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(G(p0)))'
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-04
Stuttering criterion allowed to conclude after 2012 steps with 12 reset in 12 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-04 finished in 36769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(F((p0&&F(p1)))))) U X(!p0))))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 394/394 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 147 transition count 372
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 147 transition count 372
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 147 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 141 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 141 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 135 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 135 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 129 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 129 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 123 transition count 296
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 123 transition count 296
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 117 transition count 280
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 117 transition count 280
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 112 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 112 transition count 270
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 107 transition count 260
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 107 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 104 transition count 254
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 104 transition count 254
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 115 place count 101 transition count 248
Iterating global reduction 1 with 3 rules applied. Total rules applied 118 place count 101 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 100 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 100 transition count 246
Applied a total of 120 rules in 39 ms. Remains 100 /157 variables (removed 57) and now considering 246/394 (removed 148) transitions.
[2026-05-25 02:19:40] [INFO ] Flow matrix only has 166 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-13818091232202953600.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12314872917025855843.kers'
[2026-05-25 02:19:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13818091232202953600.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12314872917025855843.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 166 rows 100 cols 456 entries
Finished phase 1 with 97 SingleSign rule and 1 generalized
[2026-05-25 02:19:40] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12314872917025855843.kers
Total runtime 1 ms.
[2026-05-25 02:19:40] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 02:19:40] [INFO ] Flow matrix only has 166 transitions (discarded 80 similar events)
[2026-05-25 02:19:40] [INFO ] Invariant cache hit.
[2026-05-25 02:19:40] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 02:19:40] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 244 sub problems to find dead transitions.
[2026-05-25 02:19:40] [INFO ] Flow matrix only has 166 transitions (discarded 80 similar events)
[2026-05-25 02:19:40] [INFO ] Invariant cache hit.
[2026-05-25 02:19:40] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 166/266 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 39/141 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/266 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 141 constraints, problems are : Problem set: 0 solved, 244 unsolved in 6147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 166/266 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 39/141 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 244/385 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 385 constraints, problems are : Problem set: 0 solved, 244 unsolved in 20945 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27145ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 27146ms
Starting structural reductions in LTL mode, iteration 1 : 100/157 places, 246/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27534 ms. Remains : 100/157 places, 246/394 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(F((p0&&F(p1)))))) U X(!p0))))'
Stuttering acceptance computed with spot in 287 ms :[p0, p0, p0, (AND (NOT p1) p0), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-05
Stuttering criterion allowed to conclude after 403 steps with 3 reset in 5 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-05 finished in 27878 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' '!((p0 U X(X(X((F(p1) U X(X(p2))))))))'
Support contains 7 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 394/394 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 150 transition count 378
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 150 transition count 378
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 22 place count 150 transition count 370
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 147 transition count 362
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 147 transition count 362
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 144 transition count 352
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 144 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 141 transition count 346
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 141 transition count 346
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 138 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 138 transition count 338
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 135 transition count 330
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 135 transition count 330
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 133 transition count 326
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 133 transition count 326
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 131 transition count 322
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 131 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 130 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 130 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 129 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 129 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 128 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 128 transition count 316
Applied a total of 66 rules in 40 ms. Remains 128 /157 variables (removed 29) and now considering 316/394 (removed 78) transitions.
[2026-05-25 02:20:08] [INFO ] Flow matrix only has 215 transitions (discarded 101 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5748239273546671859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8044767861443325636.kers'
[2026-05-25 02:20:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5748239273546671859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8044767861443325636.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 215 rows 128 cols 598 entries
Finished phase 1 with 125 SingleSign rule and 1 generalized
[2026-05-25 02:20:08] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8044767861443325636.kers
Total runtime 1 ms.
[2026-05-25 02:20:08] [INFO ] Implicit Places using invariants in 337 ms returned []
[2026-05-25 02:20:08] [INFO ] Flow matrix only has 215 transitions (discarded 101 similar events)
[2026-05-25 02:20:08] [INFO ] Invariant cache hit.
[2026-05-25 02:20:08] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-05-25 02:20:08] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2026-05-25 02:20:08] [INFO ] Flow matrix only has 215 transitions (discarded 101 similar events)
[2026-05-25 02:20:08] [INFO ] Invariant cache hit.
[2026-05-25 02:20:08] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 215/343 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 47/177 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 314 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/343 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 177 constraints, problems are : Problem set: 0 solved, 314 unsolved in 9962 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 215/343 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 47/177 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 314/491 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 0/343 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 491 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40081ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 40082ms
Starting structural reductions in LTL mode, iteration 1 : 128/157 places, 316/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40755 ms. Remains : 128/157 places, 316/394 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' '!((p0 U X(X(X((F(p1) U X(X(p2))))))))'
Stuttering acceptance computed with spot in 815 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-08
Product exploration explored 100000 steps with 16666 reset in 231 ms.
Product exploration explored 100000 steps with 16666 reset in 255 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 3 factoid took 63 ms. Reduced automaton from 22 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 13 edges and 2 AP (stutter sensitive).
RANDOM walk for 33685 steps (22 resets) in 379 ms. (88 steps per ms) remains 0/3 properties
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 10 states, 13 edges and 2 AP (stutter sensitive) to 10 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Knowledge-based reduction took 697 ms.
Stuttering acceptance computed with spot in 405 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 4 out of 128 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 316/316 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2026-05-25 02:20:51] [INFO ] Flow matrix only has 215 transitions (discarded 101 similar events)
[2026-05-25 02:20:51] [INFO ] Invariant cache hit.
[2026-05-25 02:20:51] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 02:20:51] [INFO ] Flow matrix only has 215 transitions (discarded 101 similar events)
[2026-05-25 02:20:51] [INFO ] Invariant cache hit.
[2026-05-25 02:20:51] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-05-25 02:20:51] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 385 ms. Remains : 128/128 places, 316/316 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 48 ms. Reduced automaton from 10 states, 13 edges and 2 AP (stutter sensitive) to 10 states, 13 edges and 2 AP (stutter sensitive).
RANDOM walk for 32279 steps (26 resets) in 368 ms. (87 steps per ms) remains 0/3 properties
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 10 states, 13 edges and 2 AP (stutter sensitive) to 10 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Knowledge-based reduction took 584 ms.
Stuttering acceptance computed with spot in 320 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 392 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 16666 reset in 218 ms.
Product exploration explored 100000 steps with 16666 reset in 179 ms.
Spot run failed in 69 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/ltsmin12731803588856527261
[2026-05-25 02:20:53] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12731803588856527261
Running compilation step : cd /tmp/ltsmin12731803588856527261;'/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 563 ms.
Running link step : cd /tmp/ltsmin12731803588856527261;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin12731803588856527261;'/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/stateBased10880935951250472608.hoa' '--buchi-type=spotba'
LTSmin run took 43 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-b032-LTLCardinality-08 finished in 46092 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((p1||X(X(G(p2)))))))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 394/394 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 146 transition count 370
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 146 transition count 370
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 30 place count 146 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 140 transition count 344
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 140 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 134 transition count 324
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 134 transition count 324
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 128 transition count 310
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 128 transition count 310
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 122 transition count 292
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 122 transition count 292
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 116 transition count 276
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 116 transition count 276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 111 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 111 transition count 266
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 106 transition count 256
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 106 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 103 transition count 250
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 103 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 100 transition count 244
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 99 transition count 242
Applied a total of 124 rules in 22 ms. Remains 99 /157 variables (removed 58) and now considering 242/394 (removed 152) transitions.
[2026-05-25 02:20:54] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6905452744707259852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3639470674145824517.kers'
[2026-05-25 02:20:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6905452744707259852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3639470674145824517.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 99 cols 452 entries
Finished phase 1 with 96 SingleSign rule and 1 generalized
[2026-05-25 02:20:54] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3639470674145824517.kers
Total runtime 0 ms.
[2026-05-25 02:20:54] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 02:20:54] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2026-05-25 02:20:54] [INFO ] Invariant cache hit.
[2026-05-25 02:20:54] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 02:20:54] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2026-05-25 02:20:54] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2026-05-25 02:20:54] [INFO ] Invariant cache hit.
[2026-05-25 02:20:54] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 164/263 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 140 constraints, problems are : Problem set: 0 solved, 240 unsolved in 5859 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 164/263 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 240/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 0/263 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 380 constraints, problems are : Problem set: 0 solved, 240 unsolved in 21859 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27762ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 27763ms
Starting structural reductions in LTL mode, iteration 1 : 99/157 places, 242/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28078 ms. Remains : 99/157 places, 242/394 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((p1||X(X(G(p2)))))))'
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 113 steps with 1 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-10 finished in 28434 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||F(p1)))) U !p1)))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 394/394 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 146 transition count 370
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 146 transition count 370
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 146 transition count 360
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 141 transition count 346
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 141 transition count 346
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 136 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 136 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 131 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 131 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 126 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 126 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 121 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 121 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 117 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 117 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 113 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 113 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 110 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 110 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 107 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 107 transition count 260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 105 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 105 transition count 256
Applied a total of 114 rules in 20 ms. Remains 105 /157 variables (removed 52) and now considering 256/394 (removed 138) transitions.
[2026-05-25 02:21:22] [INFO ] Flow matrix only has 173 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-14407637632464411728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6064109713388957010.kers'
[2026-05-25 02:21:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14407637632464411728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6064109713388957010.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 173 rows 105 cols 478 entries
Finished phase 1 with 102 SingleSign rule and 1 generalized
[2026-05-25 02:21:22] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6064109713388957010.kers
Total runtime 1 ms.
[2026-05-25 02:21:22] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 02:21:22] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
[2026-05-25 02:21:22] [INFO ] Invariant cache hit.
[2026-05-25 02:21:22] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 02:21:22] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2026-05-25 02:21:22] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
[2026-05-25 02:21:22] [INFO ] Invariant cache hit.
[2026-05-25 02:21:22] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 173/278 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/278 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 147 constraints, problems are : Problem set: 0 solved, 254 unsolved in 6280 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 173/278 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 254/401 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 4/405 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 0/278 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 405 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 36349ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 36350ms
Starting structural reductions in LTL mode, iteration 1 : 105/157 places, 256/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36679 ms. Remains : 105/157 places, 256/394 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||F(p1)))) U !p1)))'
Stuttering acceptance computed with spot in 132 ms :[p1, p1, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-12
Stuttering criterion allowed to conclude after 16717 steps with 130 reset in 64 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-12 finished in 36904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 394/394 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 147 transition count 374
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 147 transition count 374
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 147 transition count 366
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 142 transition count 350
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 142 transition count 350
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 137 transition count 332
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 137 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 132 transition count 320
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 132 transition count 320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 127 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 127 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 122 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 122 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 117 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 117 transition count 280
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 112 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 112 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 109 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 109 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 106 transition count 258
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 106 transition count 258
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 104 transition count 254
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 104 transition count 254
Applied a total of 114 rules in 20 ms. Remains 104 /157 variables (removed 53) and now considering 254/394 (removed 140) transitions.
[2026-05-25 02:21:59] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1357694426545975521.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6853429730615635056.kers'
[2026-05-25 02:21:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1357694426545975521.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6853429730615635056.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 104 cols 476 entries
Finished phase 1 with 101 SingleSign rule and 1 generalized
[2026-05-25 02:21:59] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6853429730615635056.kers
Total runtime 1 ms.
[2026-05-25 02:21:59] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 02:21:59] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2026-05-25 02:21:59] [INFO ] Invariant cache hit.
[2026-05-25 02:21:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 02:21:59] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-25 02:21:59] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2026-05-25 02:21:59] [INFO ] Invariant cache hit.
[2026-05-25 02:21:59] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/276 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 146 constraints, problems are : Problem set: 0 solved, 252 unsolved in 5732 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/276 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 252/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/276 variables, and 399 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35822ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 35823ms
Starting structural reductions in LTL mode, iteration 1 : 104/157 places, 254/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36127 ms. Remains : 104/157 places, 254/394 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/104 stabilizing places and 64/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 14 ms. Proved property starting from automaton with 3 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 30 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b032-LTLCardinality-15 finished in 36645 ms.
All properties solved by simple procedures.
Total runtime 294863 ms.

BK_STOP 1779675756152

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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-b032"
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-b032, 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-177961074000091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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