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.r066-tall-177946967700372.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 CO4-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.6K Mar 6 13:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 6 13:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 6 13:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Mar 6 13:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 6 13:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 6 13:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 177K 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 CO4-PT-12-LTLFireability-00
FORMULA_NAME CO4-PT-12-LTLFireability-01
FORMULA_NAME CO4-PT-12-LTLFireability-02
FORMULA_NAME CO4-PT-12-LTLFireability-03
FORMULA_NAME CO4-PT-12-LTLFireability-04
FORMULA_NAME CO4-PT-12-LTLFireability-05
FORMULA_NAME CO4-PT-12-LTLFireability-06
FORMULA_NAME CO4-PT-12-LTLFireability-07
FORMULA_NAME CO4-PT-12-LTLFireability-08
FORMULA_NAME CO4-PT-12-LTLFireability-09
FORMULA_NAME CO4-PT-12-LTLFireability-10
FORMULA_NAME CO4-PT-12-LTLFireability-11
FORMULA_NAME CO4-PT-12-LTLFireability-12
FORMULA_NAME CO4-PT-12-LTLFireability-13
FORMULA_NAME CO4-PT-12-LTLFireability-14
FORMULA_NAME CO4-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779522953091

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 07:55:54] [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-23 07:55:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:55:54] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2026-05-23 07:55:54] [INFO ] Transformed 649 places.
[2026-05-23 07:55:54] [INFO ] Transformed 782 transitions.
[2026-05-23 07:55:54] [INFO ] Found NUPN structural information;
[2026-05-23 07:55:54] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 172 places in 9 ms
Reduce places removed 172 places and 219 transitions.
FORMULA CO4-PT-12-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 563/563 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 461 transition count 559
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 102 place count 379 transition count 475
Iterating global reduction 1 with 82 rules applied. Total rules applied 184 place count 379 transition count 475
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 249 place count 314 transition count 392
Iterating global reduction 1 with 65 rules applied. Total rules applied 314 place count 314 transition count 392
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 318 place count 314 transition count 388
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 350 place count 282 transition count 356
Iterating global reduction 2 with 32 rules applied. Total rules applied 382 place count 282 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 384 place count 282 transition count 354
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 403 place count 263 transition count 335
Iterating global reduction 3 with 19 rules applied. Total rules applied 422 place count 263 transition count 335
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 426 place count 263 transition count 331
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 430 place count 259 transition count 327
Iterating global reduction 4 with 4 rules applied. Total rules applied 434 place count 259 transition count 327
Applied a total of 434 rules in 112 ms. Remains 259 /477 variables (removed 218) and now considering 327/563 (removed 236) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9914412523507539795.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12563053314625842154.kers'
[2026-05-23 07:55:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9914412523507539795.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12563053314625842154.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 327 rows 259 cols 772 entries
Finished phase 1 with 253 SingleSign rule and 0 generalized
[2026-05-23 07:55:54] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12563053314625842154.kers
Total runtime 2 ms.
[2026-05-23 07:55:54] [INFO ] Implicit Places using invariants in 232 ms returned [6, 188]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 262 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/477 places, 327/563 transitions.
Applied a total of 0 rules in 18 ms. Remains 257 /257 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 406 ms. Remains : 257/477 places, 327/563 transitions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 327/327 transitions.
Applied a total of 0 rules in 6 ms. Remains 257 /257 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1413349056430746533.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14285998527381056985.kers'
[2026-05-23 07:55:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1413349056430746533.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14285998527381056985.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 327 rows 257 cols 756 entries
Finished phase 1 with 253 SingleSign rule and 0 generalized
[2026-05-23 07:55:54] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14285998527381056985.kers
Total runtime 2 ms.
[2026-05-23 07:55:55] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-23 07:55:55] [INFO ] Invariant cache hit.
[2026-05-23 07:55:55] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2026-05-23 07:55:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/257 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (OVERLAPS) 327/584 variables, 257/263 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (OVERLAPS) 0/584 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 584/584 variables, and 263 constraints, problems are : Problem set: 0 solved, 326 unsolved in 22822 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/257 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (OVERLAPS) 327/584 variables, 257/263 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 326/589 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 584/584 variables, and 589 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52922ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 52934ms
Finished structural reductions in LTL mode , in 1 iterations and 53209 ms. Remains : 257/257 places, 327/327 transitions.
Support contains 22 out of 257 places after structural reductions.
[2026-05-23 07:56:48] [INFO ] Flatten gal took : 40 ms
[2026-05-23 07:56:48] [INFO ] Flatten gal took : 15 ms
[2026-05-23 07:56:48] [INFO ] Input system was already deterministic with 327 transitions.
RANDOM walk for 40000 steps (331 resets) in 1215 ms. (32 steps per ms) remains 13/22 properties
BEST_FIRST walk for 40000 steps (194 resets) in 260 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (190 resets) in 192 ms. (207 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (107 resets) in 151 ms. (263 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40000 steps (108 resets) in 145 ms. (273 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (205 resets) in 118 ms. (336 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40000 steps (149 resets) in 213 ms. (186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (206 resets) in 195 ms. (204 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (227 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (198 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (239 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (196 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (144 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
[2026-05-23 07:56:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 22/32 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 83/115 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 13/128 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 17/145 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 181/326 variables, 92/128 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 157/483 variables, 74/202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/483 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 74/557 variables, 43/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 17/574 variables, 10/255 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/574 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 9/583 variables, 5/260 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/583 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 1/584 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/584 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/584 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 0/584 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 584/584 variables, and 262 constraints, problems are : Problem set: 0 solved, 10 unsolved in 998 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 22/32 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 83/115 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 13/128 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 17/145 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 181/326 variables, 92/138 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 157/483 variables, 74/212 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/483 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/483 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/483 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 74/557 variables, 43/258 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 17/574 variables, 10/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/574 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 9/583 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/583 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 1/584 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/584 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/584 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 584/584 variables, and 274 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1538 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2539ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 116 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=116 )
Parikh walk visited 10 properties in 547 ms.
FORMULA CO4-PT-12-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 434 edges and 257 vertex of which 252 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(X(X((p1&&F(G(p2))))))))))'
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 327/327 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 248 transition count 318
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 248 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 248 transition count 316
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 242 transition count 310
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 242 transition count 310
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 238 transition count 306
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 238 transition count 306
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 238 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 237 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 237 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 236 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 236 transition count 302
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 235 transition count 301
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 235 transition count 301
Applied a total of 48 rules in 34 ms. Remains 235 /257 variables (removed 22) and now considering 301/327 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17368388872124935883.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16594393058524557083.kers'
[2026-05-23 07:56:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17368388872124935883.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16594393058524557083.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 235 cols 702 entries
Finished phase 1 with 231 SingleSign rule and 0 generalized
[2026-05-23 07:56:53] [INFO ] Computed 4 invariants in 4 ms
Computed 4 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16594393058524557083.kers
Total runtime 5 ms.
[2026-05-23 07:56:53] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-23 07:56:53] [INFO ] Invariant cache hit.
[2026-05-23 07:56:53] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2026-05-23 07:56:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 301/536 variables, 235/241 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/536 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 241 constraints, problems are : Problem set: 0 solved, 300 unsolved in 18902 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 301/536 variables, 235/242 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 300/542 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/536 variables, and 544 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48952ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 48954ms
Starting structural reductions in LTL mode, iteration 1 : 235/257 places, 301/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49168 ms. Remains : 235/257 places, 301/327 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&&X(X(X((p1&&F(G(p2))))))))))'
Stuttering acceptance computed with spot in 437 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CO4-PT-12-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CO4-PT-12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-01 finished in 49691 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 (p1 U X(X(p2))))))'
Support contains 3 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 327/327 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 249 transition count 319
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 249 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 249 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 244 transition count 313
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 244 transition count 313
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 241 transition count 310
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 241 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 241 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 240 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 240 transition count 308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 239 transition count 307
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 239 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 238 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 238 transition count 306
Applied a total of 40 rules in 35 ms. Remains 238 /257 variables (removed 19) and now considering 306/327 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1440876663580010943.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5888325919372149478.kers'
[2026-05-23 07:57:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1440876663580010943.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5888325919372149478.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 306 rows 238 cols 712 entries
Finished phase 1 with 234 SingleSign rule and 0 generalized
[2026-05-23 07:57:42] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5888325919372149478.kers
Total runtime 4 ms.
[2026-05-23 07:57:42] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-23 07:57:42] [INFO ] Invariant cache hit.
[2026-05-23 07:57:42] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2026-05-23 07:57:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 306/544 variables, 238/244 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 0/544 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 244 constraints, problems are : Problem set: 0 solved, 305 unsolved in 19147 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 306/544 variables, 238/245 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 305/550 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/544 variables, and 551 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49185ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 49186ms
Starting structural reductions in LTL mode, iteration 1 : 238/257 places, 306/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49399 ms. Remains : 238/257 places, 306/327 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 (p1 U X(X(p2))))))'
Stuttering acceptance computed with spot in 385 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : CO4-PT-12-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CO4-PT-12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-04 finished in 49829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 327/327 transitions.
Graph (trivial) has 270 edges and 257 vertex of which 3 / 257 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 432 edges and 255 vertex of which 250 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 105 place count 249 transition count 215
Reduce places removed 103 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 104 rules applied. Total rules applied 209 place count 146 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 210 place count 145 transition count 214
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 210 place count 145 transition count 194
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 250 place count 125 transition count 194
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 252 place count 123 transition count 192
Iterating global reduction 3 with 2 rules applied. Total rules applied 254 place count 123 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 254 place count 123 transition count 191
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 256 place count 122 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 257 place count 121 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 258 place count 121 transition count 190
Performed 48 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 354 place count 73 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 358 place count 73 transition count 121
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 362 place count 69 transition count 117
Iterating global reduction 4 with 4 rules applied. Total rules applied 366 place count 69 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 368 place count 68 transition count 116
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 396 place count 54 transition count 119
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 405 place count 54 transition count 110
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 416 place count 43 transition count 88
Iterating global reduction 5 with 11 rules applied. Total rules applied 427 place count 43 transition count 88
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 435 place count 43 transition count 80
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 438 place count 40 transition count 71
Iterating global reduction 6 with 3 rules applied. Total rules applied 441 place count 40 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 442 place count 40 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 444 place count 39 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 453 place count 39 transition count 68
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 454 place count 39 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 456 place count 37 transition count 66
Applied a total of 456 rules in 68 ms. Remains 37 /257 variables (removed 220) and now considering 66/327 (removed 261) transitions.
[2026-05-23 07:58:32] [INFO ] Flow matrix only has 62 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8378230078081476517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14854750688341133206.kers'
[2026-05-23 07:58:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8378230078081476517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14854750688341133206.kers]
Normalized transition count is 61 out of 62 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 61 rows 37 cols 198 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-23 07:58:32] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14854750688341133206.kers
Total runtime 0 ms.
[2026-05-23 07:58:32] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-23 07:58:32] [INFO ] Flow matrix only has 62 transitions (discarded 4 similar events)
[2026-05-23 07:58:32] [INFO ] Invariant cache hit.
[2026-05-23 07:58:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:58:32] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2026-05-23 07:58:32] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2026-05-23 07:58:32] [INFO ] Flow matrix only has 62 transitions (discarded 4 similar events)
[2026-05-23 07:58:32] [INFO ] Invariant cache hit.
[2026-05-23 07:58:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 61/98 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 1/99 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 0/99 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 42 constraints, problems are : Problem set: 0 solved, 51 unsolved in 830 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 61/98 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 51/92 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 1/99 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/99 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 93 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1354 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2202ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 2204ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/257 places, 66/327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2353 ms. Remains : 37/257 places, 66/327 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||p1)))))'
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-12-LTLFireability-05
Product exploration explored 100000 steps with 8 reset in 144 ms.
Product exploration explored 100000 steps with 22 reset in 81 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge based reduction with 9 factoid took 56 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1267 steps (150 resets) in 19 ms. (63 steps per ms) remains 0/3 properties
Knowledge based reduction with 9 factoid took 84 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 250 ms.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 66/66 transitions.
Applied a total of 0 rules in 5 ms. Remains 37 /37 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2026-05-23 07:58:35] [INFO ] Flow matrix only has 62 transitions (discarded 4 similar events)
[2026-05-23 07:58:35] [INFO ] Invariant cache hit.
[2026-05-23 07:58:35] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-23 07:58:35] [INFO ] Flow matrix only has 62 transitions (discarded 4 similar events)
[2026-05-23 07:58:35] [INFO ] Invariant cache hit.
[2026-05-23 07:58:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:58:35] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2026-05-23 07:58:35] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 37/37 places, 66/66 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge based reduction with 9 factoid took 50 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 2368 steps (286 resets) in 32 ms. (71 steps per ms) remains 0/3 properties
Knowledge based reduction with 9 factoid took 76 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 212 ms.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14 reset in 78 ms.
Product exploration explored 100000 steps with 37 reset in 62 ms.
Built C files in :
/tmp/ltsmin11718677699791873622
[2026-05-23 07:58:36] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2026-05-23 07:58:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:58:36] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2026-05-23 07:58:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:58:36] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2026-05-23 07:58:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:58:36] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11718677699791873622
Running compilation step : cd /tmp/ltsmin11718677699791873622;'/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 234 ms.
Running link step : cd /tmp/ltsmin11718677699791873622;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin11718677699791873622;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13213563095140940253.hoa' '--buchi-type=spotba'
LTSmin run took 48 ms.
FORMULA CO4-PT-12-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-12-LTLFireability-05 finished in 3988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 327/327 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 249 transition count 319
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 249 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 249 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 244 transition count 313
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 244 transition count 313
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 241 transition count 310
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 241 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 241 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 240 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 240 transition count 308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 239 transition count 307
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 239 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 238 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 238 transition count 306
Applied a total of 40 rules in 34 ms. Remains 238 /257 variables (removed 19) and now considering 306/327 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3419862104621656675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3239012915573580653.kers'
[2026-05-23 07:58:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3419862104621656675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3239012915573580653.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 306 rows 238 cols 712 entries
Finished phase 1 with 234 SingleSign rule and 0 generalized
[2026-05-23 07:58:36] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3239012915573580653.kers
Total runtime 1 ms.
[2026-05-23 07:58:36] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 07:58:36] [INFO ] Invariant cache hit.
[2026-05-23 07:58:36] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2026-05-23 07:58:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 306/544 variables, 238/244 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 0/544 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 244 constraints, problems are : Problem set: 0 solved, 305 unsolved in 19477 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 306/544 variables, 238/245 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 305/550 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/544 variables, and 552 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49524ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 49525ms
Starting structural reductions in LTL mode, iteration 1 : 238/257 places, 306/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49743 ms. Remains : 238/257 places, 306/327 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(p0))))'
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-06
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA CO4-PT-12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-06 finished in 49917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 327/327 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 249 transition count 319
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 249 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 249 transition count 317
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 244 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 244 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 240 transition count 308
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 240 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 240 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 239 transition count 305
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 239 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 238 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 238 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 237 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 237 transition count 303
Applied a total of 44 rules in 30 ms. Remains 237 /257 variables (removed 20) and now considering 303/327 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10648753332101991577.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7296781919993950066.kers'
[2026-05-23 07:59:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10648753332101991577.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7296781919993950066.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 303 rows 237 cols 706 entries
Finished phase 1 with 233 SingleSign rule and 0 generalized
[2026-05-23 07:59:26] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7296781919993950066.kers
Total runtime 4 ms.
[2026-05-23 07:59:26] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-23 07:59:26] [INFO ] Invariant cache hit.
[2026-05-23 07:59:26] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2026-05-23 07:59:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 303/540 variables, 237/244 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 0/540 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/540 variables, and 244 constraints, problems are : Problem set: 0 solved, 302 unsolved in 19147 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 303/540 variables, 237/244 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 302/546 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/540 variables, and 547 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49188ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 49189ms
Starting structural reductions in LTL mode, iteration 1 : 237/257 places, 303/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49407 ms. Remains : 237/257 places, 303/327 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-07
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-07 finished in 49641 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))||(p1 U (G(p1)||(p1&&G(p2))))))'
Support contains 3 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 327/327 transitions.
Graph (trivial) has 269 edges and 257 vertex of which 3 / 257 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 432 edges and 255 vertex of which 250 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 105 place count 249 transition count 215
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 146 transition count 213
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 213 place count 145 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 214 place count 144 transition count 211
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 214 place count 144 transition count 191
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 254 place count 124 transition count 191
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 256 place count 122 transition count 189
Iterating global reduction 4 with 2 rules applied. Total rules applied 258 place count 122 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 258 place count 122 transition count 188
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 260 place count 121 transition count 188
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 261 place count 120 transition count 187
Iterating global reduction 4 with 1 rules applied. Total rules applied 262 place count 120 transition count 187
Performed 46 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 354 place count 74 transition count 127
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 360 place count 74 transition count 121
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 364 place count 70 transition count 117
Iterating global reduction 5 with 4 rules applied. Total rules applied 368 place count 70 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 370 place count 69 transition count 116
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 396 place count 56 transition count 119
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 405 place count 56 transition count 110
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 415 place count 46 transition count 90
Iterating global reduction 6 with 10 rules applied. Total rules applied 425 place count 46 transition count 90
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 433 place count 46 transition count 82
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 435 place count 44 transition count 76
Iterating global reduction 7 with 2 rules applied. Total rules applied 437 place count 44 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 438 place count 44 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 440 place count 43 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 448 place count 43 transition count 74
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 449 place count 43 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 451 place count 41 transition count 72
Applied a total of 451 rules in 45 ms. Remains 41 /257 variables (removed 216) and now considering 72/327 (removed 255) transitions.
[2026-05-23 08:00:16] [INFO ] Flow matrix only has 67 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8810511916784564329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1089208741878121190.kers'
[2026-05-23 08:00:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8810511916784564329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1089208741878121190.kers]
Normalized transition count is 66 out of 67 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 66 rows 41 cols 207 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-23 08:00:16] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1089208741878121190.kers
Total runtime 0 ms.
[2026-05-23 08:00:16] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-23 08:00:16] [INFO ] Flow matrix only has 67 transitions (discarded 5 similar events)
[2026-05-23 08:00:16] [INFO ] Invariant cache hit.
[2026-05-23 08:00:16] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-23 08:00:16] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2026-05-23 08:00:16] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2026-05-23 08:00:16] [INFO ] Flow matrix only has 67 transitions (discarded 5 similar events)
[2026-05-23 08:00:16] [INFO ] Invariant cache hit.
[2026-05-23 08:00:16] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 66/107 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/108 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/108 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 56 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1363 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 66/107 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 59/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/108 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/108 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 115 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1828 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3199ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3199ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/257 places, 72/327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3326 ms. Remains : 41/257 places, 72/327 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))||(p1 U (G(p1)||(p1&&G(p2))))))'
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-12-LTLFireability-08
Product exploration explored 100000 steps with 27 reset in 46 ms.
Product exploration explored 100000 steps with 47 reset in 36 ms.
Computed a total of 9 stabilizing places and 13 stable transitions
Computed a total of 9 stabilizing places and 13 stable transitions
Detected a total of 9/41 stabilizing places and 13/72 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 10 factoid took 187 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (3876 resets) in 169 ms. (235 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (587 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
[2026-05-23 08:00:19] [INFO ] Flow matrix only has 67 transitions (discarded 5 similar events)
[2026-05-23 08:00:19] [INFO ] Invariant cache hit.
[2026-05-23 08:00:19] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/16 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/57 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 47/104 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 107/108 variables, and 55 constraints, problems are : Problem set: 1 solved, 0 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 11 factoid took 274 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 768 ms.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 72/72 transitions.
Applied a total of 0 rules in 5 ms. Remains 41 /41 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2026-05-23 08:00:20] [INFO ] Flow matrix only has 67 transitions (discarded 5 similar events)
[2026-05-23 08:00:20] [INFO ] Invariant cache hit.
[2026-05-23 08:00:20] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-23 08:00:20] [INFO ] Flow matrix only has 67 transitions (discarded 5 similar events)
[2026-05-23 08:00:20] [INFO ] Invariant cache hit.
[2026-05-23 08:00:20] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-23 08:00:20] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2026-05-23 08:00:20] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 41/41 places, 72/72 transitions.
Computed a total of 9 stabilizing places and 13 stable transitions
Computed a total of 9 stabilizing places and 13 stable transitions
Detected a total of 9/41 stabilizing places and 13/72 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 10 factoid took 219 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (3862 resets) in 97 ms. (408 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (572 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
[2026-05-23 08:00:21] [INFO ] Flow matrix only has 67 transitions (discarded 5 similar events)
[2026-05-23 08:00:21] [INFO ] Invariant cache hit.
[2026-05-23 08:00:21] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/16 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/57 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 47/104 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 107/108 variables, and 55 constraints, problems are : Problem set: 1 solved, 0 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 11 factoid took 272 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 748 ms.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 44 reset in 33 ms.
Product exploration explored 100000 steps with 48 reset in 36 ms.
Built C files in :
/tmp/ltsmin5041903487923511468
[2026-05-23 08:00:21] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2026-05-23 08:00:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:00:21] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2026-05-23 08:00:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:00:21] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2026-05-23 08:00:21] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:00:21] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5041903487923511468
Running compilation step : cd /tmp/ltsmin5041903487923511468;'/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 161 ms.
Running link step : cd /tmp/ltsmin5041903487923511468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5041903487923511468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13986264022898990736.hoa' '--buchi-type=spotba'
LTSmin run took 149 ms.
FORMULA CO4-PT-12-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-12-LTLFireability-08 finished in 6203 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 U (p1||G(p0)))))'
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 327/327 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 248 transition count 318
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 248 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 248 transition count 316
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 242 transition count 310
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 242 transition count 310
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 238 transition count 306
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 238 transition count 306
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 238 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 237 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 237 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 236 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 236 transition count 302
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 235 transition count 301
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 235 transition count 301
Applied a total of 48 rules in 19 ms. Remains 235 /257 variables (removed 22) and now considering 301/327 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2673381563304173038.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1995629728687736296.kers'
[2026-05-23 08:00:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2673381563304173038.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1995629728687736296.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 235 cols 702 entries
Finished phase 1 with 231 SingleSign rule and 0 generalized
[2026-05-23 08:00:22] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1995629728687736296.kers
Total runtime 4 ms.
[2026-05-23 08:00:22] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-23 08:00:22] [INFO ] Invariant cache hit.
[2026-05-23 08:00:22] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2026-05-23 08:00:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 301/536 variables, 235/241 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/536 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 241 constraints, problems are : Problem set: 0 solved, 300 unsolved in 19105 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 301/536 variables, 235/242 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 300/542 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/536 variables, and 544 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49133ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 49134ms
Starting structural reductions in LTL mode, iteration 1 : 235/257 places, 301/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49337 ms. Remains : 235/257 places, 301/327 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 U (G(p0)||p1))))'
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-12-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 406 edges and 235 vertex of which 230 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 13 ms. Proved property starting from automaton with 3 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 20 ms.
FORMULA CO4-PT-12-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-12-LTLFireability-10 finished in 49674 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)||(X(G(p1))&&G(p2))))'
Support contains 3 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 327/327 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 249 transition count 319
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 249 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 249 transition count 317
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 244 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 244 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 242 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 242 transition count 310
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 242 transition count 308
Applied a total of 34 rules in 16 ms. Remains 242 /257 variables (removed 15) and now considering 308/327 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16599532314070142973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12549990159110809673.kers'
[2026-05-23 08:01:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16599532314070142973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12549990159110809673.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 242 cols 716 entries
Finished phase 1 with 238 SingleSign rule and 0 generalized
[2026-05-23 08:01:12] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12549990159110809673.kers
Total runtime 2 ms.
[2026-05-23 08:01:12] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-23 08:01:12] [INFO ] Invariant cache hit.
[2026-05-23 08:01:12] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2026-05-23 08:01:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/550 variables, 242/248 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 0/550 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 248 constraints, problems are : Problem set: 0 solved, 307 unsolved in 19784 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/550 variables, 242/248 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 307/555 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 557 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49826ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 49827ms
Starting structural reductions in LTL mode, iteration 1 : 242/257 places, 308/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50020 ms. Remains : 242/257 places, 308/327 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)||(X(G(p1))&&G(p2))))'
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-12
Product exploration explored 100000 steps with 16 reset in 85 ms.
Stuttering criterion allowed to conclude after 954 steps with 31 reset in 2 ms.
FORMULA CO4-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-12 finished in 50265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 327/327 transitions.
Graph (trivial) has 272 edges and 257 vertex of which 3 / 257 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 432 edges and 255 vertex of which 250 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 249 transition count 212
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 108 rules applied. Total rules applied 216 place count 143 transition count 210
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 218 place count 142 transition count 209
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 218 place count 142 transition count 189
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 258 place count 122 transition count 189
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 260 place count 120 transition count 187
Iterating global reduction 3 with 2 rules applied. Total rules applied 262 place count 120 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 262 place count 120 transition count 186
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 264 place count 119 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 265 place count 118 transition count 185
Iterating global reduction 3 with 1 rules applied. Total rules applied 266 place count 118 transition count 185
Performed 48 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 362 place count 70 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 366 place count 70 transition count 116
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 370 place count 66 transition count 112
Iterating global reduction 4 with 4 rules applied. Total rules applied 374 place count 66 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 376 place count 65 transition count 111
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 402 place count 52 transition count 114
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 410 place count 52 transition count 106
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 420 place count 42 transition count 86
Iterating global reduction 5 with 10 rules applied. Total rules applied 430 place count 42 transition count 86
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 437 place count 42 transition count 79
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 440 place count 39 transition count 70
Iterating global reduction 6 with 3 rules applied. Total rules applied 443 place count 39 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 445 place count 39 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 447 place count 38 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 456 place count 38 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 458 place count 36 transition count 64
Applied a total of 458 rules in 29 ms. Remains 36 /257 variables (removed 221) and now considering 64/327 (removed 263) transitions.
[2026-05-23 08:02:02] [INFO ] Flow matrix only has 60 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6854624700923997031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9223040062642818499.kers'
[2026-05-23 08:02:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6854624700923997031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9223040062642818499.kers]
Normalized transition count is 59 out of 60 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 59 rows 36 cols 191 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-05-23 08:02:02] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9223040062642818499.kers
Total runtime 2 ms.
[2026-05-23 08:02:02] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-23 08:02:02] [INFO ] Flow matrix only has 60 transitions (discarded 4 similar events)
[2026-05-23 08:02:02] [INFO ] Invariant cache hit.
[2026-05-23 08:02:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:02:02] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2026-05-23 08:02:02] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2026-05-23 08:02:02] [INFO ] Flow matrix only has 60 transitions (discarded 4 similar events)
[2026-05-23 08:02:02] [INFO ] Invariant cache hit.
[2026-05-23 08:02:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 59/95 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 1/96 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 0/96 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 41 constraints, problems are : Problem set: 0 solved, 49 unsolved in 822 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 59/95 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 49/89 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 1/96 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/96 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 90 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1247 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2074ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2075ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/257 places, 64/327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2192 ms. Remains : 36/257 places, 64/327 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-13
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-13 finished in 2318 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 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 327/327 transitions.
Graph (trivial) has 273 edges and 257 vertex of which 3 / 257 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 432 edges and 255 vertex of which 250 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 249 transition count 211
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 109 rules applied. Total rules applied 218 place count 142 transition count 209
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 220 place count 141 transition count 208
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 220 place count 141 transition count 188
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 260 place count 121 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 261 place count 120 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 262 place count 120 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 262 place count 120 transition count 186
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 264 place count 119 transition count 186
Performed 48 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 360 place count 71 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 363 place count 71 transition count 118
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 367 place count 67 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 371 place count 67 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 373 place count 66 transition count 113
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 401 place count 52 transition count 116
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 410 place count 52 transition count 107
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 421 place count 41 transition count 85
Iterating global reduction 5 with 11 rules applied. Total rules applied 432 place count 41 transition count 85
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 440 place count 41 transition count 77
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 443 place count 38 transition count 68
Iterating global reduction 6 with 3 rules applied. Total rules applied 446 place count 38 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 448 place count 38 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 450 place count 37 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 459 place count 37 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 461 place count 35 transition count 62
Applied a total of 461 rules in 32 ms. Remains 35 /257 variables (removed 222) and now considering 62/327 (removed 265) transitions.
[2026-05-23 08:02:04] [INFO ] Flow matrix only has 58 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13130394609729747555.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5399594551594433394.kers'
[2026-05-23 08:02:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13130394609729747555.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5399594551594433394.kers]
Normalized transition count is 57 out of 58 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 57 rows 35 cols 187 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-23 08:02:04] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5399594551594433394.kers
Total runtime 1 ms.
[2026-05-23 08:02:04] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-23 08:02:04] [INFO ] Flow matrix only has 58 transitions (discarded 4 similar events)
[2026-05-23 08:02:04] [INFO ] Invariant cache hit.
[2026-05-23 08:02:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:02:04] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2026-05-23 08:02:04] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2026-05-23 08:02:04] [INFO ] Flow matrix only has 58 transitions (discarded 4 similar events)
[2026-05-23 08:02:04] [INFO ] Invariant cache hit.
[2026-05-23 08:02:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 57/92 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 1/93 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 0/93 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 40 constraints, problems are : Problem set: 0 solved, 47 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 57/92 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 47/86 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/93 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/93 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 87 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1096 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1865ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1865ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/257 places, 62/327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1971 ms. Remains : 35/257 places, 62/327 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 33 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-14
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-14 finished in 2041 ms.
All properties solved by simple procedures.
Total runtime 372410 ms.

BK_STOP 1779523326652

--------------------
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="CO4-PT-12"
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 CO4-PT-12, 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 r066-tall-177946967700372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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