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-177961073900060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is FunctionPointer-PT-b002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961073900060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 7.9K Mar 7 07:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 7 07:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 07:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 7 07:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 07:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 7 07:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 07:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 7 07:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 391K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779667801855

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 00:10:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 00:10:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 00:10:03] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2026-05-25 00:10:03] [INFO ] Transformed 306 places.
[2026-05-25 00:10:03] [INFO ] Transformed 840 transitions.
[2026-05-25 00:10:03] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b002-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 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 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 35 place count 187 transition count 536
Iterating global reduction 1 with 25 rules applied. Total rules applied 60 place count 187 transition count 536
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 114 place count 187 transition count 482
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 127 place count 174 transition count 456
Iterating global reduction 2 with 13 rules applied. Total rules applied 140 place count 174 transition count 456
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 156 place count 174 transition count 440
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 162 place count 168 transition count 428
Iterating global reduction 3 with 6 rules applied. Total rules applied 168 place count 168 transition count 428
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 174 place count 162 transition count 404
Iterating global reduction 3 with 6 rules applied. Total rules applied 180 place count 162 transition count 404
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 186 place count 156 transition count 392
Iterating global reduction 3 with 6 rules applied. Total rules applied 192 place count 156 transition count 392
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 195 place count 153 transition count 380
Iterating global reduction 3 with 3 rules applied. Total rules applied 198 place count 153 transition count 380
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 201 place count 150 transition count 368
Iterating global reduction 3 with 3 rules applied. Total rules applied 204 place count 150 transition count 368
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 207 place count 147 transition count 362
Iterating global reduction 3 with 3 rules applied. Total rules applied 210 place count 147 transition count 362
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 212 place count 145 transition count 358
Iterating global reduction 3 with 2 rules applied. Total rules applied 214 place count 145 transition count 358
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 216 place count 143 transition count 354
Iterating global reduction 3 with 2 rules applied. Total rules applied 218 place count 143 transition count 354
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 220 place count 141 transition count 350
Iterating global reduction 3 with 2 rules applied. Total rules applied 222 place count 141 transition count 350
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 223 place count 140 transition count 348
Iterating global reduction 3 with 1 rules applied. Total rules applied 224 place count 140 transition count 348
Applied a total of 224 rules in 109 ms. Remains 140 /222 variables (removed 82) and now considering 348/648 (removed 300) transitions.
[2026-05-25 00:10:03] [INFO ] Flow matrix only has 238 transitions (discarded 110 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17373208161269951101.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2884141243161657789.kers'
[2026-05-25 00:10:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17373208161269951101.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2884141243161657789.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 238 rows 140 cols 654 entries
Finished phase 1 with 137 SingleSign rule and 1 generalized
[2026-05-25 00:10:03] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2884141243161657789.kers
Total runtime 2 ms.
[2026-05-25 00:10:03] [INFO ] Implicit Places using invariants in 281 ms returned []
[2026-05-25 00:10:03] [INFO ] Flow matrix only has 238 transitions (discarded 110 similar events)
[2026-05-25 00:10:03] [INFO ] Invariant cache hit.
[2026-05-25 00:10:03] [INFO ] State equation strengthened by 54 read => feed constraints.
[2026-05-25 00:10:04] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2026-05-25 00:10:04] [INFO ] Flow matrix only has 238 transitions (discarded 110 similar events)
[2026-05-25 00:10:04] [INFO ] Invariant cache hit.
[2026-05-25 00:10:04] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (OVERLAPS) 238/378 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 54/196 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 346 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/378 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 346 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 196 constraints, problems are : Problem set: 0 solved, 346 unsolved in 13408 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 346 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (OVERLAPS) 238/378 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 54/196 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 346/542 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 8/550 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/378 variables, and 550 constraints, problems are : Problem set: 0 solved, 346 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 43718ms problems are : Problem set: 0 solved, 346 unsolved
Search for dead transitions found 0 dead transitions in 43731ms
Starting structural reductions in LTL mode, iteration 1 : 140/222 places, 348/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44506 ms. Remains : 140/222 places, 348/648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 348/348 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2026-05-25 00:10:47] [INFO ] Flow matrix only has 238 transitions (discarded 110 similar events)
[2026-05-25 00:10:47] [INFO ] Invariant cache hit.
[2026-05-25 00:10:48] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-25 00:10:48] [INFO ] Flow matrix only has 238 transitions (discarded 110 similar events)
[2026-05-25 00:10:48] [INFO ] Invariant cache hit.
[2026-05-25 00:10:48] [INFO ] State equation strengthened by 54 read => feed constraints.
[2026-05-25 00:10:48] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 531 ms. Remains : 140/140 places, 348/348 transitions.
Support contains 17 out of 140 places after structural reductions.
[2026-05-25 00:10:48] [INFO ] Flatten gal took : 46 ms
[2026-05-25 00:10:48] [INFO ] Flatten gal took : 25 ms
[2026-05-25 00:10:48] [INFO ] Input system was already deterministic with 348 transitions.
Reduction of identical properties reduced properties to check from 15 to 13
RANDOM walk for 40001 steps (67 resets) in 1377 ms. (29 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
[2026-05-25 00:10:49] [INFO ] Flow matrix only has 238 transitions (discarded 110 similar events)
[2026-05-25 00:10:49] [INFO ] Invariant cache hit.
[2026-05-25 00:10:49] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/206 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 38/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 336/378 variables, and 150 constraints, problems are : Problem set: 1 solved, 0 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 111/140 constraints, ReadFeed: 38/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
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' '!((X(X(!p0)) U ((!p1&&X(X(!p0)))||X(X(G(!p0))))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 348/348 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 135 transition count 334
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 135 transition count 334
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 135 transition count 330
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 132 transition count 324
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 132 transition count 324
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 129 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 129 transition count 314
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 126 transition count 304
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 126 transition count 304
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 124 transition count 300
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 124 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 122 transition count 296
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 122 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 120 transition count 292
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 120 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 118 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 118 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 116 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 116 transition count 284
Applied a total of 52 rules in 18 ms. Remains 116 /140 variables (removed 24) and now considering 284/348 (removed 64) transitions.
[2026-05-25 00:10:49] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-364795615204121940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13049253739519771316.kers'
[2026-05-25 00:10:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-364795615204121940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13049253739519771316.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 193 rows 116 cols 536 entries
Finished phase 1 with 113 SingleSign rule and 1 generalized
[2026-05-25 00:10:49] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13049253739519771316.kers
Total runtime 1 ms.
[2026-05-25 00:10:49] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 00:10:49] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2026-05-25 00:10:49] [INFO ] Invariant cache hit.
[2026-05-25 00:10:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 00:10:49] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2026-05-25 00:10:49] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2026-05-25 00:10:49] [INFO ] Invariant cache hit.
[2026-05-25 00:10:49] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 193/309 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 43/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/309 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 161 constraints, problems are : Problem set: 0 solved, 282 unsolved in 8610 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 193/309 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 43/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 282/443 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/451 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 309/309 variables, and 451 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 38724ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 38728ms
Starting structural reductions in LTL mode, iteration 1 : 116/140 places, 284/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39130 ms. Remains : 116/140 places, 284/348 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U (X(X(G(!p0)))||(!p1&&X(X(!p0))))))'
Stuttering acceptance computed with spot in 249 ms :[p0, p0, p0, true]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 334 ms.
Product exploration explored 100000 steps with 33333 reset in 164 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 16 ms. Proved property starting from automaton with 4 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b002-LTLFireability-02 finished in 39972 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((X(X(X((F(p0)||X(p1))))) U p2)))'
Support contains 6 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 348/348 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 135 transition count 334
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 135 transition count 334
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 135 transition count 330
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 131 transition count 320
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 131 transition count 320
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 127 transition count 308
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 127 transition count 308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 123 transition count 294
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 123 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 121 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 121 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 119 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 119 transition count 284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 117 transition count 280
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 117 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 115 transition count 276
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 115 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 113 transition count 272
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 113 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 112 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 112 transition count 270
Applied a total of 60 rules in 23 ms. Remains 112 /140 variables (removed 28) and now considering 270/348 (removed 78) transitions.
[2026-05-25 00:11:29] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4602136021565295026.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2442632778928920437.kers'
[2026-05-25 00:11:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4602136021565295026.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2442632778928920437.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 112 cols 516 entries
Finished phase 1 with 109 SingleSign rule and 1 generalized
[2026-05-25 00:11:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2442632778928920437.kers
Total runtime 1 ms.
[2026-05-25 00:11:29] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 00:11:29] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2026-05-25 00:11:29] [INFO ] Invariant cache hit.
[2026-05-25 00:11:29] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-25 00:11:29] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2026-05-25 00:11:29] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2026-05-25 00:11:29] [INFO ] Invariant cache hit.
[2026-05-25 00:11:29] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 186/298 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 45/159 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 268 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/298 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 159 constraints, problems are : Problem set: 0 solved, 268 unsolved in 8192 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 186/298 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 45/159 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 268/427 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 8/435 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/298 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 435 constraints, problems are : Problem set: 0 solved, 268 unsolved in 28230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 36487ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 36488ms
Starting structural reductions in LTL mode, iteration 1 : 112/140 places, 270/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36851 ms. Remains : 112/140 places, 270/348 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((X(X(X((F(p0)||X(p1))))) U p2)))'
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-03
Stuttering criterion allowed to conclude after 116 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-03 finished in 37125 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 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 348/348 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 133 transition count 328
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 133 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 133 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 128 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 128 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 123 transition count 298
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 123 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 118 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 118 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 114 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 114 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 110 transition count 262
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 110 transition count 262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 106 transition count 254
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 106 transition count 254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 102 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 102 transition count 246
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 98 transition count 238
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 97 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 97 transition count 234
Applied a total of 90 rules in 57 ms. Remains 97 /140 variables (removed 43) and now considering 234/348 (removed 114) transitions.
[2026-05-25 00:12:06] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16156578109851980321.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14387707504041041576.kers'
[2026-05-25 00:12:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16156578109851980321.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14387707504041041576.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 158 rows 97 cols 438 entries
Finished phase 1 with 94 SingleSign rule and 1 generalized
[2026-05-25 00:12:06] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14387707504041041576.kers
Total runtime 4 ms.
[2026-05-25 00:12:06] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 00:12:06] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2026-05-25 00:12:06] [INFO ] Invariant cache hit.
[2026-05-25 00:12:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 00:12:06] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2026-05-25 00:12:06] [INFO ] Redundant transitions in 11 ms returned []
Running 232 sub problems to find dead transitions.
[2026-05-25 00:12:06] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2026-05-25 00:12:06] [INFO ] Invariant cache hit.
[2026-05-25 00:12:06] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 136 constraints, problems are : Problem set: 0 solved, 232 unsolved in 6259 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 232/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 8/376 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 0/255 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 376 constraints, problems are : Problem set: 0 solved, 232 unsolved in 19055 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 25377ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 25378ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/140 places, 234/348 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25735 ms. Remains : 97/140 places, 234/348 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 28 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-06
Product exploration explored 100000 steps with 548 reset in 263 ms.
Stack based approach found an accepted trace after 1739 steps with 8 reset with depth 51 and stack size 51 in 5 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-06 finished in 26062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 348/348 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 133 transition count 328
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 133 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 133 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 128 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 128 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 123 transition count 298
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 123 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 118 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 118 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 114 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 114 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 110 transition count 262
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 110 transition count 262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 106 transition count 254
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 106 transition count 254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 102 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 102 transition count 246
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 98 transition count 238
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 97 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 97 transition count 234
Applied a total of 90 rules in 37 ms. Remains 97 /140 variables (removed 43) and now considering 234/348 (removed 114) transitions.
[2026-05-25 00:12:32] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2026-05-25 00:12:32] [INFO ] Invariant cache hit.
[2026-05-25 00:12:32] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 00:12:32] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2026-05-25 00:12:32] [INFO ] Invariant cache hit.
[2026-05-25 00:12:32] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 00:12:32] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2026-05-25 00:12:32] [INFO ] Redundant transitions in 8 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/140 places, 234/348 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 360 ms. Remains : 97/140 places, 234/348 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 28 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-09
Stuttering criterion allowed to conclude after 330 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-09 finished in 414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U G(!p2))&&p0))))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 348/348 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 134 transition count 330
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 134 transition count 330
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 129 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 129 transition count 318
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 124 transition count 302
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 124 transition count 302
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 119 transition count 284
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 119 transition count 284
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 115 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 115 transition count 274
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 111 transition count 266
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 111 transition count 266
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 107 transition count 258
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 107 transition count 258
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 103 transition count 250
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 103 transition count 250
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 99 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 98 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 98 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 98 transition count 238
Applied a total of 86 rules in 28 ms. Remains 98 /140 variables (removed 42) and now considering 238/348 (removed 110) transitions.
[2026-05-25 00:12:33] [INFO ] Flow matrix only has 160 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-15341522557703757510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1650242374806611954.kers'
[2026-05-25 00:12:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15341522557703757510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1650242374806611954.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 160 rows 98 cols 442 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-25 00:12:33] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1650242374806611954.kers
Total runtime 1 ms.
[2026-05-25 00:12:33] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 00:12:33] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2026-05-25 00:12:33] [INFO ] Invariant cache hit.
[2026-05-25 00:12:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 00:12:33] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2026-05-25 00:12:33] [INFO ] Redundant transitions in 2 ms returned []
Running 236 sub problems to find dead transitions.
[2026-05-25 00:12:33] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2026-05-25 00:12:33] [INFO ] Invariant cache hit.
[2026-05-25 00:12:33] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 137 constraints, problems are : Problem set: 0 solved, 236 unsolved in 6673 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 236/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 7/380 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 380 constraints, problems are : Problem set: 0 solved, 236 unsolved in 20194 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 26922ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 26924ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/140 places, 238/348 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27247 ms. Remains : 98/140 places, 238/348 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U G(!p2))&&p0))))'
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), p2, p2]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-11
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-11 finished in 27434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((F((G(p3)&&p2))&&p1))))))'
Support contains 6 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 348/348 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 134 transition count 330
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 134 transition count 330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 134 transition count 328
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 130 transition count 318
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 130 transition count 318
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 126 transition count 304
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 126 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 122 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 122 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 118 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 118 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 114 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 114 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 110 transition count 262
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 110 transition count 262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 106 transition count 254
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 106 transition count 254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 102 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 102 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 101 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 101 transition count 244
Applied a total of 80 rules in 14 ms. Remains 101 /140 variables (removed 39) and now considering 244/348 (removed 104) transitions.
[2026-05-25 00:13:00] [INFO ] Flow matrix only has 166 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-8925231179213222216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18223799323446673542.kers'
[2026-05-25 00:13:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8925231179213222216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18223799323446673542.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 166 rows 101 cols 460 entries
Finished phase 1 with 98 SingleSign rule and 1 generalized
[2026-05-25 00:13:00] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18223799323446673542.kers
Total runtime 1 ms.
[2026-05-25 00:13:00] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 00:13:00] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
[2026-05-25 00:13:00] [INFO ] Invariant cache hit.
[2026-05-25 00:13:00] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 00:13:00] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2026-05-25 00:13:00] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
[2026-05-25 00:13:00] [INFO ] Invariant cache hit.
[2026-05-25 00:13:00] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 166/267 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/267 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 143 constraints, problems are : Problem set: 0 solved, 242 unsolved in 6942 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 166/267 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 242/385 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 7/392 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 0/267 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 392 constraints, problems are : Problem set: 0 solved, 242 unsolved in 19409 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 26409ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 26409ms
Starting structural reductions in LTL mode, iteration 1 : 101/140 places, 244/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26687 ms. Remains : 101/140 places, 244/348 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((F((G(p2)&&p1))&&p0)))||p3)))'
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-12
Stuttering criterion allowed to conclude after 210 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-12 finished in 26933 ms.
All properties solved by simple procedures.
Total runtime 204375 ms.

BK_STOP 1779668007498

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b002, examination is LTLFireability"
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-177961073900060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b002.tgz
mv FunctionPointer-PT-b002 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;