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-177946842100652.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 CANConstruction-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100652
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 7.7K Mar 6 09:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 6 09:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 6 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 6 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Mar 15 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 6 09:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 6 09:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 6 09:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 09:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:51 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 3.8M 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 CANConstruction-PT-050-LTLFireability-00
FORMULA_NAME CANConstruction-PT-050-LTLFireability-01
FORMULA_NAME CANConstruction-PT-050-LTLFireability-02
FORMULA_NAME CANConstruction-PT-050-LTLFireability-03
FORMULA_NAME CANConstruction-PT-050-LTLFireability-04
FORMULA_NAME CANConstruction-PT-050-LTLFireability-05
FORMULA_NAME CANConstruction-PT-050-LTLFireability-06
FORMULA_NAME CANConstruction-PT-050-LTLFireability-07
FORMULA_NAME CANConstruction-PT-050-LTLFireability-08
FORMULA_NAME CANConstruction-PT-050-LTLFireability-09
FORMULA_NAME CANConstruction-PT-050-LTLFireability-10
FORMULA_NAME CANConstruction-PT-050-LTLFireability-11
FORMULA_NAME CANConstruction-PT-050-LTLFireability-12
FORMULA_NAME CANConstruction-PT-050-LTLFireability-13
FORMULA_NAME CANConstruction-PT-050-LTLFireability-14
FORMULA_NAME CANConstruction-PT-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779641686893

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 16:54:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 16:54:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 16:54:48] [INFO ] Load time of PNML (sax parser for PT used): 284 ms
[2026-05-24 16:54:48] [INFO ] Transformed 5602 places.
[2026-05-24 16:54:48] [INFO ] Transformed 10400 transitions.
[2026-05-24 16:54:48] [INFO ] Parsed PT model containing 5602 places and 10400 transitions and 31000 arcs in 424 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-050-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 5602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Discarding 2388 places :
Symmetric choice reduction at 0 with 2388 rule applications. Total rules 2388 place count 3214 transition count 5624
Iterating global reduction 0 with 2388 rules applied. Total rules applied 4776 place count 3214 transition count 5624
Applied a total of 4776 rules in 852 ms. Remains 3214 /5602 variables (removed 2388) and now considering 5624/10400 (removed 4776) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7961550962733808773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-784352503714359294.kers'
[2026-05-24 16:54:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7961550962733808773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-784352503714359294.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 5624 rows 3214 cols 11548 entries
Finished phase 1 with 3063 SingleSign rule and 50 generalized
[2026-05-24 16:54:49] [INFO ] Computed 101 invariants in 25 ms
Computed 101 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-784352503714359294.kers
Total runtime 30 ms.
[2026-05-24 16:54:52] [INFO ] Implicit Places using invariants in 3123 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558, 572, 586, 600, 614, 628, 642, 656, 670, 684, 698]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 3168 ms to find 50 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3164/5602 places, 5624/10400 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 3114 transition count 5574
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 3114 transition count 5574
Applied a total of 100 rules in 805 ms. Remains 3114 /3164 variables (removed 50) and now considering 5574/5624 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2509749142518261272.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18060748669101592435.kers'
[2026-05-24 16:54:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2509749142518261272.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18060748669101592435.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 5574 rows 3114 cols 11248 entries
Finished phase 1 with 3063 SingleSign rule and 0 generalized
[2026-05-24 16:54:53] [INFO ] Computed 51 invariants in 18 ms
Computed 51 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-18060748669101592435.kers
Total runtime 22 ms.
[2026-05-24 16:54:56] [INFO ] Implicit Places using invariants in 2643 ms returned []
[2026-05-24 16:54:56] [INFO ] Invariant cache hit.
[2026-05-24 16:54:57] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 16:55:28] [INFO ] Performed 987/3114 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 16:55:58] [INFO ] Performed 1475/3114 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 16:56:28] [INFO ] Performed 1973/3114 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-24 16:56:58] [INFO ] Performed 2478/3114 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-24 16:56:58] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-24 16:56:58] [INFO ] Implicit Places using invariants and state equation in 122187 ms returned []
Implicit Place search using SMT with State Equation took 124833 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3114/5602 places, 5574/10400 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129675 ms. Remains : 3114/5602 places, 5574/10400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3114/3114 places, 5574/5574 transitions.
Applied a total of 0 rules in 316 ms. Remains 3114 /3114 variables (removed 0) and now considering 5574/5574 (removed 0) transitions.
[2026-05-24 16:56:58] [INFO ] Invariant cache hit.
[2026-05-24 16:57:01] [INFO ] Implicit Places using invariants in 2688 ms returned []
[2026-05-24 16:57:01] [INFO ] Invariant cache hit.
[2026-05-24 16:57:03] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 16:57:33] [INFO ] Performed 991/3114 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 16:58:03] [INFO ] Performed 1476/3114 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 16:58:33] [INFO ] Performed 1976/3114 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-24 16:59:03] [INFO ] Performed 2480/3114 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-24 16:59:03] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-24 16:59:03] [INFO ] Implicit Places using invariants and state equation in 122250 ms returned []
Implicit Place search using SMT with State Equation took 124942 ms to find 0 implicit places.
Running 5524 sub problems to find dead transitions.
[2026-05-24 16:59:03] [INFO ] Invariant cache hit.
[2026-05-24 16:59:03] [INFO ] State equation strengthened by 4950 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3113 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3113/8688 variables, and 51 constraints, problems are : Problem set: 0 solved, 5524 unsolved in 30105 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3114 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5524/5524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3113 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3113/8688 variables, and 51 constraints, problems are : Problem set: 0 solved, 5524 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3114 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63703ms problems are : Problem set: 0 solved, 5524 unsolved
Search for dead transitions found 0 dead transitions in 63755ms
Finished structural reductions in LTL mode , in 1 iterations and 189058 ms. Remains : 3114/3114 places, 5574/5574 transitions.
Support contains 50 out of 3114 places after structural reductions.
[2026-05-24 17:00:07] [INFO ] Flatten gal took : 270 ms
[2026-05-24 17:00:08] [INFO ] Flatten gal took : 174 ms
[2026-05-24 17:00:08] [INFO ] Input system was already deterministic with 5574 transitions.
Support contains 48 out of 3114 places (down from 50) after GAL structural reductions.
RANDOM walk for 40000 steps (43 resets) in 2452 ms. (16 steps per ms) remains 4/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
[2026-05-24 17:00:09] [INFO ] Invariant cache hit.
[2026-05-24 17:00:09] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3063/3069 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3069/8688 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/51 constraints, State Equation: 0/3114 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3063/3069 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3069 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 12083ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 3114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3114/3114 places, 5574/5574 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 338 place count 3114 transition count 5236
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 1 with 338 rules applied. Total rules applied 676 place count 2776 transition count 5236
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 676 place count 2776 transition count 5186
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 776 place count 2726 transition count 5186
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 786 place count 2716 transition count 5166
Iterating global reduction 2 with 10 rules applied. Total rules applied 796 place count 2716 transition count 5166
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 806 place count 2716 transition count 5156
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 816 place count 2706 transition count 5156
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 916 place count 2656 transition count 5106
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 918 place count 2656 transition count 5104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 920 place count 2654 transition count 5104
Applied a total of 920 rules in 1432 ms. Remains 2654 /3114 variables (removed 460) and now considering 5104/5574 (removed 470) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1433 ms. Remains : 2654/3114 places, 5104/5574 transitions.
RANDOM walk for 33503 steps (95 resets) in 1086 ms. (30 steps per ms) remains 0/4 properties
FORMULA CANConstruction-PT-050-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CANConstruction-PT-050-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 151 stabilizing places and 200 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0) U p1)) U (F(p2) U (p3 U p4))))'
Support contains 8 out of 3114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3114/3114 places, 5574/5574 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3104 transition count 5554
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3104 transition count 5554
Applied a total of 20 rules in 589 ms. Remains 3104 /3114 variables (removed 10) and now considering 5554/5574 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9480871782868737614.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6303200143695494289.kers'
[2026-05-24 17:00:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9480871782868737614.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6303200143695494289.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 5554 rows 3104 cols 11208 entries
Finished phase 1 with 3053 SingleSign rule and 0 generalized
[2026-05-24 17:00:24] [INFO ] Computed 51 invariants in 18 ms
Computed 51 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-6303200143695494289.kers
Total runtime 23 ms.
[2026-05-24 17:00:27] [INFO ] Implicit Places using invariants in 2911 ms returned []
[2026-05-24 17:00:27] [INFO ] Invariant cache hit.
[2026-05-24 17:00:29] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 17:00:59] [INFO ] Performed 958/3104 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 17:01:29] [INFO ] Performed 1413/3104 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 17:01:59] [INFO ] Performed 1868/3104 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-24 17:02:29] [INFO ] Performed 2327/3104 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-24 17:02:29] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-24 17:02:29] [INFO ] Implicit Places using invariants and state equation in 122265 ms returned []
Implicit Place search using SMT with State Equation took 125179 ms to find 0 implicit places.
Running 5504 sub problems to find dead transitions.
[2026-05-24 17:02:29] [INFO ] Invariant cache hit.
[2026-05-24 17:02:29] [INFO ] State equation strengthened by 4950 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3103 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3103/8658 variables, and 51 constraints, problems are : Problem set: 0 solved, 5504 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3104 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5504/5504 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3103 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5504 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3103/8658 variables, and 51 constraints, problems are : Problem set: 0 solved, 5504 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3104 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5504 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63281ms problems are : Problem set: 0 solved, 5504 unsolved
Search for dead transitions found 0 dead transitions in 63292ms
Starting structural reductions in LTL mode, iteration 1 : 3104/3114 places, 5554/5574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189087 ms. Remains : 3104/3114 places, 5554/5574 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0) U p1)) U (F(p2) U (p3 U p4))))'
Stuttering acceptance computed with spot in 486 ms :[(NOT p4), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p4)), (NOT p2), (NOT p4)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-00
Stuttering criterion allowed to conclude after 940 steps with 0 reset in 29 ms.
FORMULA CANConstruction-PT-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-00 finished in 189726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||X(p1)))||((p0||X(p1))&&F((!p2 U (p3||G(!p2))))))))'
Support contains 7 out of 3114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3114/3114 places, 5574/5574 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3102 transition count 5550
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3102 transition count 5550
Applied a total of 24 rules in 631 ms. Remains 3102 /3114 variables (removed 12) and now considering 5550/5574 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15353470811620582580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15070297834066901670.kers'
[2026-05-24 17:03:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15353470811620582580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15070297834066901670.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 5550 rows 3102 cols 11200 entries
Finished phase 1 with 3051 SingleSign rule and 0 generalized
[2026-05-24 17:03:34] [INFO ] Computed 51 invariants in 19 ms
Computed 51 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-15070297834066901670.kers
Total runtime 26 ms.
[2026-05-24 17:03:37] [INFO ] Implicit Places using invariants in 2896 ms returned []
[2026-05-24 17:03:37] [INFO ] Invariant cache hit.
[2026-05-24 17:03:38] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 17:04:09] [INFO ] Performed 948/3102 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 17:04:39] [INFO ] Performed 1403/3102 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 17:05:09] [INFO ] Performed 1870/3102 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-24 17:05:39] [INFO ] Performed 2348/3102 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-24 17:05:39] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-24 17:05:39] [INFO ] Implicit Places using invariants and state equation in 122223 ms returned []
Implicit Place search using SMT with State Equation took 125121 ms to find 0 implicit places.
Running 5500 sub problems to find dead transitions.
[2026-05-24 17:05:39] [INFO ] Invariant cache hit.
[2026-05-24 17:05:39] [INFO ] State equation strengthened by 4950 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3101 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3101/8652 variables, and 51 constraints, problems are : Problem set: 0 solved, 5500 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3102 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5500/5500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3101 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3101/8652 variables, and 51 constraints, problems are : Problem set: 0 solved, 5500 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3102 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63248ms problems are : Problem set: 0 solved, 5500 unsolved
Search for dead transitions found 0 dead transitions in 63257ms
Starting structural reductions in LTL mode, iteration 1 : 3102/3114 places, 5550/5574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189024 ms. Remains : 3102/3114 places, 5550/5574 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||X(p1)))||(F((!p2 U (p3||G(!p2))))&&(X(p1)||p0)))))'
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p0) (NOT p3) p2 (NOT p1))]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-01
Stuttering criterion allowed to conclude after 1179 steps with 1 reset in 15 ms.
FORMULA CANConstruction-PT-050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-01 finished in 189267 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((X(X(X(p0)))&&G((F(p1)||X(p2)))))))'
Support contains 5 out of 3114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3114/3114 places, 5574/5574 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3103 transition count 5552
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3103 transition count 5552
Applied a total of 22 rules in 645 ms. Remains 3103 /3114 variables (removed 11) and now considering 5552/5574 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9314469533537379545.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16948195243396916252.kers'
[2026-05-24 17:06:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9314469533537379545.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16948195243396916252.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 5552 rows 3103 cols 11204 entries
Finished phase 1 with 3052 SingleSign rule and 0 generalized
[2026-05-24 17:06:43] [INFO ] Computed 51 invariants in 20 ms
Computed 51 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-16948195243396916252.kers
Total runtime 31 ms.
[2026-05-24 17:06:46] [INFO ] Implicit Places using invariants in 2883 ms returned []
[2026-05-24 17:06:46] [INFO ] Invariant cache hit.
[2026-05-24 17:06:48] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 17:07:18] [INFO ] Performed 967/3103 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 17:07:48] [INFO ] Performed 1453/3103 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 17:08:18] [INFO ] Performed 1933/3103 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-24 17:08:48] [INFO ] Performed 2411/3103 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-24 17:08:48] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-24 17:08:48] [INFO ] Implicit Places using invariants and state equation in 122196 ms returned []
Implicit Place search using SMT with State Equation took 125087 ms to find 0 implicit places.
Running 5502 sub problems to find dead transitions.
[2026-05-24 17:08:48] [INFO ] Invariant cache hit.
[2026-05-24 17:08:48] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3102 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3102/8655 variables, and 51 constraints, problems are : Problem set: 0 solved, 5502 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3103 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5502/5502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3102 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3102/8655 variables, and 51 constraints, problems are : Problem set: 0 solved, 5502 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3103 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63180ms problems are : Problem set: 0 solved, 5502 unsolved
Search for dead transitions found 0 dead transitions in 63190ms
Starting structural reductions in LTL mode, iteration 1 : 3103/3114 places, 5552/5574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188934 ms. Remains : 3103/3114 places, 5552/5574 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(X(p0)))&&G((F(p1)||X(p2)))))))'
Stuttering acceptance computed with spot in 692 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), false, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), false, (AND (NOT p0) (NOT p1)), false, false]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-04
Product exploration explored 100000 steps with 221 reset in 738 ms.
Product exploration explored 100000 steps with 209 reset in 800 ms.
Computed a total of 151 stabilizing places and 200 stable transitions
Computed a total of 151 stabilizing places and 200 stable transitions
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 17 states, 43 edges and 3 AP (stutter sensitive) to 16 states, 39 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (44 resets) in 546 ms. (73 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
[2026-05-24 17:09:54] [INFO ] Invariant cache hit.
[2026-05-24 17:09:54] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 3052/3057 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3057 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3057 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 45/3102 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 18039ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 5552/5552 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 3103 transition count 5204
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 696 place count 2755 transition count 5204
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 696 place count 2755 transition count 5154
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 796 place count 2705 transition count 5154
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 894 place count 2656 transition count 5105
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 896 place count 2656 transition count 5103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 898 place count 2654 transition count 5103
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 899 place count 2654 transition count 5103
Applied a total of 899 rules in 1179 ms. Remains 2654 /3103 variables (removed 449) and now considering 5103/5552 (removed 449) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1179 ms. Remains : 2654/3103 places, 5103/5552 transitions.
RANDOM walk for 40000 steps (116 resets) in 821 ms. (48 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8376977274043587505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10704634027135059761.kers'
[2026-05-24 17:10:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8376977274043587505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10704634027135059761.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 5103 rows 2654 cols 10357 entries
Finished phase 1 with 2603 SingleSign rule and 0 generalized
[2026-05-24 17:10:14] [INFO ] Computed 51 invariants in 63 ms
Computed 51 P flows in 63 ms.
Exported basis to /tmp/petrispot-output-10704634027135059761.kers
Total runtime 66 ms.
[2026-05-24 17:10:14] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2603/2608 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2608 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2608 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 45/2653 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 46373ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 2654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2654/2654 places, 5103/5103 transitions.
Applied a total of 0 rules in 271 ms. Remains 2654 /2654 variables (removed 0) and now considering 5103/5103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 2654/2654 places, 5103/5103 transitions.
RANDOM walk for 40000 steps (114 resets) in 869 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 72966 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 2
Probabilistic random walk after 72966 steps, saw 26919 distinct states, run finished after 3007 ms. (steps per millisecond=24 ) properties seen :0
[2026-05-24 17:11:04] [INFO ] Invariant cache hit.
[2026-05-24 17:11:04] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2603/2608 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2608 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2608 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 45/2653 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 75121ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 2654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2654/2654 places, 5103/5103 transitions.
Applied a total of 0 rules in 261 ms. Remains 2654 /2654 variables (removed 0) and now considering 5103/5103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 2654/2654 places, 5103/5103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2654/2654 places, 5103/5103 transitions.
Applied a total of 0 rules in 261 ms. Remains 2654 /2654 variables (removed 0) and now considering 5103/5103 (removed 0) transitions.
[2026-05-24 17:12:19] [INFO ] Invariant cache hit.
[2026-05-24 17:12:22] [INFO ] Implicit Places using invariants in 2457 ms returned []
[2026-05-24 17:12:22] [INFO ] Invariant cache hit.
[2026-05-24 17:12:23] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 17:12:54] [INFO ] Performed 646/2654 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 17:13:24] [INFO ] Performed 1237/2654 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 17:13:54] [INFO ] Performed 1826/2654 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-24 17:14:24] [INFO ] Performed 2417/2654 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-24 17:14:24] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-24 17:14:24] [INFO ] Implicit Places using invariants and state equation in 121933 ms returned []
Implicit Place search using SMT with State Equation took 124392 ms to find 0 implicit places.
[2026-05-24 17:14:24] [INFO ] Redundant transitions in 373 ms returned []
Running 5053 sub problems to find dead transitions.
[2026-05-24 17:14:24] [INFO ] Invariant cache hit.
[2026-05-24 17:14:24] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2653 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5053 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2653/7757 variables, and 51 constraints, problems are : Problem set: 0 solved, 5053 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2654 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5053/5053 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5053 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2653 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5053 unsolved
SMT process timed out in 63274ms, After SMT, problems are : Problem set: 0 solved, 5053 unsolved
Search for dead transitions found 0 dead transitions in 63284ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188337 ms. Remains : 2654/2654 places, 5103/5103 transitions.
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 16 states, 39 edges and 3 AP (stutter sensitive) to 16 states, 39 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 574 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, false]
Knowledge-based reduction took 334628 ms.
Stuttering acceptance computed with spot in 604 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, false]
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 5552/5552 transitions.
Applied a total of 0 rules in 296 ms. Remains 3103 /3103 variables (removed 0) and now considering 5552/5552 (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-14787961230309347418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13474448261743026632.kers'
[2026-05-24 17:15:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14787961230309347418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13474448261743026632.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 5552 rows 3103 cols 11204 entries
Finished phase 1 with 3052 SingleSign rule and 0 generalized
[2026-05-24 17:15:29] [INFO ] Computed 51 invariants in 18 ms
Computed 51 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-13474448261743026632.kers
Total runtime 27 ms.
[2026-05-24 17:15:32] [INFO ] Implicit Places using invariants in 2866 ms returned []
[2026-05-24 17:15:32] [INFO ] Invariant cache hit.
[2026-05-24 17:15:34] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 17:16:04] [INFO ] Performed 962/3103 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 17:16:34] [INFO ] Performed 1429/3103 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 17:17:04] [INFO ] Performed 1891/3103 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-24 17:17:34] [INFO ] Performed 2366/3103 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-24 17:17:34] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-24 17:17:34] [INFO ] Implicit Places using invariants and state equation in 122135 ms returned []
Implicit Place search using SMT with State Equation took 125002 ms to find 0 implicit places.
Running 5502 sub problems to find dead transitions.
[2026-05-24 17:17:34] [INFO ] Invariant cache hit.
[2026-05-24 17:17:34] [INFO ] State equation strengthened by 4950 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3102 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3102/8655 variables, and 51 constraints, problems are : Problem set: 0 solved, 5502 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3103 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5502/5502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3102 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3102/8655 variables, and 51 constraints, problems are : Problem set: 0 solved, 5502 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3103 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63086ms problems are : Problem set: 0 solved, 5502 unsolved
Search for dead transitions found 0 dead transitions in 63096ms
Finished structural reductions in LTL mode , in 1 iterations and 188405 ms. Remains : 3103/3103 places, 5552/5552 transitions.
Computed a total of 151 stabilizing places and 200 stable transitions
Computed a total of 151 stabilizing places and 200 stable transitions
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 16 states, 39 edges and 3 AP (stutter sensitive) to 16 states, 39 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (44 resets) in 482 ms. (82 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
[2026-05-24 17:18:38] [INFO ] Invariant cache hit.
[2026-05-24 17:18:38] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3052/3057 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 7056ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 5552/5552 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 3103 transition count 5204
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 696 place count 2755 transition count 5204
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 696 place count 2755 transition count 5154
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 796 place count 2705 transition count 5154
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 894 place count 2656 transition count 5105
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 896 place count 2656 transition count 5103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 898 place count 2654 transition count 5103
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 899 place count 2654 transition count 5103
Applied a total of 899 rules in 1144 ms. Remains 2654 /3103 variables (removed 449) and now considering 5103/5552 (removed 449) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1144 ms. Remains : 2654/3103 places, 5103/5552 transitions.
RANDOM walk for 40000 steps (115 resets) in 682 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9502608038853180804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16450701411945297344.kers'
[2026-05-24 17:18:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9502608038853180804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16450701411945297344.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 5103 rows 2654 cols 10357 entries
Finished phase 1 with 2603 SingleSign rule and 0 generalized
[2026-05-24 17:18:46] [INFO ] Computed 51 invariants in 49 ms
Computed 51 P flows in 49 ms.
Exported basis to /tmp/petrispot-output-16450701411945297344.kers
Total runtime 53 ms.
[2026-05-24 17:18:46] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2603/2608 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2608 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2608 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 45/2653 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 46087ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 2654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2654/2654 places, 5103/5103 transitions.
Applied a total of 0 rules in 318 ms. Remains 2654 /2654 variables (removed 0) and now considering 5103/5103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 2654/2654 places, 5103/5103 transitions.
RANDOM walk for 40000 steps (113 resets) in 707 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 73488 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 2
Probabilistic random walk after 73488 steps, saw 27013 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2026-05-24 17:19:36] [INFO ] Invariant cache hit.
[2026-05-24 17:19:36] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2603/2608 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2608 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2608 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 45/2653 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 75442ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 2654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2654/2654 places, 5103/5103 transitions.
Applied a total of 0 rules in 266 ms. Remains 2654 /2654 variables (removed 0) and now considering 5103/5103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 2654/2654 places, 5103/5103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2654/2654 places, 5103/5103 transitions.
Applied a total of 0 rules in 315 ms. Remains 2654 /2654 variables (removed 0) and now considering 5103/5103 (removed 0) transitions.
[2026-05-24 17:20:52] [INFO ] Invariant cache hit.
[2026-05-24 17:20:54] [INFO ] Implicit Places using invariants in 2453 ms returned []
[2026-05-24 17:20:54] [INFO ] Invariant cache hit.
[2026-05-24 17:20:56] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 17:21:26] [INFO ] Performed 615/2654 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 17:21:56] [INFO ] Performed 1161/2654 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 17:22:26] [INFO ] Performed 1694/2654 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-24 17:22:56] [INFO ] Performed 2216/2654 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-24 17:22:56] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-24 17:22:56] [INFO ] Implicit Places using invariants and state equation in 121890 ms returned []
Implicit Place search using SMT with State Equation took 124345 ms to find 0 implicit places.
[2026-05-24 17:22:57] [INFO ] Redundant transitions in 370 ms returned []
Running 5053 sub problems to find dead transitions.
[2026-05-24 17:22:57] [INFO ] Invariant cache hit.
[2026-05-24 17:22:57] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2653 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5053 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2653/7757 variables, and 51 constraints, problems are : Problem set: 0 solved, 5053 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2654 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5053/5053 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5053 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2653 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5053 unsolved
SMT process timed out in 63564ms, After SMT, problems are : Problem set: 0 solved, 5053 unsolved
Search for dead transitions found 0 dead transitions in 63573ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188632 ms. Remains : 2654/2654 places, 5103/5103 transitions.
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 16 states, 39 edges and 3 AP (stutter sensitive) to 16 states, 39 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 682 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, false]
Knowledge-based reduction took 323786 ms.
Stuttering acceptance computed with spot in 691 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 680 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 238 reset in 654 ms.
Product exploration explored 100000 steps with 201 reset in 720 ms.
Spot run failed in 75 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/ltsmin6656144600871150835
[2026-05-24 17:24:04] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6656144600871150835
Running compilation step : cd /tmp/ltsmin6656144600871150835;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6656144600871150835;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6656144600871150835;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 5552/5552 transitions.
Applied a total of 0 rules in 303 ms. Remains 3103 /3103 variables (removed 0) and now considering 5552/5552 (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-8524839554427860479.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8380376849111213334.kers'
[2026-05-24 17:24:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8524839554427860479.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8380376849111213334.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 5552 rows 3103 cols 11204 entries
Finished phase 1 with 3052 SingleSign rule and 0 generalized
[2026-05-24 17:24:07] [INFO ] Computed 51 invariants in 21 ms
Computed 51 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-8380376849111213334.kers
Total runtime 26 ms.
[2026-05-24 17:24:10] [INFO ] Implicit Places using invariants in 2920 ms returned []
[2026-05-24 17:24:10] [INFO ] Invariant cache hit.
[2026-05-24 17:24:12] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 17:24:42] [INFO ] Performed 953/3103 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 17:25:12] [INFO ] Performed 1422/3103 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 17:25:42] [INFO ] Performed 1901/3103 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-24 17:26:13] [INFO ] Performed 2353/3103 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-24 17:26:13] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-24 17:26:13] [INFO ] Implicit Places using invariants and state equation in 122241 ms returned []
Implicit Place search using SMT with State Equation took 125165 ms to find 0 implicit places.
Running 5502 sub problems to find dead transitions.
[2026-05-24 17:26:13] [INFO ] Invariant cache hit.
[2026-05-24 17:26:13] [INFO ] State equation strengthened by 4950 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3102 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3102/8655 variables, and 51 constraints, problems are : Problem set: 0 solved, 5502 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3103 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5502/5502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3102 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3102/8655 variables, and 51 constraints, problems are : Problem set: 0 solved, 5502 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3103 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63134ms problems are : Problem set: 0 solved, 5502 unsolved
Search for dead transitions found 0 dead transitions in 63144ms
Finished structural reductions in LTL mode , in 1 iterations and 188628 ms. Remains : 3103/3103 places, 5552/5552 transitions.
Built C files in :
/tmp/ltsmin6675029771767085126
[2026-05-24 17:27:16] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6675029771767085126
Running compilation step : cd /tmp/ltsmin6675029771767085126;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6675029771767085126;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6675029771767085126;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-24 17:27:19] [INFO ] Flatten gal took : 113 ms
[2026-05-24 17:27:19] [INFO ] Flatten gal took : 105 ms
[2026-05-24 17:27:19] [INFO ] Time to serialize gal into /tmp/LTL15603205298802725252.gal : 38 ms
[2026-05-24 17:27:19] [INFO ] Time to serialize properties into /tmp/LTL18301774270317659405.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15603205298802725252.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9448271399331655734.hoa' '-atoms' '/tmp/LTL18301774270317659405.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18301774270317659405.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9448271399331655734.hoa
Detected timeout of ITS tools.
[2026-05-24 17:27:35] [INFO ] Flatten gal took : 88 ms
[2026-05-24 17:27:35] [INFO ] Flatten gal took : 97 ms
[2026-05-24 17:27:35] [INFO ] Time to serialize gal into /tmp/LTL17804036620528745171.gal : 26 ms
[2026-05-24 17:27:35] [INFO ] Time to serialize properties into /tmp/LTL14742497078251623164.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17804036620528745171.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14742497078251623164.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F((X(X(X("((Node44Request<1)||(Node46IsInserted<1))"))))&&(G((F("((Node29IsInserted<1)||(Node36requestsent29<1))"))||(X("(Node33G...178
Formula 0 simplified : XG(XXX!"((Node44Request<1)||(Node46IsInserted<1))" | F(G!"((Node29IsInserted<1)||(Node36requestsent29<1))" & X!"(Node33GiveAnswer17<...160
Detected timeout of ITS tools.
[2026-05-24 17:27:50] [INFO ] Flatten gal took : 85 ms
[2026-05-24 17:27:50] [INFO ] Applying decomposition
[2026-05-24 17:27:50] [INFO ] Flatten gal took : 94 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4241231113051854148.txt' '-o' '/tmp/graph4241231113051854148.bin' '-w' '/tmp/graph4241231113051854148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4241231113051854148.bin' '-l' '-1' '-v' '-w' '/tmp/graph4241231113051854148.weights' '-q' '0' '-e' '0.001'
[2026-05-24 17:27:51] [INFO ] Decomposing Gal with order
[2026-05-24 17:27:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 17:27:52] [INFO ] Removed a total of 5042 redundant transitions.
[2026-05-24 17:27:52] [INFO ] Flatten gal took : 912 ms
[2026-05-24 17:27:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 9790 labels/synchronizations in 392 ms.
[2026-05-24 17:27:52] [INFO ] Time to serialize gal into /tmp/LTL8278696211219888725.gal : 43 ms
[2026-05-24 17:27:52] [INFO ] Time to serialize properties into /tmp/LTL9009091285766772120.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8278696211219888725.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9009091285766772120.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((X(X(X("((i44.u197.Node44Request<1)||(i46.u204.Node46IsInserted<1))"))))&&(G((F("((i29.u126.Node29IsInserted<1)||(i36.u161.Node...222
Formula 0 simplified : XG(XXX!"((i44.u197.Node44Request<1)||(i46.u204.Node46IsInserted<1))" | F(G!"((i29.u126.Node29IsInserted<1)||(i36.u161.Node36requests...204
Detected timeout of ITS tools.
Treatment of property CANConstruction-PT-050-LTLFireability-04 finished in 1284995 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)||(p1&&X(G(p2))))))'
Support contains 4 out of 3114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3114/3114 places, 5574/5574 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3104 transition count 5554
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3104 transition count 5554
Applied a total of 20 rules in 597 ms. Remains 3104 /3114 variables (removed 10) and now considering 5554/5574 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4796440512375965215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7014804550881462710.kers'
[2026-05-24 17:28:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4796440512375965215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7014804550881462710.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 5554 rows 3104 cols 11208 entries
Finished phase 1 with 3053 SingleSign rule and 0 generalized
[2026-05-24 17:28:08] [INFO ] Computed 51 invariants in 26 ms
Computed 51 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-7014804550881462710.kers
Total runtime 35 ms.
[2026-05-24 17:28:11] [INFO ] Implicit Places using invariants in 3158 ms returned []
[2026-05-24 17:28:11] [INFO ] Invariant cache hit.
[2026-05-24 17:28:13] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 17:28:43] [INFO ] Performed 905/3104 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 17:29:13] [INFO ] Performed 1391/3104 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 17:29:43] [INFO ] Performed 1863/3104 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-24 17:30:13] [INFO ] Performed 2327/3104 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-24 17:30:13] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-24 17:30:13] [INFO ] Implicit Places using invariants and state equation in 122181 ms returned []
Implicit Place search using SMT with State Equation took 125341 ms to find 0 implicit places.
Running 5504 sub problems to find dead transitions.
[2026-05-24 17:30:13] [INFO ] Invariant cache hit.
[2026-05-24 17:30:13] [INFO ] State equation strengthened by 4950 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3103 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3103/8658 variables, and 51 constraints, problems are : Problem set: 0 solved, 5504 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3104 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5504/5504 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3103 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3103/8658 variables, and 51 constraints, problems are : Problem set: 0 solved, 5504 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3104 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5504 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63177ms problems are : Problem set: 0 solved, 5504 unsolved
Search for dead transitions found 0 dead transitions in 63186ms
Starting structural reductions in LTL mode, iteration 1 : 3104/3114 places, 5554/5574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189141 ms. Remains : 3104/3114 places, 5554/5574 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)||(p1&&X(G(p2))))))'
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-06
Stuttering criterion allowed to conclude after 1737 steps with 1 reset in 18 ms.
FORMULA CANConstruction-PT-050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-06 finished in 189380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(!p0)) U ((X(X(!p0))&&G(p1))||X(X(G(!p0))))))))'
Support contains 3 out of 3114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3114/3114 places, 5574/5574 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3103 transition count 5552
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3103 transition count 5552
Applied a total of 22 rules in 647 ms. Remains 3103 /3114 variables (removed 11) and now considering 5552/5574 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9058822742012325907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12262650018424440612.kers'
[2026-05-24 17:31:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9058822742012325907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12262650018424440612.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5552 rows 3103 cols 11204 entries
Finished phase 1 with 3052 SingleSign rule and 0 generalized
[2026-05-24 17:31:17] [INFO ] Computed 51 invariants in 27 ms
Computed 51 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-12262650018424440612.kers
Total runtime 35 ms.
[2026-05-24 17:31:20] [INFO ] Implicit Places using invariants in 3065 ms returned []
[2026-05-24 17:31:20] [INFO ] Invariant cache hit.
[2026-05-24 17:31:22] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 17:31:53] [INFO ] Performed 914/3103 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 17:32:23] [INFO ] Performed 1364/3103 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 17:32:53] [INFO ] Performed 1809/3103 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-24 17:33:23] [INFO ] Performed 2257/3103 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-24 17:33:23] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-24 17:33:23] [INFO ] Implicit Places using invariants and state equation in 122265 ms returned []
Implicit Place search using SMT with State Equation took 125335 ms to find 0 implicit places.
Running 5502 sub problems to find dead transitions.
[2026-05-24 17:33:23] [INFO ] Invariant cache hit.
[2026-05-24 17:33:23] [INFO ] State equation strengthened by 4950 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3102 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3102/8655 variables, and 51 constraints, problems are : Problem set: 0 solved, 5502 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3103 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5502/5502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3102 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5502 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3102/8655 variables, and 51 constraints, problems are : Problem set: 0 solved, 5502 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3103 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63168ms problems are : Problem set: 0 solved, 5502 unsolved
Search for dead transitions found 0 dead transitions in 63177ms
Starting structural reductions in LTL mode, iteration 1 : 3103/3114 places, 5552/5574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189184 ms. Remains : 3103/3114 places, 5552/5574 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(!p0)) U (X(X(G(!p0)))||(X(X(!p0))&&G(p1)))))))'
Stuttering acceptance computed with spot in 387 ms :[p0, p0, p0, p0, (AND (NOT p1) p0), p0, (AND p0 (NOT p1)), true, (AND (NOT p1) p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-08
Product exploration explored 100000 steps with 16692 reset in 888 ms.
Product exploration explored 100000 steps with 16678 reset in 857 ms.
Computed a total of 151 stabilizing places and 200 stable transitions
Computed a total of 151 stabilizing places and 200 stable transitions
Knowledge based reduction with 7 factoid took 78 ms. Reduced automaton from 10 states, 22 edges and 2 AP (stutter sensitive) to 10 states, 22 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (44 resets) in 389 ms. (102 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
[2026-05-24 17:34:28] [INFO ] Invariant cache hit.
[2026-05-24 17:34:28] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3052/3055 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5163ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 5552/5552 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 3103 transition count 5204
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 696 place count 2755 transition count 5204
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 696 place count 2755 transition count 5154
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 796 place count 2705 transition count 5154
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 896 place count 2655 transition count 5104
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 897 place count 2655 transition count 5103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 898 place count 2654 transition count 5103
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 899 place count 2654 transition count 5103
Applied a total of 899 rules in 1189 ms. Remains 2654 /3103 variables (removed 449) and now considering 5103/5552 (removed 449) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1189 ms. Remains : 2654/3103 places, 5103/5552 transitions.
RANDOM walk for 40000 steps (114 resets) in 489 ms. (81 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 75082 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 1
Probabilistic random walk after 75082 steps, saw 27461 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) 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-13772119622779692811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4595763541930532574.kers'
[2026-05-24 17:34:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13772119622779692811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4595763541930532574.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5103 rows 2654 cols 10357 entries
Finished phase 1 with 2603 SingleSign rule and 0 generalized
[2026-05-24 17:34:38] [INFO ] Computed 51 invariants in 54 ms
Computed 51 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-4595763541930532574.kers
Total runtime 62 ms.
[2026-05-24 17:34:38] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2603/2606 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2606 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2606 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 47/2653 variables, 47/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 46790ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2654/2654 places, 5103/5103 transitions.
Applied a total of 0 rules in 272 ms. Remains 2654 /2654 variables (removed 0) and now considering 5103/5103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 2654/2654 places, 5103/5103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2654/2654 places, 5103/5103 transitions.
Applied a total of 0 rules in 259 ms. Remains 2654 /2654 variables (removed 0) and now considering 5103/5103 (removed 0) transitions.
[2026-05-24 17:35:25] [INFO ] Invariant cache hit.
[2026-05-24 17:35:28] [INFO ] Implicit Places using invariants in 2489 ms returned []
[2026-05-24 17:35:28] [INFO ] Invariant cache hit.
[2026-05-24 17:35:29] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 17:36:00] [INFO ] Performed 617/2654 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 17:36:30] [INFO ] Performed 1153/2654 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 17:37:00] [INFO ] Performed 1723/2654 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-24 17:37:30] [INFO ] Performed 2312/2654 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-24 17:37:30] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-24 17:37:30] [INFO ] Implicit Places using invariants and state equation in 121991 ms returned []
Implicit Place search using SMT with State Equation took 124487 ms to find 0 implicit places.
[2026-05-24 17:37:30] [INFO ] Redundant transitions in 231 ms returned []
Running 5053 sub problems to find dead transitions.
[2026-05-24 17:37:30] [INFO ] Invariant cache hit.
[2026-05-24 17:37:30] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2653 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5053 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2653/7757 variables, and 51 constraints, problems are : Problem set: 0 solved, 5053 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2654 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5053/5053 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5053 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2653 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5053 unsolved
SMT process timed out in 63049ms, After SMT, problems are : Problem set: 0 solved, 5053 unsolved
Search for dead transitions found 0 dead transitions in 63056ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188049 ms. Remains : 2654/2654 places, 5103/5103 transitions.
Knowledge based reduction with 7 factoid took 170 ms. Reduced automaton from 10 states, 22 edges and 2 AP (stutter sensitive) to 10 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 392 ms :[p0, p0, p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 245459 ms.
Stuttering acceptance computed with spot in 452 ms :[p0, p0, p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 5552/5552 transitions.
Applied a total of 0 rules in 320 ms. Remains 3103 /3103 variables (removed 0) and now considering 5552/5552 (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-13410588468495771683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9153104033241065961.kers'
[2026-05-24 17:38:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13410588468495771683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9153104033241065961.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5552 rows 3103 cols 11204 entries
Finished phase 1 with 3052 SingleSign rule and 0 generalized
[2026-05-24 17:38:34] [INFO ] Computed 51 invariants in 26 ms
Computed 51 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-9153104033241065961.kers
Total runtime 32 ms.
[2026-05-24 17:38:37] [INFO ] Implicit Places using invariants in 3100 ms returned []
[2026-05-24 17:38:37] [INFO ] Invariant cache hit.
[2026-05-24 17:38:39] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 17:39:10] [INFO ] Performed 915/3103 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 17:39:40] [INFO ] Performed 1367/3103 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 17:40:10] [INFO ] Performed 1819/3103 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-24 17:40:40] [INFO ] Performed 2273/3103 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-24 17:40:40] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-24 17:40:40] [INFO ] Implicit Places using invariants and state equation in 122167 ms returned []
Implicit Place search using SMT with State Equation took 125272 ms to find 0 implicit places.
Running 5502 sub problems to find dead transitions.
[2026-05-24 17:40:40] [INFO ] Invariant cache hit.
[2026-05-24 17:40:40] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3102 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3102/8655 variables, and 51 constraints, problems are : Problem set: 0 solved, 5502 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3103 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5502/5502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3102 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5502 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3102/8655 variables, and 51 constraints, problems are : Problem set: 0 solved, 5502 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3103 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63306ms problems are : Problem set: 0 solved, 5502 unsolved
Search for dead transitions found 0 dead transitions in 63314ms
Finished structural reductions in LTL mode , in 1 iterations and 188918 ms. Remains : 3103/3103 places, 5552/5552 transitions.
Computed a total of 151 stabilizing places and 200 stable transitions
Computed a total of 151 stabilizing places and 200 stable transitions
Knowledge based reduction with 7 factoid took 84 ms. Reduced automaton from 10 states, 22 edges and 2 AP (stutter sensitive) to 10 states, 22 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (44 resets) in 351 ms. (113 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
[2026-05-24 17:41:43] [INFO ] Invariant cache hit.
[2026-05-24 17:41:43] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3052/3055 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5096ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 5552/5552 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 3103 transition count 5204
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 696 place count 2755 transition count 5204
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 696 place count 2755 transition count 5154
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 796 place count 2705 transition count 5154
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 896 place count 2655 transition count 5104
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 897 place count 2655 transition count 5103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 898 place count 2654 transition count 5103
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 899 place count 2654 transition count 5103
Applied a total of 899 rules in 1125 ms. Remains 2654 /3103 variables (removed 449) and now considering 5103/5552 (removed 449) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1125 ms. Remains : 2654/3103 places, 5103/5552 transitions.
RANDOM walk for 40000 steps (114 resets) in 595 ms. (67 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 75867 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 1
Probabilistic random walk after 75867 steps, saw 27602 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) 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-9387516164931517394.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11242405460772118693.kers'
[2026-05-24 17:41:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9387516164931517394.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11242405460772118693.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 5103 rows 2654 cols 10357 entries
Finished phase 1 with 2603 SingleSign rule and 0 generalized
[2026-05-24 17:41:53] [INFO ] Computed 51 invariants in 47 ms
Computed 51 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-11242405460772118693.kers
Total runtime 50 ms.
[2026-05-24 17:41:53] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2603/2606 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2606 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2606 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 47/2653 variables, 47/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 46624ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2654/2654 places, 5103/5103 transitions.
Applied a total of 0 rules in 284 ms. Remains 2654 /2654 variables (removed 0) and now considering 5103/5103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 2654/2654 places, 5103/5103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2654/2654 places, 5103/5103 transitions.
Applied a total of 0 rules in 285 ms. Remains 2654 /2654 variables (removed 0) and now considering 5103/5103 (removed 0) transitions.
[2026-05-24 17:42:40] [INFO ] Invariant cache hit.
[2026-05-24 17:42:42] [INFO ] Implicit Places using invariants in 2462 ms returned []
[2026-05-24 17:42:42] [INFO ] Invariant cache hit.
[2026-05-24 17:42:44] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 17:43:14] [INFO ] Performed 609/2654 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 17:43:44] [INFO ] Performed 1150/2654 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 17:44:14] [INFO ] Performed 1679/2654 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-24 17:44:44] [INFO ] Performed 2224/2654 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-24 17:44:44] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-24 17:44:44] [INFO ] Implicit Places using invariants and state equation in 121984 ms returned []
Implicit Place search using SMT with State Equation took 124447 ms to find 0 implicit places.
[2026-05-24 17:44:45] [INFO ] Redundant transitions in 465 ms returned []
Running 5053 sub problems to find dead transitions.
[2026-05-24 17:44:45] [INFO ] Invariant cache hit.
[2026-05-24 17:44:45] [INFO ] State equation strengthened by 4950 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2653 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5053 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2653/7757 variables, and 51 constraints, problems are : Problem set: 0 solved, 5053 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2654 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5053/5053 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5053 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2653 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5053 unsolved
SMT process timed out in 64464ms, After SMT, problems are : Problem set: 0 solved, 5053 unsolved
Search for dead transitions found 0 dead transitions in 64471ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189685 ms. Remains : 2654/2654 places, 5103/5103 transitions.
Knowledge based reduction with 7 factoid took 151 ms. Reduced automaton from 10 states, 22 edges and 2 AP (stutter sensitive) to 10 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[p0, p0, p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 246739 ms.
Stuttering acceptance computed with spot in 341 ms :[p0, p0, p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 343 ms :[p0, p0, p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16713 reset in 885 ms.
Product exploration explored 100000 steps with 16663 reset in 798 ms.
Spot run failed in 44 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/ltsmin5525905956820372164
[2026-05-24 17:45:52] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5525905956820372164
Running compilation step : cd /tmp/ltsmin5525905956820372164;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5525905956820372164;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5525905956820372164;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 5552/5552 transitions.
Applied a total of 0 rules in 324 ms. Remains 3103 /3103 variables (removed 0) and now considering 5552/5552 (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-15770064076847336559.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10391298157091815195.kers'
[2026-05-24 17:45:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15770064076847336559.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10391298157091815195.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5552 rows 3103 cols 11204 entries
Finished phase 1 with 3052 SingleSign rule and 0 generalized
[2026-05-24 17:45:56] [INFO ] Computed 51 invariants in 27 ms
Computed 51 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-10391298157091815195.kers
Total runtime 37 ms.
[2026-05-24 17:45:59] [INFO ] Implicit Places using invariants in 3152 ms returned []
[2026-05-24 17:45:59] [INFO ] Invariant cache hit.
[2026-05-24 17:46:01] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 17:46:31] [INFO ] Performed 933/3103 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 17:47:01] [INFO ] Performed 1407/3103 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 17:47:31] [INFO ] Performed 1889/3103 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-24 17:48:01] [INFO ] Performed 2366/3103 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-24 17:48:01] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-24 17:48:01] [INFO ] Implicit Places using invariants and state equation in 122376 ms returned []
Implicit Place search using SMT with State Equation took 125532 ms to find 0 implicit places.
Running 5502 sub problems to find dead transitions.
[2026-05-24 17:48:01] [INFO ] Invariant cache hit.
[2026-05-24 17:48:01] [INFO ] State equation strengthened by 4950 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3102 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3102/8655 variables, and 51 constraints, problems are : Problem set: 0 solved, 5502 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3103 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5502/5502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3102 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5502 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3102/8655 variables, and 51 constraints, problems are : Problem set: 0 solved, 5502 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3103 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63424ms problems are : Problem set: 0 solved, 5502 unsolved
Search for dead transitions found 0 dead transitions in 63432ms
Finished structural reductions in LTL mode , in 1 iterations and 189299 ms. Remains : 3103/3103 places, 5552/5552 transitions.
Built C files in :
/tmp/ltsmin12137930194371495283
[2026-05-24 17:49:05] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12137930194371495283
Running compilation step : cd /tmp/ltsmin12137930194371495283;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12137930194371495283;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12137930194371495283;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-24 17:49:08] [INFO ] Flatten gal took : 311 ms
[2026-05-24 17:49:09] [INFO ] Flatten gal took : 144 ms
[2026-05-24 17:49:09] [INFO ] Time to serialize gal into /tmp/LTL2566451229776265905.gal : 32 ms
[2026-05-24 17:49:09] [INFO ] Time to serialize properties into /tmp/LTL3426949480599040713.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2566451229776265905.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14612947047549980146.hoa' '-atoms' '/tmp/LTL3426949480599040713.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3426949480599040713.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14612947047549980146.hoa
Detected timeout of ITS tools.
[2026-05-24 17:49:24] [INFO ] Flatten gal took : 105 ms
[2026-05-24 17:49:24] [INFO ] Flatten gal took : 96 ms
[2026-05-24 17:49:24] [INFO ] Time to serialize gal into /tmp/LTL365551750602099843.gal : 17 ms
[2026-05-24 17:49:24] [INFO ] Time to serialize properties into /tmp/LTL14461528795957816912.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL365551750602099843.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14461528795957816912.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X(!("((Node9Request>=1)&&(Node38IsInserted>=1))"))))U((X(X(G(!("((Node9Request>=1)&&(Node38IsInserted>=1))")))))||((X(X(!("(...238
Formula 0 simplified : XX(XX"((Node9Request>=1)&&(Node38IsInserted>=1))" R (XXF"((Node9Request>=1)&&(Node38IsInserted>=1))" & (XX"((Node9Request>=1)&&(Node...205
Detected timeout of ITS tools.
[2026-05-24 17:49:39] [INFO ] Flatten gal took : 94 ms
[2026-05-24 17:49:39] [INFO ] Applying decomposition
[2026-05-24 17:49:39] [INFO ] Flatten gal took : 112 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12532108145060253633.txt' '-o' '/tmp/graph12532108145060253633.bin' '-w' '/tmp/graph12532108145060253633.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12532108145060253633.bin' '-l' '-1' '-v' '-w' '/tmp/graph12532108145060253633.weights' '-q' '0' '-e' '0.001'
[2026-05-24 17:49:39] [INFO ] Decomposing Gal with order
[2026-05-24 17:49:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 17:49:40] [INFO ] Removed a total of 5046 redundant transitions.
[2026-05-24 17:49:40] [INFO ] Flatten gal took : 526 ms
[2026-05-24 17:49:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 9794 labels/synchronizations in 473 ms.
[2026-05-24 17:49:41] [INFO ] Time to serialize gal into /tmp/LTL14406996450016280335.gal : 32 ms
[2026-05-24 17:49:41] [INFO ] Time to serialize properties into /tmp/LTL8474601762393146097.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14406996450016280335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8474601762393146097.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X(!("((i9.u40.Node9Request>=1)&&(i38.u168.Node38IsInserted>=1))"))))U((X(X(G(!("((i9.u40.Node9Request>=1)&&(i38.u168.Node38I...294
Formula 0 simplified : XX(XX"((i9.u40.Node9Request>=1)&&(i38.u168.Node38IsInserted>=1))" R (XXF"((i9.u40.Node9Request>=1)&&(i38.u168.Node38IsInserted>=1))"...261
Detected timeout of ITS tools.
Treatment of property CANConstruction-PT-050-LTLFireability-08 finished in 1119361 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 4 out of 3114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3114/3114 places, 5574/5574 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 287 transitions
Trivial Post-agglo rules discarded 287 transitions
Performed 287 trivial Post agglomeration. Transition count delta: 287
Iterating post reduction 0 with 287 rules applied. Total rules applied 287 place count 3114 transition count 5287
Reduce places removed 287 places and 0 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 1 with 337 rules applied. Total rules applied 624 place count 2827 transition count 5237
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 2 with 50 rules applied. Total rules applied 674 place count 2777 transition count 5237
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 674 place count 2777 transition count 5187
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 774 place count 2727 transition count 5187
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 786 place count 2715 transition count 5163
Iterating global reduction 3 with 12 rules applied. Total rules applied 798 place count 2715 transition count 5163
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 12 rules applied. Total rules applied 810 place count 2715 transition count 5151
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 822 place count 2703 transition count 5151
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 920 place count 2654 transition count 5102
Applied a total of 920 rules in 1128 ms. Remains 2654 /3114 variables (removed 460) and now considering 5102/5574 (removed 472) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11638063896664603702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12165428168980936993.kers'
[2026-05-24 17:49:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11638063896664603702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12165428168980936993.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 5102 rows 2654 cols 10353 entries
Finished phase 1 with 2603 SingleSign rule and 0 generalized
[2026-05-24 17:49:57] [INFO ] Computed 51 invariants in 45 ms
Computed 51 P flows in 46 ms.
Exported basis to /tmp/petrispot-output-12165428168980936993.kers
Total runtime 51 ms.
[2026-05-24 17:50:00] [INFO ] Implicit Places using invariants in 2511 ms returned []
[2026-05-24 17:50:00] [INFO ] Invariant cache hit.
[2026-05-24 17:50:01] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 17:50:32] [INFO ] Performed 767/2654 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 17:51:02] [INFO ] Performed 1575/2654 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 17:51:32] [INFO ] Performed 2372/2654 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-24 17:51:42] [INFO ] Implicit Places using invariants and state equation in 102630 ms returned []
Implicit Place search using SMT with State Equation took 105143 ms to find 0 implicit places.
[2026-05-24 17:51:43] [INFO ] Redundant transitions in 452 ms returned []
Running 5052 sub problems to find dead transitions.
[2026-05-24 17:51:43] [INFO ] Invariant cache hit.
[2026-05-24 17:51:43] [INFO ] State equation strengthened by 4950 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2653 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5052 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2653/7756 variables, and 51 constraints, problems are : Problem set: 0 solved, 5052 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2654 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5052/5052 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5052 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2653 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5052 unsolved
SMT process timed out in 74967ms, After SMT, problems are : Problem set: 0 solved, 5052 unsolved
Search for dead transitions found 0 dead transitions in 74976ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2654/3114 places, 5102/5574 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181712 ms. Remains : 2654/3114 places, 5102/5574 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 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-09
Stuttering criterion allowed to conclude after 355 steps with 0 reset in 12 ms.
FORMULA CANConstruction-PT-050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-09 finished in 181850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (G(p0)||(p0&&G((X(G(!p0))&&p1))))))))'
Support contains 3 out of 3114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3114/3114 places, 5574/5574 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3103 transition count 5552
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3103 transition count 5552
Applied a total of 22 rules in 625 ms. Remains 3103 /3114 variables (removed 11) and now considering 5552/5574 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8184162093511726150.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8888660803803100782.kers'
[2026-05-24 17:52:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8184162093511726150.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8888660803803100782.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 5552 rows 3103 cols 11204 entries
Finished phase 1 with 3052 SingleSign rule and 0 generalized
[2026-05-24 17:52:59] [INFO ] Computed 51 invariants in 18 ms
Computed 51 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-8888660803803100782.kers
Total runtime 38 ms.
[2026-05-24 17:53:02] [INFO ] Implicit Places using invariants in 3019 ms returned []
[2026-05-24 17:53:02] [INFO ] Invariant cache hit.
[2026-05-24 17:53:03] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-24 17:53:34] [INFO ] Performed 978/3103 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-24 17:54:04] [INFO ] Performed 1497/3103 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-24 17:54:34] [INFO ] Performed 2007/3103 implicitness test of which 0 returned IMPLICIT in 90 seconds.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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