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.r098-tall-177955695800867.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 DoubleExponent-PT-003, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800867
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.8K Mar 6 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 6 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 6 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Mar 6 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 6 16:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 6 16:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 50K 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 DoubleExponent-PT-003-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779676554013

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 02:35:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 02:35:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 02:35:55] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2026-05-25 02:35:55] [INFO ] Transformed 163 places.
[2026-05-25 02:35:55] [INFO ] Transformed 148 transitions.
[2026-05-25 02:35:55] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 46 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 148
Applied a total of 1 rules in 38 ms. Remains 162 /163 variables (removed 1) and now considering 148/148 (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-5943054804500012107.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1064047413863064570.kers'
[2026-05-25 02:35:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5943054804500012107.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1064047413863064570.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 162 cols 416 entries
Finished phase 1 with 134 SingleSign rule and 10 generalized
[2026-05-25 02:35:55] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1064047413863064570.kers
Total runtime 2 ms.
[2026-05-25 02:35:55] [INFO ] Implicit Places using invariants in 304 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 338 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/163 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 160 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 160 transition count 147
Applied a total of 2 rules in 12 ms. Remains 160 /161 variables (removed 1) and now considering 147/148 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-796109543601637528.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13697291033161435949.kers'
[2026-05-25 02:35:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-796109543601637528.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13697291033161435949.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 160 cols 411 entries
Finished phase 1 with 131 SingleSign rule and 12 generalized
[2026-05-25 02:35:55] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13697291033161435949.kers
Total runtime 1 ms.
[2026-05-25 02:35:56] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-25 02:35:56] [INFO ] Invariant cache hit.
[2026-05-25 02:35:56] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/163 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 740 ms. Remains : 160/163 places, 147/148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 147/147 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2026-05-25 02:35:56] [INFO ] Invariant cache hit.
[2026-05-25 02:35:56] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-25 02:35:56] [INFO ] Invariant cache hit.
[2026-05-25 02:35:56] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-25 02:35:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 2/158 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 2/160 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 147/307 variables, 160/195 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/307 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/307 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/307 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 17 (OVERLAPS) 0/307 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 211 constraints, problems are : Problem set: 0 solved, 146 unsolved in 25692 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 2/158 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 2/160 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 147/307 variables, 160/208 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 146/354 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 10/368 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/307 variables, and 368 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 55773ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 55787ms
Finished structural reductions in LTL mode , in 1 iterations and 56960 ms. Remains : 160/160 places, 147/147 transitions.
Support contains 46 out of 160 places after structural reductions.
[2026-05-25 02:36:53] [INFO ] Flatten gal took : 65 ms
[2026-05-25 02:36:53] [INFO ] Flatten gal took : 28 ms
[2026-05-25 02:36:53] [INFO ] Input system was already deterministic with 147 transitions.
RANDOM walk for 40000 steps (1320 resets) in 1537 ms. (26 steps per ms) remains 29/37 properties
BEST_FIRST walk for 4002 steps (110 resets) in 45 ms. (87 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (108 resets) in 152 ms. (26 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (113 resets) in 57 ms. (68 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (109 resets) in 83 ms. (47 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (110 resets) in 58 ms. (67 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (108 resets) in 44 ms. (88 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (111 resets) in 40 ms. (97 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (112 resets) in 38 ms. (102 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (113 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (111 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (114 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (118 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (112 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (116 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (117 resets) in 39 ms. (100 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (115 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (113 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (116 resets) in 44 ms. (88 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (106 resets) in 40 ms. (97 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (108 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (109 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (108 resets) in 28 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (109 resets) in 44 ms. (88 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (109 resets) in 45 ms. (86 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (106 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (117 resets) in 28 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (100 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (117 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (100 resets) in 29 ms. (133 steps per ms) remains 27/29 properties
[2026-05-25 02:36:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 1 (OVERLAPS) 105/144 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 21 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/6 constraints. Problems are: Problem set: 9 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 16/160 variables, 11/17 constraints. Problems are: Problem set: 9 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/17 constraints. Problems are: Problem set: 9 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 147/307 variables, 160/177 constraints. Problems are: Problem set: 9 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/177 constraints. Problems are: Problem set: 9 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 3/180 constraints. Problems are: Problem set: 9 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 2/182 constraints. Problems are: Problem set: 9 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/182 constraints. Problems are: Problem set: 9 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 0/307 variables, 0/182 constraints. Problems are: Problem set: 9 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 182 constraints, problems are : Problem set: 9 solved, 18 unsolved in 1434 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 113/143 variables, 5/5 constraints. Problems are: Problem set: 9 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 1/6 constraints. Problems are: Problem set: 9 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 18 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 4 (OVERLAPS) 17/160 variables, 12/18 constraints. Problems are: Problem set: 10 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 4/22 constraints. Problems are: Problem set: 10 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 7/29 constraints. Problems are: Problem set: 10 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/29 constraints. Problems are: Problem set: 10 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 147/307 variables, 160/189 constraints. Problems are: Problem set: 10 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 17/206 constraints. Problems are: Problem set: 10 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 5/211 constraints. Problems are: Problem set: 10 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 1/212 constraints. Problems are: Problem set: 10 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 1/213 constraints. Problems are: Problem set: 10 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 1/214 constraints. Problems are: Problem set: 10 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/307 variables, 0/214 constraints. Problems are: Problem set: 10 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 0/307 variables, 0/214 constraints. Problems are: Problem set: 10 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 214 constraints, problems are : Problem set: 10 solved, 17 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 17/27 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6458ms problems are : Problem set: 10 solved, 17 unsolved
Fused 17 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 582 ms.
Support contains 28 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 147/147 transitions.
Graph (complete) has 264 edges and 160 vertex of which 159 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 159 transition count 134
Reduce places removed 13 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 21 rules applied. Total rules applied 35 place count 146 transition count 126
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 43 place count 138 transition count 126
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 43 place count 138 transition count 121
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 53 place count 133 transition count 121
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 85 place count 117 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 115 transition count 105
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 115 transition count 102
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 95 place count 112 transition count 102
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 107 place count 112 transition count 90
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 119 place count 100 transition count 90
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 124 place count 100 transition count 90
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 100 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 126 place count 99 transition count 89
Applied a total of 126 rules in 59 ms. Remains 99 /160 variables (removed 61) and now considering 89/147 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 99/160 places, 89/147 transitions.
RANDOM walk for 40000 steps (3420 resets) in 468 ms. (85 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4001 steps (237 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (234 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (242 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (233 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (240 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (249 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (251 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (238 resets) in 22 ms. (173 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (254 resets) in 22 ms. (173 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (244 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (239 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (252 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (240 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (242 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (246 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (239 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
Probabilistic random walk after 1000000 steps, saw 500398 distinct states, run finished after 2625 ms. (steps per millisecond=380 ) properties seen :15
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-539747675384869036.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1642953274768657858.kers'
[2026-05-25 02:37:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-539747675384869036.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1642953274768657858.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 99 cols 314 entries
Finished phase 1 with 72 SingleSign rule and 11 generalized
[2026-05-25 02:37:04] [INFO ] Computed 16 invariants in 3 ms
Computed 16 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1642953274768657858.kers
Total runtime 8 ms.
[2026-05-25 02:37:04] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/75 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/98 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 89/187 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/188 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/188 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 99/99 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/75 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/98 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 89/187 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/188 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/188 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/188 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 99/99 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 599ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 89/89 transitions.
Graph (complete) has 247 edges and 99 vertex of which 95 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 95 transition count 81
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 89 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 88 transition count 80
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 88 transition count 77
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 85 transition count 77
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 38 place count 77 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 76 transition count 69
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 76 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 42 place count 75 transition count 68
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 49 place count 75 transition count 61
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 56 place count 68 transition count 61
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 61 place count 68 transition count 61
Applied a total of 61 rules in 19 ms. Remains 68 /99 variables (removed 31) and now considering 61/89 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 68/99 places, 61/89 transitions.
RANDOM walk for 40000 steps (4650 resets) in 459 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (2915 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1432779 steps, run timeout after 3001 ms. (steps per millisecond=477 ) properties seen :0 out of 1
Probabilistic random walk after 1432779 steps, saw 716425 distinct states, run finished after 3003 ms. (steps per millisecond=477 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17215390103959075998.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17885798939506419452.kers'
[2026-05-25 02:37:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17215390103959075998.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17885798939506419452.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 61 rows 68 cols 292 entries
Finished phase 1 with 40 SingleSign rule and 13 generalized
[2026-05-25 02:37:08] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17885798939506419452.kers
Total runtime 2 ms.
[2026-05-25 02:37:08] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/31 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/63 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/68 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 61/129 variables, 68/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 1 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 68/68 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/31 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/63 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/68 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 61/129 variables, 68/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/129 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/129 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/129 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 574 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 68/68 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 643ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 68/68 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:37:09] [INFO ] Invariant cache hit.
[2026-05-25 02:37:09] [INFO ] Implicit Places using invariants in 64 ms returned [14, 19, 36, 41, 60, 65]
[2026-05-25 02:37:09] [INFO ] Actually due to overlaps returned [41, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 66/68 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 71 ms. Remains : 66/68 places, 61/61 transitions.
RANDOM walk for 40000 steps (4656 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (2887 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1472017 steps, run timeout after 3001 ms. (steps per millisecond=490 ) properties seen :0 out of 1
Probabilistic random walk after 1472017 steps, saw 736031 distinct states, run finished after 3007 ms. (steps per millisecond=489 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13825134411824344112.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12515312112027247798.kers'
[2026-05-25 02:37:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13825134411824344112.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12515312112027247798.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 61 rows 66 cols 282 entries
Finished phase 1 with 47 SingleSign rule and 6 generalized
[2026-05-25 02:37:12] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12515312112027247798.kers
Total runtime 3 ms.
[2026-05-25 02:37:12] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/46 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/64 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/66 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 61/127 variables, 66/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 89 constraints, problems are : Problem set: 0 solved, 1 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 66/66 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/46 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/64 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/66 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 61/127 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/127 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/127 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/127 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/127 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/127 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 66/66 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 432ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 66/66 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-25 02:37:12] [INFO ] Invariant cache hit.
[2026-05-25 02:37:12] [INFO ] Implicit Places using invariants in 64 ms returned [14, 19, 58, 63]
[2026-05-25 02:37:12] [INFO ] Actually due to overlaps returned [14, 58]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 64/66 places, 61/61 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 63 transition count 60
Applied a total of 3 rules in 5 ms. Remains 63 /64 variables (removed 1) and now considering 60/61 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8572996866196596285.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6899722770842602837.kers'
[2026-05-25 02:37:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8572996866196596285.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6899722770842602837.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 60 rows 63 cols 274 entries
Finished phase 1 with 50 SingleSign rule and 2 generalized
[2026-05-25 02:37:12] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6899722770842602837.kers
Total runtime 1 ms.
[2026-05-25 02:37:12] [INFO ] Implicit Places using invariants in 50 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 62/66 places, 60/61 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 59
Applied a total of 2 rules in 5 ms. Remains 61 /62 variables (removed 1) and now considering 59/60 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5507084084753010720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18282750562476617153.kers'
[2026-05-25 02:37:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5507084084753010720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18282750562476617153.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 59 rows 61 cols 268 entries
Finished phase 1 with 49 SingleSign rule and 2 generalized
[2026-05-25 02:37:12] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18282750562476617153.kers
Total runtime 0 ms.
[2026-05-25 02:37:12] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-25 02:37:12] [INFO ] Invariant cache hit.
[2026-05-25 02:37:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:37:13] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 61/66 places, 59/61 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 274 ms. Remains : 61/66 places, 59/61 transitions.
RANDOM walk for 40000 steps (4653 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (2929 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
Probably explored full state space saw : 683466 states, properties seen :0
Probabilistic random walk after 1366967 steps, saw 683466 distinct states, run finished after 2649 ms. (steps per millisecond=516 ) properties seen :0
Interrupted probabilistic random walk after 1589701 steps, run timeout after 3032 ms. (steps per millisecond=524 ) properties seen :0 out of 1
Exhaustive walk after 1589701 steps, saw 794936 distinct states, run finished after 3033 ms. (steps per millisecond=524 ) properties seen :0
[2026-05-25 02:37:18] [INFO ] Invariant cache hit.
[2026-05-25 02:37:18] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/58 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/60 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 59/119 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/120 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/120 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 61/61 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/58 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/60 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/119 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/119 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/119 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/120 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/120 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/120 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 89 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 61/61 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 471ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 61/61 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2026-05-25 02:37:19] [INFO ] Invariant cache hit.
[2026-05-25 02:37:19] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 02:37:19] [INFO ] Invariant cache hit.
[2026-05-25 02:37:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:37:19] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2026-05-25 02:37:19] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2026-05-25 02:37:19] [INFO ] Invariant cache hit.
[2026-05-25 02:37:19] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 59/120 variables, 61/74 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 84 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1431 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 61/61 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 59/120 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 58/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 145 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3118 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 61/61 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 4557ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 4558ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4712 ms. Remains : 61/61 places, 59/59 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 61 transition count 58
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 60 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 59 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 59 transition count 57
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 59 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 57 transition count 55
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 57 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 56 transition count 54
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 56 transition count 54
Applied a total of 11 rules in 18 ms. Remains 56 /61 variables (removed 5) and now considering 54/59 (removed 5) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17299996456112766458.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1903116698688477951.kers'
[2026-05-25 02:37:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17299996456112766458.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1903116698688477951.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 54 rows 56 cols 254 entries
Finished phase 1 with 44 SingleSign rule and 2 generalized
[2026-05-25 02:37:24] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1903116698688477951.kers
Total runtime 1 ms.
[2026-05-25 02:37:24] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 02:37:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:37:24] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:37:24] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 02:37:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 02:37:24] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 02:37:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 120 ms
TRAPS : Iteration 1
[2026-05-25 02:37:24] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 02:37:24] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 261 ms.
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-003-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 264 edges and 160 vertex of which 155 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
FORMULA DoubleExponent-PT-003-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 147/147 transitions.
Graph (complete) has 264 edges and 160 vertex of which 156 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 155 transition count 113
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 123 transition count 113
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 65 place count 123 transition count 107
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 77 place count 117 transition count 107
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 133 place count 89 transition count 79
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 141 place count 85 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 84 transition count 78
Applied a total of 142 rules in 21 ms. Remains 84 /160 variables (removed 76) and now considering 78/147 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9730133321966785206.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6020981419942161592.kers'
[2026-05-25 02:37:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9730133321966785206.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6020981419942161592.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 78 rows 84 cols 293 entries
Finished phase 1 with 52 SingleSign rule and 17 generalized
[2026-05-25 02:37:24] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6020981419942161592.kers
Total runtime 0 ms.
[2026-05-25 02:37:24] [INFO ] Implicit Places using invariants in 49 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/160 places, 78/147 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 81 transition count 76
Applied a total of 4 rules in 5 ms. Remains 81 /83 variables (removed 2) and now considering 76/78 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1124524287707611789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17814600954110562081.kers'
[2026-05-25 02:37:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1124524287707611789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17814600954110562081.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 76 rows 81 cols 285 entries
Finished phase 1 with 49 SingleSign rule and 18 generalized
[2026-05-25 02:37:24] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17814600954110562081.kers
Total runtime 1 ms.
[2026-05-25 02:37:24] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 02:37:24] [INFO ] Invariant cache hit.
[2026-05-25 02:37:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-25 02:37:24] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 81/160 places, 76/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 249 ms. Remains : 81/160 places, 76/147 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 231 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-00
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-00 finished in 545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 147/147 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 157 transition count 147
Applied a total of 3 rules in 3 ms. Remains 157 /160 variables (removed 3) and now considering 147/147 (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-5230302522602759020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9681157390953289017.kers'
[2026-05-25 02:37:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5230302522602759020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9681157390953289017.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 157 cols 408 entries
Finished phase 1 with 130 SingleSign rule and 12 generalized
[2026-05-25 02:37:25] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9681157390953289017.kers
Total runtime 4 ms.
[2026-05-25 02:37:25] [INFO ] Implicit Places using invariants in 144 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 145 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/160 places, 147/147 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 154 ms. Remains : 156/160 places, 147/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-01 finished in 275 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(F(p1))))'
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 147/147 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 157 transition count 147
Applied a total of 3 rules in 5 ms. Remains 157 /160 variables (removed 3) and now considering 147/147 (removed 0) transitions.
[2026-05-25 02:37:25] [INFO ] Invariant cache hit.
[2026-05-25 02:37:25] [INFO ] Implicit Places using invariants in 60 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/160 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 156/160 places, 147/147 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(F(p1))))'
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-03
Stuttering criterion allowed to conclude after 37 steps with 1 reset in 5 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-03 finished in 212 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)&&F(p1))))'
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 147/147 transitions.
Graph (complete) has 264 edges and 160 vertex of which 156 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 155 transition count 112
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 122 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 121 transition count 111
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 69 place count 121 transition count 105
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 81 place count 115 transition count 105
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 137 place count 87 transition count 77
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 145 place count 83 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 82 transition count 76
Applied a total of 146 rules in 17 ms. Remains 82 /160 variables (removed 78) and now considering 76/147 (removed 71) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8004728507858735645.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13612811485267814047.kers'
[2026-05-25 02:37:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8004728507858735645.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13612811485267814047.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 76 rows 80 cols 276 entries
Finished phase 1 with 51 SingleSign rule and 16 generalized
[2026-05-25 02:37:25] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13612811485267814047.kers
Total runtime 0 ms.
[2026-05-25 02:37:25] [INFO ] Implicit Places using invariants in 51 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/160 places, 76/147 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 79 transition count 74
Applied a total of 4 rules in 9 ms. Remains 79 /81 variables (removed 2) and now considering 74/76 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11425755647605850619.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11554076858350030877.kers'
[2026-05-25 02:37:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11425755647605850619.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11554076858350030877.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 74 rows 77 cols 268 entries
Finished phase 1 with 48 SingleSign rule and 17 generalized
[2026-05-25 02:37:25] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11554076858350030877.kers
Total runtime 0 ms.
[2026-05-25 02:37:25] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 02:37:25] [INFO ] Invariant cache hit.
[2026-05-25 02:37:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 02:37:25] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/160 places, 74/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 253 ms. Remains : 79/160 places, 74/147 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)&&F(p1))))'
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-04
Product exploration explored 100000 steps with 12937 reset in 177 ms.
Product exploration explored 100000 steps with 12933 reset in 144 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 232 edges and 79 vertex of which 78 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 5 factoid took 69 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (5246 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3173 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3101 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 264 steps, run visited all 2 properties in 8 ms. (steps per millisecond=33 )
Probabilistic random walk after 264 steps, saw 139 distinct states, run finished after 11 ms. (steps per millisecond=24 ) properties seen :2
Knowledge based reduction with 5 factoid took 55 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 403 ms.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 74/74 transitions.
Applied a total of 0 rules in 8 ms. Remains 79 /79 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2026-05-25 02:37:26] [INFO ] Invariant cache hit.
[2026-05-25 02:37:27] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 02:37:27] [INFO ] Invariant cache hit.
[2026-05-25 02:37:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 02:37:27] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2026-05-25 02:37:27] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2026-05-25 02:37:27] [INFO ] Invariant cache hit.
[2026-05-25 02:37:27] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/152 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 73 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/153 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 97 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1568 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 79/79 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/152 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 70/166 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 1/153 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 170 constraints, problems are : Problem set: 0 solved, 73 unsolved in 6141 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 79/79 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7718ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 7719ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7889 ms. Remains : 79/79 places, 74/74 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 232 edges and 79 vertex of which 78 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 5 factoid took 65 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (5180 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3104 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3120 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 264 steps, run visited all 2 properties in 4 ms. (steps per millisecond=66 )
Probabilistic random walk after 264 steps, saw 139 distinct states, run finished after 4 ms. (steps per millisecond=66 ) properties seen :2
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 396 ms.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 12926 reset in 97 ms.
Product exploration explored 100000 steps with 13006 reset in 101 ms.
Built C files in :
/tmp/ltsmin3790637004634031169
[2026-05-25 02:37:35] [INFO ] Computing symmetric may disable matrix : 74 transitions.
[2026-05-25 02:37:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:37:35] [INFO ] Computing symmetric may enable matrix : 74 transitions.
[2026-05-25 02:37:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:37:35] [INFO ] Computing Do-Not-Accords matrix : 74 transitions.
[2026-05-25 02:37:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:37:35] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3790637004634031169
Running compilation step : cd /tmp/ltsmin3790637004634031169;'/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 301 ms.
Running link step : cd /tmp/ltsmin3790637004634031169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin3790637004634031169;'/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/stateBased10891449483469109983.hoa' '--buchi-type=spotba'
LTSmin run took 58 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-003-LTLCardinality-04 finished in 10503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G(p1)))'
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 147/147 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 147
Applied a total of 2 rules in 3 ms. Remains 158 /160 variables (removed 2) and now considering 147/147 (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-8808818959480048342.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11882759289024091952.kers'
[2026-05-25 02:37:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8808818959480048342.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11882759289024091952.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 158 cols 409 entries
Finished phase 1 with 131 SingleSign rule and 11 generalized
[2026-05-25 02:37:36] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11882759289024091952.kers
Total runtime 2 ms.
[2026-05-25 02:37:36] [INFO ] Implicit Places using invariants in 134 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/160 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 157/160 places, 147/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G(p1)))'
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-05
Product exploration explored 100000 steps with 33326 reset in 122 ms.
Product exploration explored 100000 steps with 33253 reset in 126 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 259 edges and 157 vertex of which 154 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 12 factoid took 43 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (1315 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1127 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1137 resets) in 162 ms. (245 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1120 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1113 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1134 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1133 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 12668 steps, run visited all 6 properties in 80 ms. (steps per millisecond=158 )
Probabilistic random walk after 12668 steps, saw 6343 distinct states, run finished after 80 ms. (steps per millisecond=158 ) properties seen :6
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 12 factoid took 43 ms. Proved property starting from automaton with 4 states, 10 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 446 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-05 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLCardinality-05 finished in 1015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X((p1||(p2 U (p3||G(p2)))))))))'
Support contains 7 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 147/147 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 147
Applied a total of 2 rules in 5 ms. Remains 158 /160 variables (removed 2) and now considering 147/147 (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-6538506717060550387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18000564144409261320.kers'
[2026-05-25 02:37:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6538506717060550387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18000564144409261320.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 158 cols 409 entries
Finished phase 1 with 131 SingleSign rule and 12 generalized
[2026-05-25 02:37:37] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18000564144409261320.kers
Total runtime 3 ms.
[2026-05-25 02:37:37] [INFO ] Implicit Places using invariants in 68 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/160 places, 147/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 157 /157 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 157/160 places, 147/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p0||(p1 U (p2||G(p1)))))||p3))))'
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-06
Product exploration explored 100000 steps with 33333 reset in 90 ms.
Product exploration explored 100000 steps with 33333 reset in 84 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 259 edges and 157 vertex of which 154 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 19 ms. Proved property starting from automaton with 3 states, 4 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLCardinality-06 finished in 447 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(G((X(X(p0)) U (p1||X(G(!p1))))))))'
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 147/147 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 157 transition count 147
Applied a total of 3 rules in 3 ms. Remains 157 /160 variables (removed 3) and now considering 147/147 (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-3734129018985005590.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6411987212695160310.kers'
[2026-05-25 02:37:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3734129018985005590.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6411987212695160310.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 157 cols 408 entries
Finished phase 1 with 130 SingleSign rule and 12 generalized
[2026-05-25 02:37:37] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6411987212695160310.kers
Total runtime 1 ms.
[2026-05-25 02:37:37] [INFO ] Implicit Places using invariants in 71 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/160 places, 147/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 156/160 places, 147/147 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(G((X(X(p0)) U (p1||X(G(!p1))))))))'
Stuttering acceptance computed with spot in 293 ms :[true, (NOT p0), (AND (NOT p0) p1), p1, (AND (NOT p0) p1), false, false, false]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-09
Product exploration explored 100000 steps with 3303 reset in 183 ms.
Product exploration explored 100000 steps with 3365 reset in 140 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (1330 resets) in 146 ms. (272 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40000 steps (1124 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1158 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1110 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2206905707315010232.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5657362442229630675.kers'
[2026-05-25 02:37:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2206905707315010232.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5657362442229630675.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 156 cols 405 entries
Finished phase 1 with 127 SingleSign rule and 15 generalized
[2026-05-25 02:37:38] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5657362442229630675.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 91/110 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 11/121 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 128/249 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 40/289 variables, 27/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 8/297 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/297 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 5/302 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/302 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/303 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/303 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 170 constraints, problems are : Problem set: 0 solved, 3 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 91/110 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 11/121 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 128/249 variables, 121/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 40/289 variables, 27/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/289 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/289 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 8/297 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/297 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 5/302 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/302 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1/303 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/303 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/303 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 179 constraints, problems are : Problem set: 0 solved, 3 unsolved in 980 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1139ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1293 ms.
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 155 transition count 115
Reduce places removed 31 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 35 rules applied. Total rules applied 67 place count 124 transition count 111
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 120 transition count 111
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 71 place count 120 transition count 104
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 113 transition count 104
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 145 place count 83 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 153 place count 79 transition count 74
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 160 place count 79 transition count 67
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 167 place count 72 transition count 67
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 179 place count 72 transition count 67
Applied a total of 179 rules in 10 ms. Remains 72 /156 variables (removed 84) and now considering 67/147 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 72/156 places, 67/147 transitions.
RANDOM walk for 40000 steps (4054 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2874 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2890 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (2879 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2008 steps, run visited all 3 properties in 15 ms. (steps per millisecond=133 )
Probabilistic random walk after 2008 steps, saw 1035 distinct states, run finished after 15 ms. (steps per millisecond=133 ) properties seen :3
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[true, (NOT p0), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), false, false, false]
Knowledge-based reduction took 3229 ms.
Stuttering acceptance computed with spot in 319 ms :[true, (NOT p0), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), false, false, false]
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2026-05-25 02:37:41] [INFO ] Invariant cache hit.
[2026-05-25 02:37:42] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 02:37:42] [INFO ] Invariant cache hit.
[2026-05-25 02:37:42] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-25 02:37:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/303 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 8/180 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 181 constraints, problems are : Problem set: 0 solved, 146 unsolved in 12094 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/303 variables, 156/181 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 146/327 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 303/303 variables, and 331 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42129ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 42132ms
Finished structural reductions in LTL mode , in 1 iterations and 42450 ms. Remains : 156/156 places, 147/147 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (1340 resets) in 85 ms. (465 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40000 steps (1136 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1149 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1131 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
[2026-05-25 02:38:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 91/110 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 11/121 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 128/249 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 40/289 variables, 27/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 8/297 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/297 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 5/302 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/302 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/303 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/303 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 170 constraints, problems are : Problem set: 0 solved, 3 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 91/110 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 11/121 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 128/249 variables, 121/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 40/289 variables, 27/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/289 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/289 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 8/297 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/297 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 5/302 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/302 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1/303 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/303 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/303 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 179 constraints, problems are : Problem set: 0 solved, 3 unsolved in 931 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1111ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 782 ms.
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 155 transition count 115
Reduce places removed 31 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 35 rules applied. Total rules applied 67 place count 124 transition count 111
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 120 transition count 111
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 71 place count 120 transition count 104
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 113 transition count 104
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 145 place count 83 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 153 place count 79 transition count 74
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 160 place count 79 transition count 67
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 167 place count 72 transition count 67
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 179 place count 72 transition count 67
Applied a total of 179 rules in 10 ms. Remains 72 /156 variables (removed 84) and now considering 67/147 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 72/156 places, 67/147 transitions.
RANDOM walk for 40000 steps (4061 resets) in 72 ms. (547 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (2889 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (2940 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2882 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2008 steps, run visited all 3 properties in 15 ms. (steps per millisecond=133 )
Probabilistic random walk after 2008 steps, saw 1035 distinct states, run finished after 15 ms. (steps per millisecond=133 ) properties seen :3
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p0), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), false, false, false]
Knowledge-based reduction took 2666 ms.
Stuttering acceptance computed with spot in 329 ms :[true, (NOT p0), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), false, false, false]
Stuttering acceptance computed with spot in 313 ms :[true, (NOT p0), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), false, false, false]
Product exploration explored 100000 steps with 3290 reset in 99 ms.
Product exploration explored 100000 steps with 3308 reset in 107 ms.
Spot run failed in 108 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin16747503986349198473
[2026-05-25 02:38:28] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16747503986349198473
Running compilation step : cd /tmp/ltsmin16747503986349198473;'/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 333 ms.
Running link step : cd /tmp/ltsmin16747503986349198473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16747503986349198473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10006246347622454083.hoa' '--buchi-type=spotba'
LTSmin run took 54 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-003-LTLCardinality-09 finished in 50854 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||X(((p1||F(G((p2 U p3)))) U (p0&&(p1||F(G((p2 U p3))))))))))'
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 147/147 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 157 transition count 147
Applied a total of 3 rules in 4 ms. Remains 157 /160 variables (removed 3) and now considering 147/147 (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-8268406648723722936.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14592878237437821614.kers'
[2026-05-25 02:38:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8268406648723722936.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14592878237437821614.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 157 cols 408 entries
Finished phase 1 with 130 SingleSign rule and 12 generalized
[2026-05-25 02:38:28] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14592878237437821614.kers
Total runtime 2 ms.
[2026-05-25 02:38:28] [INFO ] Implicit Places using invariants in 73 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/160 places, 147/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 156/160 places, 147/147 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||X(((p1||F(G((p2 U p3)))) U (p0&&(p1||F(G((p2 U p3))))))))))'
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p3), (NOT p3)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-10
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-10 finished in 276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 147/147 transitions.
Graph (complete) has 264 edges and 160 vertex of which 157 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 156 transition count 112
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 123 transition count 112
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 67 place count 123 transition count 105
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 81 place count 116 transition count 105
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 141 place count 86 transition count 75
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 149 place count 82 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 81 transition count 74
Applied a total of 150 rules in 15 ms. Remains 81 /160 variables (removed 79) and now considering 74/147 (removed 73) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11018014906019809083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3238522773443866320.kers'
[2026-05-25 02:38:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11018014906019809083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3238522773443866320.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 74 rows 80 cols 277 entries
Finished phase 1 with 54 SingleSign rule and 12 generalized
[2026-05-25 02:38:28] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3238522773443866320.kers
Total runtime 1 ms.
[2026-05-25 02:38:28] [INFO ] Implicit Places using invariants in 50 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/160 places, 74/147 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 78 transition count 72
Applied a total of 4 rules in 2 ms. Remains 78 /80 variables (removed 2) and now considering 72/74 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3678451013251546625.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13779303270256015501.kers'
[2026-05-25 02:38:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3678451013251546625.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13779303270256015501.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 72 rows 77 cols 269 entries
Finished phase 1 with 45 SingleSign rule and 19 generalized
[2026-05-25 02:38:28] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13779303270256015501.kers
Total runtime 1 ms.
[2026-05-25 02:38:28] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 02:38:28] [INFO ] Invariant cache hit.
[2026-05-25 02:38:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 02:38:29] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/160 places, 72/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 249 ms. Remains : 78/160 places, 72/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Stuttering acceptance computed with spot in 101 ms :[p0, true, p0]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-13
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-13 finished in 373 ms.
All properties solved by simple procedures.
Total runtime 153980 ms.

BK_STOP 1779676709241

--------------------
content from stderr:

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-003, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695800867"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;