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.r034-tall-177946842100707.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 CANInsertWithFailure-PT-010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100707
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.2K Mar 6 10:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 6 10:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 10:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 6 10:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 15 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 10:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 6 10:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 6 10:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:53 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 698K 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 CANInsertWithFailure-PT-010-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779662818786

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 22:46:59] [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-24 22:46:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 22:47:00] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2026-05-24 22:47:00] [INFO ] Transformed 324 places.
[2026-05-24 22:47:00] [INFO ] Transformed 660 transitions.
[2026-05-24 22:47:00] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 35 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (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-17833941430571576706.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1177821932509344766.kers'
[2026-05-24 22:47:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17833941430571576706.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1177821932509344766.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 660 rows 323 cols 1400 entries
Finished phase 1 with 301 SingleSign rule and 10 generalized
[2026-05-24 22:47:00] [INFO ] Computed 12 invariants in 4 ms
Computed 12 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1177821932509344766.kers
Total runtime 5 ms.
[2026-05-24 22:47:00] [INFO ] Implicit Places using invariants in 312 ms returned []
[2026-05-24 22:47:00] [INFO ] Invariant cache hit.
[2026-05-24 22:47:00] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 22:47:01] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2026-05-24 22:47:01] [INFO ] Invariant cache hit.
[2026-05-24 22:47:01] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 650 unsolved
SMT process timed out in 30180ms, After SMT, problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 30203ms
Starting structural reductions in LTL mode, iteration 1 : 323/324 places, 660/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31142 ms. Remains : 323/324 places, 660/660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 14 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2026-05-24 22:47:31] [INFO ] Invariant cache hit.
[2026-05-24 22:47:31] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-24 22:47:31] [INFO ] Invariant cache hit.
[2026-05-24 22:47:31] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 22:47:32] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 594 ms. Remains : 323/323 places, 660/660 transitions.
Support contains 44 out of 323 places after structural reductions.
[2026-05-24 22:47:32] [INFO ] Flatten gal took : 60 ms
[2026-05-24 22:47:32] [INFO ] Flatten gal took : 28 ms
[2026-05-24 22:47:32] [INFO ] Input system was already deterministic with 660 transitions.
RANDOM walk for 40000 steps (184 resets) in 1109 ms. (36 steps per ms) remains 9/31 properties
BEST_FIRST walk for 40003 steps (21 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (23 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (23 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (23 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (22 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (22 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (20 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (24 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (21 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
[2026-05-24 22:47:33] [INFO ] Invariant cache hit.
[2026-05-24 22:47:33] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 296/305 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 8/11 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 14/319 variables, 7/18 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/321 variables, 2/20 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 14/34 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/34 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 660/981 variables, 321/355 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 190/545 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/981 variables, 0/545 constraints. Problems are: Problem set: 4 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/983 variables, 2/547 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/983 variables, 0/547 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/983 variables, 0/547 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 983/983 variables, and 547 constraints, problems are : Problem set: 4 solved, 5 unsolved in 2664 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 296/301 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 8/9 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 18/319 variables, 9/18 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/321 variables, 2/20 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 14/34 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 7/41 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/41 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 660/981 variables, 321/362 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/981 variables, 190/552 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 5/557 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/981 variables, 0/557 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/983 variables, 2/559 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 0/559 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/983 variables, 0/559 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 983/983 variables, and 559 constraints, problems are : Problem set: 4 solved, 5 unsolved in 4287 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6971ms problems are : Problem set: 4 solved, 5 unsolved
Parikh walk visited 0 properties in 853 ms.
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 253 transition count 590
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 318 place count 164 transition count 501
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 2 with 71 rules applied. Total rules applied 389 place count 164 transition count 430
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 390 place count 164 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 391 place count 163 transition count 429
Partial Free-agglomeration rule applied 107 times.
Drop transitions (Partial Free agglomeration) removed 107 transitions
Iterating global reduction 3 with 107 rules applied. Total rules applied 498 place count 163 transition count 429
Applied a total of 498 rules in 87 ms. Remains 163 /323 variables (removed 160) and now considering 429/660 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 163/323 places, 429/660 transitions.
RANDOM walk for 40000 steps (812 resets) in 642 ms. (62 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (77 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (73 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (79 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (79 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (74 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 871974 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :0 out of 5
Probabilistic random walk after 871974 steps, saw 113751 distinct states, run finished after 3006 ms. (steps per millisecond=290 ) 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-4184973745376349890.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13363631969452876218.kers'
[2026-05-24 22:47:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4184973745376349890.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13363631969452876218.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 429 rows 163 cols 946 entries
Finished phase 1 with 141 SingleSign rule and 10 generalized
[2026-05-24 22:47:44] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13363631969452876218.kers
Total runtime 2 ms.
[2026-05-24 22:47:44] [INFO ] State equation strengthened by 393 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 136/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 18/159 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/161 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 429/590 variables, 161/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/590 variables, 393/568 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/590 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/592 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/592 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/592 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 592/592 variables, and 570 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1632 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 163/163 constraints, ReadFeed: 393/393 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 136/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 18/159 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/161 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 429/590 variables, 161/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/590 variables, 393/575 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 5/580 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/590 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/592 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/592 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/592 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 592/592 variables, and 582 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2519 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 163/163 constraints, ReadFeed: 393/393 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4163ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 526 ms.
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 429/429 transitions.
Applied a total of 0 rules in 9 ms. Remains 163 /163 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 163/163 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 429/429 transitions.
Applied a total of 0 rules in 8 ms. Remains 163 /163 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2026-05-24 22:47:49] [INFO ] Invariant cache hit.
[2026-05-24 22:47:49] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-24 22:47:49] [INFO ] Invariant cache hit.
[2026-05-24 22:47:49] [INFO ] State equation strengthened by 393 read => feed constraints.
[2026-05-24 22:47:50] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1442 ms to find 0 implicit places.
[2026-05-24 22:47:50] [INFO ] Redundant transitions in 34 ms returned []
Running 419 sub problems to find dead transitions.
[2026-05-24 22:47:50] [INFO ] Invariant cache hit.
[2026-05-24 22:47:50] [INFO ] State equation strengthened by 393 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 9 (OVERLAPS) 429/591 variables, 162/258 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 393/651 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/592 variables, and 651 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 162/163 constraints, ReadFeed: 393/393 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 429/591 variables, 162/258 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD428 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/591 variables, 393/651 constraints. Problems are: Problem set: 12 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/591 variables, 407/1058 constraints. Problems are: Problem set: 12 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 591/592 variables, and 1058 constraints, problems are : Problem set: 12 solved, 407 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 162/163 constraints, ReadFeed: 393/393 constraints, PredecessorRefiner: 407/419 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 12 solved, 407 unsolved
Search for dead transitions found 12 dead transitions in 60113ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 163/163 places, 417/429 transitions.
Graph (complete) has 725 edges and 163 vertex of which 161 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 153 transition count 401
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 153 transition count 401
Applied a total of 17 rules in 17 ms. Remains 153 /163 variables (removed 10) and now considering 401/417 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2901648323261659568.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16974641089226816846.kers'
[2026-05-24 22:48:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2901648323261659568.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16974641089226816846.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 401 rows 153 cols 848 entries
Finished phase 1 with 140 SingleSign rule and 1 generalized
[2026-05-24 22:48:50] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16974641089226816846.kers
Total runtime 2 ms.
[2026-05-24 22:48:50] [INFO ] Implicit Places using invariants in 101 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 152/163 places, 401/429 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 151 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 151 transition count 400
Applied a total of 10 rules in 33 ms. Remains 151 /152 variables (removed 1) and now considering 400/401 (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-2370939510282798884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-321101723322004360.kers'
[2026-05-24 22:48:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2370939510282798884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-321101723322004360.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 400 rows 151 cols 852 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-24 22:48:50] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-321101723322004360.kers
Total runtime 2 ms.
[2026-05-24 22:48:51] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-24 22:48:51] [INFO ] Invariant cache hit.
[2026-05-24 22:48:51] [INFO ] State equation strengthened by 364 read => feed constraints.
[2026-05-24 22:48:52] [INFO ] Implicit Places using invariants and state equation in 1634 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1729 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 150/163 places, 400/429 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 148 transition count 398
Applied a total of 4 rules in 16 ms. Remains 148 /150 variables (removed 2) and now considering 398/400 (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-14733320069258419277.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2988837694326809072.kers'
[2026-05-24 22:48:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14733320069258419277.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2988837694326809072.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 148 cols 852 entries
Finished phase 1 with 137 SingleSign rule and 1 generalized
[2026-05-24 22:48:52] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2988837694326809072.kers
Total runtime 2 ms.
[2026-05-24 22:48:52] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-24 22:48:52] [INFO ] Invariant cache hit.
[2026-05-24 22:48:52] [INFO ] State equation strengthened by 355 read => feed constraints.
[2026-05-24 22:48:54] [INFO ] Implicit Places using invariants and state equation in 1615 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 148/163 places, 398/429 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 65213 ms. Remains : 148/163 places, 398/429 transitions.
RANDOM walk for 40000 steps (891 resets) in 170 ms. (233 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (85 resets) in 32 ms. (1212 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (80 resets) in 31 ms. (1250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (82 resets) in 28 ms. (1379 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (82 resets) in 29 ms. (1333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (82 resets) in 29 ms. (1333 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 857942 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :0 out of 5
Probabilistic random walk after 857942 steps, saw 108615 distinct states, run finished after 3001 ms. (steps per millisecond=285 ) properties seen :0
[2026-05-24 22:48:57] [INFO ] Invariant cache hit.
[2026-05-24 22:48:57] [INFO ] State equation strengthened by 355 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 156/181 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 245/426 variables, 77/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 257/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/427 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 16/443 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/443 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 9/452 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/452 variables, 5/400 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/452 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 88/540 variables, 37/437 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/540 variables, 70/507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/540 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 6/546 variables, 4/511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/546 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 0/546 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 513 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2193 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 156/181 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 245/426 variables, 77/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 257/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/427 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 16/443 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/443 variables, 5/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/443 variables, 4/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/443 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 9/452 variables, 5/400 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/452 variables, 5/405 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/452 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 88/540 variables, 37/442 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/540 variables, 70/512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/540 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 6/546 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/546 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/546 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/546 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 518 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1821 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4019ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 804 ms.
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 398/398 transitions.
Applied a total of 0 rules in 8 ms. Remains 148 /148 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 148/148 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 398/398 transitions.
Applied a total of 0 rules in 7 ms. Remains 148 /148 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2026-05-24 22:49:02] [INFO ] Invariant cache hit.
[2026-05-24 22:49:02] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-24 22:49:02] [INFO ] Invariant cache hit.
[2026-05-24 22:49:02] [INFO ] State equation strengthened by 355 read => feed constraints.
[2026-05-24 22:49:04] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 1691 ms to find 0 implicit places.
[2026-05-24 22:49:04] [INFO ] Redundant transitions in 11 ms returned []
Running 388 sub problems to find dead transitions.
[2026-05-24 22:49:04] [INFO ] Invariant cache hit.
[2026-05-24 22:49:04] [INFO ] State equation strengthened by 355 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (OVERLAPS) 398/545 variables, 147/157 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 355/512 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/546 variables, and 512 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/148 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (OVERLAPS) 398/545 variables, 147/157 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 355/512 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 388/900 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 7 (OVERLAPS) 1/546 variables, 1/901 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 901 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 388 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61801 ms. Remains : 148/148 places, 398/398 transitions.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
Computed a total of 42 stabilizing places and 70 stable transitions
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-01 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' '!(X(F((p0&&X(F((p1&&X(p2))))))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (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-6163465220374635615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-196176634593273527.kers'
[2026-05-24 22:50:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6163465220374635615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-196176634593273527.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 660 rows 323 cols 1400 entries
Finished phase 1 with 301 SingleSign rule and 10 generalized
[2026-05-24 22:50:04] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-196176634593273527.kers
Total runtime 4 ms.
[2026-05-24 22:50:04] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-24 22:50:04] [INFO ] Invariant cache hit.
[2026-05-24 22:50:04] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 22:50:05] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2026-05-24 22:50:05] [INFO ] Invariant cache hit.
[2026-05-24 22:50:05] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/983 variables, and 51 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 99 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Finished structural reductions in LTL mode , in 1 iterations and 60713 ms. Remains : 323/323 places, 660/660 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((p0&&X(F((p1&&X(p2))))))))'
Stuttering acceptance computed with spot in 348 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-00
Stuttering criterion allowed to conclude after 180 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-00 finished in 61148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2026-05-24 22:51:05] [INFO ] Invariant cache hit.
[2026-05-24 22:51:05] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-24 22:51:05] [INFO ] Invariant cache hit.
[2026-05-24 22:51:05] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 22:51:06] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 637 ms. Remains : 323/323 places, 660/660 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-02
Product exploration explored 100000 steps with 25000 reset in 208 ms.
Product exploration explored 100000 steps with 25000 reset in 196 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge based reduction with 1 factoid took 48 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (178 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (22 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1000807 steps, run timeout after 3004 ms. (steps per millisecond=333 ) properties seen :0 out of 1
Probabilistic random walk after 1000807 steps, saw 168418 distinct states, run finished after 3005 ms. (steps per millisecond=333 ) properties seen :0
[2026-05-24 22:51:10] [INFO ] Invariant cache hit.
[2026-05-24 22:51:10] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 300/301 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/319 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/321 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 660/981 variables, 321/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 190/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/981 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/983 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/983 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/983 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 983/983 variables, and 532 constraints, problems are : Problem set: 0 solved, 1 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 300/301 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/319 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/321 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 660/981 variables, 321/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/981 variables, 190/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/981 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/983 variables, 2/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/983 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 983/983 variables, and 547 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2344 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3186ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 253 transition count 590
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 320 place count 163 transition count 500
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 2 with 72 rules applied. Total rules applied 392 place count 163 transition count 428
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 163 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 162 transition count 427
Partial Free-agglomeration rule applied 110 times.
Drop transitions (Partial Free agglomeration) removed 110 transitions
Iterating global reduction 3 with 110 rules applied. Total rules applied 504 place count 162 transition count 427
Applied a total of 504 rules in 37 ms. Remains 162 /323 variables (removed 161) and now considering 427/660 (removed 233) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 162/323 places, 427/660 transitions.
RANDOM walk for 40000 steps (825 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (77 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1490601 steps, run timeout after 3001 ms. (steps per millisecond=496 ) properties seen :0 out of 1
Probabilistic random walk after 1490601 steps, saw 194857 distinct states, run finished after 3001 ms. (steps per millisecond=496 ) 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-16904756230820068460.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13473001475320395642.kers'
[2026-05-24 22:51:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16904756230820068460.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13473001475320395642.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 427 rows 162 cols 942 entries
Finished phase 1 with 140 SingleSign rule and 10 generalized
[2026-05-24 22:51:16] [INFO ] Computed 12 invariants in 4 ms
Computed 12 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13473001475320395642.kers
Total runtime 6 ms.
[2026-05-24 22:51:16] [INFO ] State equation strengthened by 397 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 139/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/158 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/160 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 427/587 variables, 160/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/587 variables, 397/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/587 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/589 variables, 2/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/589 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 573 constraints, problems are : Problem set: 0 solved, 1 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 162/162 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 139/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/158 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/160 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 427/587 variables, 160/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/587 variables, 397/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/587 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/589 variables, 2/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/589 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/589 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 589/589 variables, and 577 constraints, problems are : Problem set: 0 solved, 1 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 162/162 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1154ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 427/427 transitions.
Applied a total of 0 rules in 6 ms. Remains 162 /162 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 162/162 places, 427/427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 427/427 transitions.
Applied a total of 0 rules in 5 ms. Remains 162 /162 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2026-05-24 22:51:17] [INFO ] Invariant cache hit.
[2026-05-24 22:51:17] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-24 22:51:17] [INFO ] Invariant cache hit.
[2026-05-24 22:51:17] [INFO ] State equation strengthened by 397 read => feed constraints.
[2026-05-24 22:51:19] [INFO ] Implicit Places using invariants and state equation in 2008 ms returned []
Implicit Place search using SMT with State Equation took 2246 ms to find 0 implicit places.
[2026-05-24 22:51:19] [INFO ] Redundant transitions in 6 ms returned []
Running 417 sub problems to find dead transitions.
[2026-05-24 22:51:19] [INFO ] Invariant cache hit.
[2026-05-24 22:51:19] [INFO ] State equation strengthened by 397 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (OVERLAPS) 427/588 variables, 161/257 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 397/654 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/589 variables, and 654 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 161/162 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (OVERLAPS) 427/588 variables, 161/257 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD426 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 397/654 constraints. Problems are: Problem set: 12 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 405/1059 constraints. Problems are: Problem set: 12 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/589 variables, and 1059 constraints, problems are : Problem set: 12 solved, 405 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 161/162 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 405/417 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 12 solved, 405 unsolved
Search for dead transitions found 12 dead transitions in 60093ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 162/162 places, 415/427 transitions.
Graph (complete) has 723 edges and 162 vertex of which 160 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 152 transition count 399
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 152 transition count 399
Applied a total of 17 rules in 9 ms. Remains 152 /162 variables (removed 10) and now considering 399/415 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11689658299464537053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1199793656181548518.kers'
[2026-05-24 22:52:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11689658299464537053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1199793656181548518.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 399 rows 152 cols 844 entries
Finished phase 1 with 139 SingleSign rule and 1 generalized
[2026-05-24 22:52:19] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1199793656181548518.kers
Total runtime 3 ms.
[2026-05-24 22:52:20] [INFO ] Implicit Places using invariants in 130 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 151/162 places, 399/427 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 150 transition count 406
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 150 transition count 398
Applied a total of 10 rules in 16 ms. Remains 150 /151 variables (removed 1) and now considering 398/399 (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-2704941411074072903.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8332900794070584179.kers'
[2026-05-24 22:52:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2704941411074072903.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8332900794070584179.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 150 cols 848 entries
Finished phase 1 with 139 SingleSign rule and 0 generalized
[2026-05-24 22:52:20] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8332900794070584179.kers
Total runtime 2 ms.
[2026-05-24 22:52:20] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-24 22:52:20] [INFO ] Invariant cache hit.
[2026-05-24 22:52:20] [INFO ] State equation strengthened by 368 read => feed constraints.
[2026-05-24 22:52:22] [INFO ] Implicit Places using invariants and state equation in 1879 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1986 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 149/162 places, 398/427 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 147 transition count 396
Applied a total of 4 rules in 13 ms. Remains 147 /149 variables (removed 2) and now considering 396/398 (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-4554338819213427220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7567354321848493338.kers'
[2026-05-24 22:52:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4554338819213427220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7567354321848493338.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 396 rows 147 cols 848 entries
Finished phase 1 with 136 SingleSign rule and 1 generalized
[2026-05-24 22:52:22] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7567354321848493338.kers
Total runtime 2 ms.
[2026-05-24 22:52:22] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-24 22:52:22] [INFO ] Invariant cache hit.
[2026-05-24 22:52:22] [INFO ] State equation strengthened by 359 read => feed constraints.
[2026-05-24 22:52:23] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 147/162 places, 396/427 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 66030 ms. Remains : 147/162 places, 396/427 transitions.
RANDOM walk for 40000 steps (911 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (84 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1681155 steps, run timeout after 3001 ms. (steps per millisecond=560 ) properties seen :0 out of 1
Probabilistic random walk after 1681155 steps, saw 204637 distinct states, run finished after 3001 ms. (steps per millisecond=560 ) properties seen :0
[2026-05-24 22:52:26] [INFO ] Invariant cache hit.
[2026-05-24 22:52:26] [INFO ] State equation strengthened by 359 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 143/197 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 112/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/216 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/231 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 270/501 variables, 65/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/501 variables, 232/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/501 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/543 variables, 36/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 6/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/543 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/543 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 516 constraints, problems are : Problem set: 0 solved, 1 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 359/359 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 143/197 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 112/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/216 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/231 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/231 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 270/501 variables, 65/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/501 variables, 232/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/501 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/543 variables, 36/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/543 variables, 6/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/543 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/543 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 517 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 359/359 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 656ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 396/396 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 147/147 places, 396/396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 396/396 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2026-05-24 22:52:27] [INFO ] Invariant cache hit.
[2026-05-24 22:52:27] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-24 22:52:27] [INFO ] Invariant cache hit.
[2026-05-24 22:52:27] [INFO ] State equation strengthened by 359 read => feed constraints.
[2026-05-24 22:52:28] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 1511 ms to find 0 implicit places.
[2026-05-24 22:52:28] [INFO ] Redundant transitions in 3 ms returned []
Running 386 sub problems to find dead transitions.
[2026-05-24 22:52:28] [INFO ] Invariant cache hit.
[2026-05-24 22:52:28] [INFO ] State equation strengthened by 359 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 396/542 variables, 146/156 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 359/515 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 542/543 variables, and 515 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/147 constraints, ReadFeed: 359/359 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 396/542 variables, 146/156 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 359/515 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 386/901 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (OVERLAPS) 1/543 variables, 1/902 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 902 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 359/359 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61611 ms. Remains : 147/147 places, 396/396 transitions.
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 142307 ms.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (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-16181681242151492217.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8826957573398189663.kers'
[2026-05-24 22:53:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16181681242151492217.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8826957573398189663.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 660 rows 323 cols 1400 entries
Finished phase 1 with 301 SingleSign rule and 10 generalized
[2026-05-24 22:53:29] [INFO ] Computed 12 invariants in 4 ms
Computed 12 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8826957573398189663.kers
Total runtime 6 ms.
[2026-05-24 22:53:29] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-24 22:53:29] [INFO ] Invariant cache hit.
[2026-05-24 22:53:29] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 22:53:30] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2026-05-24 22:53:30] [INFO ] Invariant cache hit.
[2026-05-24 22:53:30] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 650 unsolved
SMT process timed out in 30056ms, After SMT, problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 30058ms
Finished structural reductions in LTL mode , in 1 iterations and 30659 ms. Remains : 323/323 places, 660/660 transitions.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge based reduction with 1 factoid took 61 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (180 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (22 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 986345 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :0 out of 1
Probabilistic random walk after 986345 steps, saw 167859 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
[2026-05-24 22:54:03] [INFO ] Invariant cache hit.
[2026-05-24 22:54:03] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 300/301 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/319 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/321 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 660/981 variables, 321/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 190/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/981 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/983 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/983 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/983 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 983/983 variables, and 532 constraints, problems are : Problem set: 0 solved, 1 unsolved in 829 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 300/301 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/319 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/321 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 660/981 variables, 321/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/981 variables, 190/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/981 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/983 variables, 2/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/983 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 983/983 variables, and 547 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2307 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3146ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 253 transition count 590
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 320 place count 163 transition count 500
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 2 with 72 rules applied. Total rules applied 392 place count 163 transition count 428
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 163 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 162 transition count 427
Partial Free-agglomeration rule applied 110 times.
Drop transitions (Partial Free agglomeration) removed 110 transitions
Iterating global reduction 3 with 110 rules applied. Total rules applied 504 place count 162 transition count 427
Applied a total of 504 rules in 38 ms. Remains 162 /323 variables (removed 161) and now considering 427/660 (removed 233) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 162/323 places, 427/660 transitions.
RANDOM walk for 40000 steps (814 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (78 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1505044 steps, run timeout after 3001 ms. (steps per millisecond=501 ) properties seen :0 out of 1
Probabilistic random walk after 1505044 steps, saw 196765 distinct states, run finished after 3001 ms. (steps per millisecond=501 ) 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-18396835558525300790.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14208203258868114346.kers'
[2026-05-24 22:54:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18396835558525300790.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14208203258868114346.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 427 rows 162 cols 942 entries
Finished phase 1 with 140 SingleSign rule and 10 generalized
[2026-05-24 22:54:09] [INFO ] Computed 12 invariants in 5 ms
Computed 12 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-14208203258868114346.kers
Total runtime 10 ms.
[2026-05-24 22:54:09] [INFO ] State equation strengthened by 397 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 139/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/158 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/160 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 427/587 variables, 160/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/587 variables, 397/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/587 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/589 variables, 2/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/589 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 573 constraints, problems are : Problem set: 0 solved, 1 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 162/162 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 139/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/158 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/160 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 427/587 variables, 160/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/587 variables, 397/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/587 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/589 variables, 2/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/589 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/589 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 589/589 variables, and 577 constraints, problems are : Problem set: 0 solved, 1 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 162/162 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1215ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 427/427 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 162/162 places, 427/427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 427/427 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2026-05-24 22:54:10] [INFO ] Invariant cache hit.
[2026-05-24 22:54:10] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-24 22:54:11] [INFO ] Invariant cache hit.
[2026-05-24 22:54:11] [INFO ] State equation strengthened by 397 read => feed constraints.
[2026-05-24 22:54:12] [INFO ] Implicit Places using invariants and state equation in 1989 ms returned []
Implicit Place search using SMT with State Equation took 2259 ms to find 0 implicit places.
[2026-05-24 22:54:13] [INFO ] Redundant transitions in 2 ms returned []
Running 417 sub problems to find dead transitions.
[2026-05-24 22:54:13] [INFO ] Invariant cache hit.
[2026-05-24 22:54:13] [INFO ] State equation strengthened by 397 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (OVERLAPS) 427/588 variables, 161/257 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 397/654 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/589 variables, and 654 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 161/162 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (OVERLAPS) 427/588 variables, 161/257 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD426 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 397/654 constraints. Problems are: Problem set: 12 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 405/1059 constraints. Problems are: Problem set: 12 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/589 variables, and 1059 constraints, problems are : Problem set: 12 solved, 405 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 161/162 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 405/417 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60093ms problems are : Problem set: 12 solved, 405 unsolved
Search for dead transitions found 12 dead transitions in 60094ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 162/162 places, 415/427 transitions.
Graph (complete) has 723 edges and 162 vertex of which 160 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 152 transition count 399
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 152 transition count 399
Applied a total of 17 rules in 6 ms. Remains 152 /162 variables (removed 10) and now considering 399/415 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3032939536421227534.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5783999535255265273.kers'
[2026-05-24 22:55:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3032939536421227534.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5783999535255265273.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 399 rows 152 cols 844 entries
Finished phase 1 with 139 SingleSign rule and 1 generalized
[2026-05-24 22:55:13] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5783999535255265273.kers
Total runtime 1 ms.
[2026-05-24 22:55:13] [INFO ] Implicit Places using invariants in 103 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 151/162 places, 399/427 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 150 transition count 406
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 150 transition count 398
Applied a total of 10 rules in 13 ms. Remains 150 /151 variables (removed 1) and now considering 398/399 (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-13586377402363038711.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15497544845110451225.kers'
[2026-05-24 22:55:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13586377402363038711.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15497544845110451225.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 150 cols 848 entries
Finished phase 1 with 139 SingleSign rule and 0 generalized
[2026-05-24 22:55:13] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15497544845110451225.kers
Total runtime 9 ms.
[2026-05-24 22:55:13] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-24 22:55:13] [INFO ] Invariant cache hit.
[2026-05-24 22:55:13] [INFO ] State equation strengthened by 368 read => feed constraints.
[2026-05-24 22:55:15] [INFO ] Implicit Places using invariants and state equation in 1852 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1975 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 149/162 places, 398/427 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 147 transition count 396
Applied a total of 4 rules in 7 ms. Remains 147 /149 variables (removed 2) and now considering 396/398 (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-1244120961962637991.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15280761500900492948.kers'
[2026-05-24 22:55:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1244120961962637991.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15280761500900492948.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 396 rows 147 cols 848 entries
Finished phase 1 with 136 SingleSign rule and 1 generalized
[2026-05-24 22:55:15] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15280761500900492948.kers
Total runtime 4 ms.
[2026-05-24 22:55:15] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-24 22:55:15] [INFO ] Invariant cache hit.
[2026-05-24 22:55:15] [INFO ] State equation strengthened by 359 read => feed constraints.
[2026-05-24 22:55:16] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 147/162 places, 396/427 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 66053 ms. Remains : 147/162 places, 396/427 transitions.
RANDOM walk for 40000 steps (907 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (82 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1643370 steps, run timeout after 3001 ms. (steps per millisecond=547 ) properties seen :0 out of 1
Probabilistic random walk after 1643370 steps, saw 199775 distinct states, run finished after 3001 ms. (steps per millisecond=547 ) properties seen :0
[2026-05-24 22:55:19] [INFO ] Invariant cache hit.
[2026-05-24 22:55:19] [INFO ] State equation strengthened by 359 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 143/197 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 112/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/216 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/231 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 270/501 variables, 65/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/501 variables, 232/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/501 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/543 variables, 36/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 6/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/543 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/543 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 516 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 359/359 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 143/197 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 112/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/216 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/231 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/231 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 270/501 variables, 65/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/501 variables, 232/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/501 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/543 variables, 36/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/543 variables, 6/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/543 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/543 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 517 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 359/359 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 639ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 396/396 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 147/147 places, 396/396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 396/396 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2026-05-24 22:55:20] [INFO ] Invariant cache hit.
[2026-05-24 22:55:20] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-24 22:55:20] [INFO ] Invariant cache hit.
[2026-05-24 22:55:20] [INFO ] State equation strengthened by 359 read => feed constraints.
[2026-05-24 22:55:22] [INFO ] Implicit Places using invariants and state equation in 1462 ms returned []
Implicit Place search using SMT with State Equation took 1566 ms to find 0 implicit places.
[2026-05-24 22:55:22] [INFO ] Redundant transitions in 2 ms returned []
Running 386 sub problems to find dead transitions.
[2026-05-24 22:55:22] [INFO ] Invariant cache hit.
[2026-05-24 22:55:22] [INFO ] State equation strengthened by 359 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 396/542 variables, 146/156 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 359/515 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 542/543 variables, and 515 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/147 constraints, ReadFeed: 359/359 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 396/542 variables, 146/156 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 359/515 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 386/901 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (OVERLAPS) 1/543 variables, 1/902 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 902 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 359/359 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61647 ms. Remains : 147/147 places, 396/396 transitions.
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 142326 ms.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 133 ms.
Product exploration explored 100000 steps with 25000 reset in 138 ms.
Spot run failed in 78 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/ltsmin15894993988028685748
[2026-05-24 22:56:23] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15894993988028685748
Running compilation step : cd /tmp/ltsmin15894993988028685748;'/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 1040 ms.
Running link step : cd /tmp/ltsmin15894993988028685748;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin15894993988028685748;'/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/stateBased6879314262005078559.hoa' '--buchi-type=spotba'
LTSmin run took 54 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-02 finished in 318586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (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-16337129757450626881.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14672072532488490477.kers'
[2026-05-24 22:56:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16337129757450626881.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14672072532488490477.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 660 rows 323 cols 1400 entries
Finished phase 1 with 301 SingleSign rule and 10 generalized
[2026-05-24 22:56:24] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14672072532488490477.kers
Total runtime 3 ms.
[2026-05-24 22:56:24] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-24 22:56:24] [INFO ] Invariant cache hit.
[2026-05-24 22:56:24] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 22:56:24] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2026-05-24 22:56:24] [INFO ] Invariant cache hit.
[2026-05-24 22:56:24] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 650 unsolved
SMT process timed out in 30107ms, After SMT, problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 30108ms
Finished structural reductions in LTL mode , in 1 iterations and 30694 ms. Remains : 323/323 places, 660/660 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-03
Stuttering criterion allowed to conclude after 164 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-03 finished in 30826 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)&&(p1||G(!p2)))))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2026-05-24 22:56:55] [INFO ] Invariant cache hit.
[2026-05-24 22:56:55] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-24 22:56:55] [INFO ] Invariant cache hit.
[2026-05-24 22:56:55] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 22:56:55] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 599 ms. Remains : 323/323 places, 660/660 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)&&(p1||G(p2)))))'
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-06 finished in 776 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(p0))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2026-05-24 22:56:55] [INFO ] Invariant cache hit.
[2026-05-24 22:56:55] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-24 22:56:55] [INFO ] Invariant cache hit.
[2026-05-24 22:56:56] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 22:56:56] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 626 ms. Remains : 323/323 places, 660/660 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(p0))))'
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-07 finished in 759 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) U p1) U X(X(G((p1||F(!p0)))))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 323 transition count 592
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 136 place count 255 transition count 592
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 136 place count 255 transition count 591
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 314 place count 166 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 2 with 71 rules applied. Total rules applied 385 place count 166 transition count 432
Applied a total of 385 rules in 41 ms. Remains 166 /323 variables (removed 157) and now considering 432/660 (removed 228) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6832972084876353827.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16482498966743074657.kers'
[2026-05-24 22:56:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6832972084876353827.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16482498966743074657.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 432 rows 166 cols 935 entries
Finished phase 1 with 144 SingleSign rule and 10 generalized
[2026-05-24 22:56:56] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16482498966743074657.kers
Total runtime 1 ms.
[2026-05-24 22:56:56] [INFO ] Implicit Places using invariants in 276 ms returned []
[2026-05-24 22:56:56] [INFO ] Invariant cache hit.
[2026-05-24 22:56:57] [INFO ] State equation strengthened by 286 read => feed constraints.
[2026-05-24 22:56:57] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2026-05-24 22:56:57] [INFO ] Redundant transitions in 2 ms returned []
Running 422 sub problems to find dead transitions.
[2026-05-24 22:56:57] [INFO ] Invariant cache hit.
[2026-05-24 22:56:57] [INFO ] State equation strengthened by 286 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 8 (OVERLAPS) 432/597 variables, 165/259 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 286/545 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/598 variables, and 545 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/166 constraints, ReadFeed: 286/286 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 82/94 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (OVERLAPS) 432/597 variables, 165/260 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 286/546 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 422/968 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/598 variables, and 968 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/166 constraints, ReadFeed: 286/286 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 83/83 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Starting structural reductions in SI_LTL mode, iteration 1 : 166/323 places, 432/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60872 ms. Remains : 166/323 places, 432/660 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) U p1) U X(X(G((p1||F(!p0)))))))'
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-09
Stuttering criterion allowed to conclude after 95 steps with 1 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-09 finished in 60987 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) U X((p1||X((X(((p1 U p2) U G(p3))) U (p1&&X(((p1 U p2) U G(p3))))))))))'
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (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-2767377060150488773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7166281486468704556.kers'
[2026-05-24 22:57:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2767377060150488773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7166281486468704556.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 660 rows 323 cols 1400 entries
Finished phase 1 with 301 SingleSign rule and 10 generalized
[2026-05-24 22:57:57] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7166281486468704556.kers
Total runtime 3 ms.
[2026-05-24 22:57:57] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-24 22:57:57] [INFO ] Invariant cache hit.
[2026-05-24 22:57:57] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 22:57:58] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2026-05-24 22:57:58] [INFO ] Invariant cache hit.
[2026-05-24 22:57:58] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 650 unsolved
SMT process timed out in 30117ms, After SMT, problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 30118ms
Finished structural reductions in LTL mode , in 1 iterations and 30725 ms. Remains : 323/323 places, 660/660 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) U X((p1||X((X(((p1 U p2) U G(p3))) U (p1&&X(((p1 U p2) U G(p3))))))))))'
Stuttering acceptance computed with spot in 317 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 12 ms. Proved property starting from automaton with 8 states, 17 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 20 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-12 finished in 31491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 323 transition count 592
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 137 place count 255 transition count 591
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 318 place count 164 transition count 501
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 3 with 72 rules applied. Total rules applied 390 place count 164 transition count 429
Applied a total of 390 rules in 35 ms. Remains 164 /323 variables (removed 159) and now considering 429/660 (removed 231) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4169536875399445460.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6476765128149343785.kers'
[2026-05-24 22:58:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4169536875399445460.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6476765128149343785.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 429 rows 164 cols 928 entries
Finished phase 1 with 142 SingleSign rule and 10 generalized
[2026-05-24 22:58:29] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6476765128149343785.kers
Total runtime 4 ms.
[2026-05-24 22:58:29] [INFO ] Implicit Places using invariants in 201 ms returned []
[2026-05-24 22:58:29] [INFO ] Invariant cache hit.
[2026-05-24 22:58:29] [INFO ] State equation strengthened by 288 read => feed constraints.
[2026-05-24 22:58:29] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2026-05-24 22:58:29] [INFO ] Redundant transitions in 5 ms returned []
Running 419 sub problems to find dead transitions.
[2026-05-24 22:58:29] [INFO ] Invariant cache hit.
[2026-05-24 22:58:29] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 7 (OVERLAPS) 429/592 variables, 163/255 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/592 variables, 288/543 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/593 variables, and 543 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 163/164 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 80/92 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (OVERLAPS) 429/592 variables, 163/258 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 288/546 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 419/965 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/593 variables, and 965 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 163/164 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 83/83 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in SI_LTL mode, iteration 1 : 164/323 places, 429/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60816 ms. Remains : 164/323 places, 429/660 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-14
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-14 finished in 60908 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&&F(p1)))&&X((p2&&(p1||X(X(p0))))))))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (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-10564349143766908096.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1260226739451016981.kers'
[2026-05-24 22:59:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10564349143766908096.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1260226739451016981.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 660 rows 323 cols 1400 entries
Finished phase 1 with 301 SingleSign rule and 10 generalized
[2026-05-24 22:59:30] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1260226739451016981.kers
Total runtime 3 ms.
[2026-05-24 22:59:30] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-24 22:59:30] [INFO ] Invariant cache hit.
[2026-05-24 22:59:30] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 22:59:30] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2026-05-24 22:59:30] [INFO ] Invariant cache hit.
[2026-05-24 22:59:30] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 650 unsolved
SMT process timed out in 30063ms, After SMT, problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 30069ms
Finished structural reductions in LTL mode , in 1 iterations and 30686 ms. Remains : 323/323 places, 660/660 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((p0&&F(p1)))&&X((p2&&(p1||X(X(p0))))))))'
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-15 finished in 30979 ms.
All properties solved by simple procedures.
Total runtime 780995 ms.

BK_STOP 1779663601036

--------------------
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="CANInsertWithFailure-PT-010"
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 CANInsertWithFailure-PT-010, 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 r034-tall-177946842100707"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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