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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 9.1K Mar 6 09:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 6 09:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 6 09:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 09:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 15 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 09:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 6 09:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 09:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 6 09:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:49 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 173K 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-010-LTLFireability-00
FORMULA_NAME CANConstruction-PT-010-LTLFireability-01
FORMULA_NAME CANConstruction-PT-010-LTLFireability-02
FORMULA_NAME CANConstruction-PT-010-LTLFireability-03
FORMULA_NAME CANConstruction-PT-010-LTLFireability-04
FORMULA_NAME CANConstruction-PT-010-LTLFireability-05
FORMULA_NAME CANConstruction-PT-010-LTLFireability-06
FORMULA_NAME CANConstruction-PT-010-LTLFireability-07
FORMULA_NAME CANConstruction-PT-010-LTLFireability-08
FORMULA_NAME CANConstruction-PT-010-LTLFireability-09
FORMULA_NAME CANConstruction-PT-010-LTLFireability-10
FORMULA_NAME CANConstruction-PT-010-LTLFireability-11
FORMULA_NAME CANConstruction-PT-010-LTLFireability-12
FORMULA_NAME CANConstruction-PT-010-LTLFireability-13
FORMULA_NAME CANConstruction-PT-010-LTLFireability-14
FORMULA_NAME CANConstruction-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779631661834

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-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 14:07:42] [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 14:07:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 14:07:43] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2026-05-24 14:07:43] [INFO ] Transformed 322 places.
[2026-05-24 14:07:43] [INFO ] Transformed 480 transitions.
[2026-05-24 14:07:43] [INFO ] Parsed PT model containing 322 places and 480 transitions and 1400 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA CANConstruction-PT-010-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 480/480 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 252 transition count 340
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 252 transition count 340
Applied a total of 140 rules in 62 ms. Remains 252 /322 variables (removed 70) and now considering 340/480 (removed 140) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7003826257223844678.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5676886568686613315.kers'
[2026-05-24 14:07:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7003826257223844678.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5676886568686613315.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 340 rows 252 cols 740 entries
Finished phase 1 with 221 SingleSign rule and 10 generalized
[2026-05-24 14:07:43] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5676886568686613315.kers
Total runtime 2 ms.
[2026-05-24 14:07:43] [INFO ] Implicit Places using invariants in 333 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 365 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/322 places, 340/480 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 232 transition count 330
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 232 transition count 330
Applied a total of 20 rules in 15 ms. Remains 232 /242 variables (removed 10) and now considering 330/340 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11901334616990825583.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-959718782474798584.kers'
[2026-05-24 14:07:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11901334616990825583.kers, --Pflows, --basisKERS=/tmp/petrispot-output-959718782474798584.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 330 rows 232 cols 680 entries
Finished phase 1 with 221 SingleSign rule and 0 generalized
[2026-05-24 14:07:43] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-959718782474798584.kers
Total runtime 2 ms.
[2026-05-24 14:07:43] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-24 14:07:43] [INFO ] Invariant cache hit.
[2026-05-24 14:07:44] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:07:44] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 232/322 places, 330/480 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 989 ms. Remains : 232/322 places, 330/480 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 330/330 transitions.
Applied a total of 0 rules in 7 ms. Remains 232 /232 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2026-05-24 14:07:44] [INFO ] Invariant cache hit.
[2026-05-24 14:07:44] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-24 14:07:44] [INFO ] Invariant cache hit.
[2026-05-24 14:07:44] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:07:44] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2026-05-24 14:07:44] [INFO ] Invariant cache hit.
[2026-05-24 14:07:44] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 17/108 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 330/561 variables, 231/339 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 190/529 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (OVERLAPS) 1/562 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/562 variables, and 530 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 232/232 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 97/97 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 97/108 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 330/561 variables, 231/361 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 190/551 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 320/871 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 320 unsolved
SMT process timed out in 60114ms, After SMT, problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Finished structural reductions in LTL mode , in 1 iterations and 60601 ms. Remains : 232/232 places, 330/330 transitions.
Support contains 32 out of 232 places after structural reductions.
[2026-05-24 14:08:45] [INFO ] Flatten gal took : 49 ms
[2026-05-24 14:08:45] [INFO ] Flatten gal took : 20 ms
[2026-05-24 14:08:45] [INFO ] Input system was already deterministic with 330 transitions.
RANDOM walk for 34135 steps (197 resets) in 984 ms. (34 steps per ms) remains 0/26 properties
Computed a total of 31 stabilizing places and 40 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((F(p0)&&F(G((p1 U p2))))))'
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 330/330 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 232 transition count 268
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 170 transition count 268
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 124 place count 170 transition count 258
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 144 place count 160 transition count 258
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 152 place count 152 transition count 242
Iterating global reduction 2 with 8 rules applied. Total rules applied 160 place count 152 transition count 242
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 164 place count 152 transition count 238
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 168 place count 148 transition count 238
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 192 place count 136 transition count 226
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 212 place count 126 transition count 294
Applied a total of 212 rules in 57 ms. Remains 126 /232 variables (removed 106) and now considering 294/330 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16660689022809058263.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12595142788818030926.kers'
[2026-05-24 14:08:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16660689022809058263.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12595142788818030926.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 294 rows 126 cols 698 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-24 14:08:46] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12595142788818030926.kers
Total runtime 1 ms.
[2026-05-24 14:08:46] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-24 14:08:46] [INFO ] Invariant cache hit.
[2026-05-24 14:08:46] [INFO ] State equation strengthened by 278 read => feed constraints.
[2026-05-24 14:08:46] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2026-05-24 14:08:46] [INFO ] Redundant transitions in 14 ms returned []
Running 284 sub problems to find dead transitions.
[2026-05-24 14:08:46] [INFO ] Invariant cache hit.
[2026-05-24 14:08:46] [INFO ] State equation strengthened by 278 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 294/419 variables, 125/140 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 278/418 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/420 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/420 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 419 constraints, problems are : Problem set: 0 solved, 284 unsolved in 24944 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 126/126 constraints, ReadFeed: 278/278 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 294/419 variables, 125/140 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 278/418 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 284/702 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/420 variables, 1/703 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/420 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 703 constraints, problems are : Problem set: 0 solved, 284 unsolved in 23996 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 126/126 constraints, ReadFeed: 278/278 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48997ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 49000ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/232 places, 294/330 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49565 ms. Remains : 126/232 places, 294/330 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1 U p2))))))'
Stuttering acceptance computed with spot in 416 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-00
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-00 finished in 50082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0||X(F(!p1))) U X(X(p2)))))))'
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 330/330 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 223 transition count 312
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 223 transition count 312
Applied a total of 18 rules in 7 ms. Remains 223 /232 variables (removed 9) and now considering 312/330 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14859026235596457131.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13572713598097221813.kers'
[2026-05-24 14:09:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14859026235596457131.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13572713598097221813.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 223 cols 644 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 14:09:36] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13572713598097221813.kers
Total runtime 1 ms.
[2026-05-24 14:09:36] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-24 14:09:36] [INFO ] Invariant cache hit.
[2026-05-24 14:09:36] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:09:36] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2026-05-24 14:09:36] [INFO ] Invariant cache hit.
[2026-05-24 14:09:36] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 302 unsolved
SMT process timed out in 30045ms, After SMT, problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 30047ms
Starting structural reductions in LTL mode, iteration 1 : 223/232 places, 312/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30620 ms. Remains : 223/232 places, 312/330 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0||X(F(!p1))) U X(X(p2)))))))'
Stuttering acceptance computed with spot in 396 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), p1]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-01
Product exploration explored 100000 steps with 18115 reset in 334 ms.
Product exploration explored 100000 steps with 18184 reset in 179 ms.
Computed a total of 31 stabilizing places and 40 stable transitions
Computed a total of 31 stabilizing places and 40 stable transitions
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 15598 steps (93 resets) in 272 ms. (57 steps per ms) remains 0/5 properties
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), p1]
[2026-05-24 14:10:08] [INFO ] Invariant cache hit.
[2026-05-24 14:10:08] [INFO ] [Real]Absence check using 11 positive place invariants in 35 ms returned sat
[2026-05-24 14:10:08] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2026-05-24 14:10:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 14:10:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 23 ms returned sat
[2026-05-24 14:10:09] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2026-05-24 14:10:09] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:10:09] [INFO ] [Nat]Added 190 Read/Feed constraints in 18 ms returned unsat
Proved EG (NOT p2) asserting that LTL formula F !(NOT p2) is false.
Negative knowledge disproves property using: (F p2)
Knowledge-based reduction took 1563 ms.
FORMULA CANConstruction-PT-010-LTLFireability-01 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property CANConstruction-PT-010-LTLFireability-01 finished in 33160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p2)&&p1)) U (p3 U X(p4))))'
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 330/330 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 223 transition count 312
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 223 transition count 312
Applied a total of 18 rules in 11 ms. Remains 223 /232 variables (removed 9) and now considering 312/330 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1099844878219308818.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13444659122717372896.kers'
[2026-05-24 14:10:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1099844878219308818.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13444659122717372896.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 223 cols 644 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 14:10:09] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13444659122717372896.kers
Total runtime 2 ms.
[2026-05-24 14:10:09] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-24 14:10:09] [INFO ] Invariant cache hit.
[2026-05-24 14:10:09] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:10:09] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 223/232 places, 312/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 612 ms. Remains : 223/232 places, 312/330 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p2)&&p1)) U (p3 U X(p4))))'
Stuttering acceptance computed with spot in 439 ms :[(NOT p4), (NOT p4), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p2) (NOT p4))), (NOT p4), (AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (NOT p4), (AND (NOT p2) (NOT p4)), true, (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-02
Stuttering criterion allowed to conclude after 193 steps with 1 reset in 0 ms.
FORMULA CANConstruction-PT-010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-02 finished in 1116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(X((p1&&X(!p0))))))&&F(p2)))'
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 330/330 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 223 transition count 312
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 223 transition count 312
Applied a total of 18 rules in 12 ms. Remains 223 /232 variables (removed 9) and now considering 312/330 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14226297312272172566.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5298414579401385515.kers'
[2026-05-24 14:10:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14226297312272172566.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5298414579401385515.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 223 cols 644 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 14:10:10] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5298414579401385515.kers
Total runtime 1 ms.
[2026-05-24 14:10:10] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-24 14:10:10] [INFO ] Invariant cache hit.
[2026-05-24 14:10:10] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:10:10] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 223/232 places, 312/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 507 ms. Remains : 223/232 places, 312/330 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(X((p1&&X(!p0))))))&&F(p2)))'
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p1) p0), true, p0]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-03
Entered a terminal (fully accepting) state of product in 14 steps with 1 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-03 finished in 837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&F(p1)))))))'
Support contains 1 out of 232 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 330/330 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 232 transition count 268
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 125 place count 170 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 169 transition count 267
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 126 place count 169 transition count 257
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 146 place count 159 transition count 257
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 156 place count 149 transition count 237
Iterating global reduction 3 with 10 rules applied. Total rules applied 166 place count 149 transition count 237
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 172 place count 149 transition count 231
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 178 place count 143 transition count 231
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 196 place count 134 transition count 222
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 216 place count 124 transition count 292
Applied a total of 216 rules in 40 ms. Remains 124 /232 variables (removed 108) and now considering 292/330 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7157964216366248547.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15875826146790826389.kers'
[2026-05-24 14:10:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7157964216366248547.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15875826146790826389.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 292 rows 124 cols 685 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-24 14:10:11] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15875826146790826389.kers
Total runtime 3 ms.
[2026-05-24 14:10:11] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-24 14:10:11] [INFO ] Invariant cache hit.
[2026-05-24 14:10:11] [INFO ] State equation strengthened by 280 read => feed constraints.
[2026-05-24 14:10:11] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2026-05-24 14:10:11] [INFO ] Redundant transitions in 6 ms returned []
Running 282 sub problems to find dead transitions.
[2026-05-24 14:10:11] [INFO ] Invariant cache hit.
[2026-05-24 14:10:11] [INFO ] State equation strengthened by 280 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 292/415 variables, 123/134 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 280/414 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 1/416 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 0/416 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 415 constraints, problems are : Problem set: 0 solved, 282 unsolved in 19731 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 124/124 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 292/415 variables, 123/134 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 280/414 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 282/696 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/416 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/416 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 697 constraints, problems are : Problem set: 0 solved, 282 unsolved in 24196 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 124/124 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43983ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 43984ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/232 places, 292/330 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44499 ms. Remains : 124/232 places, 292/330 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&F(p1)))))))'
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-04
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-04 finished in 44585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(!p1)))||X(F(p2))))'
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 330/330 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 223 transition count 312
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 223 transition count 312
Applied a total of 18 rules in 6 ms. Remains 223 /232 variables (removed 9) and now considering 312/330 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10949821965929439768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14255450351701745417.kers'
[2026-05-24 14:10:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10949821965929439768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14255450351701745417.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 223 cols 644 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 14:10:55] [INFO ] Computed 11 invariants in 3 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14255450351701745417.kers
Total runtime 4 ms.
[2026-05-24 14:10:55] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-24 14:10:55] [INFO ] Invariant cache hit.
[2026-05-24 14:10:55] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:10:56] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2026-05-24 14:10:56] [INFO ] Invariant cache hit.
[2026-05-24 14:10:56] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 222/535 variables, and 251 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/223 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 240/240 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 240/251 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 20/331 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 20/391 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 20/411 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 20/431 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 20/451 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 20/471 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 20/491 constraints. Problems are: Problem set: 0 solved, 302 unsolved
SMT process timed out in 60081ms, After SMT, problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 223/232 places, 312/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60658 ms. Remains : 223/232 places, 312/330 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(!p1)))||X(F(p2))))'
Stuttering acceptance computed with spot in 197 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Computed a total of 31 stabilizing places and 40 stable transitions
Computed a total of 31 stabilizing places and 40 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 17 factoid took 15 ms. Proved property starting from automaton with 4 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 23 ms.
FORMULA CANConstruction-PT-010-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-010-LTLFireability-05 finished in 61220 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))&&G((X(p1)||F((!p2 U (G(!p2)||(!p2&&(!p0 U (p3||G(!p0)))))))))))'
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 330/330 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 223 transition count 312
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 223 transition count 312
Applied a total of 18 rules in 7 ms. Remains 223 /232 variables (removed 9) and now considering 312/330 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12256658231546683459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12824016232280090460.kers'
[2026-05-24 14:11:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12256658231546683459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12824016232280090460.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 223 cols 644 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 14:11:57] [INFO ] Computed 11 invariants in 3 ms
Computed 11 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12824016232280090460.kers
Total runtime 4 ms.
[2026-05-24 14:11:57] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-24 14:11:57] [INFO ] Invariant cache hit.
[2026-05-24 14:11:57] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:11:57] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 223/232 places, 312/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 223/232 places, 312/330 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&G((X(p1)||F((!p2 U (G(!p2)||(!p2&&(!p0 U (p3||G(!p0)))))))))))'
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p3) p0 (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), true, p2, (AND (NOT p3) p0 p2)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-08
Entered a terminal (fully accepting) state of product in 404 steps with 3 reset in 2 ms.
FORMULA CANConstruction-PT-010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-08 finished in 967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 1 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 330/330 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 232 transition count 268
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 170 transition count 268
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 124 place count 170 transition count 258
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 144 place count 160 transition count 258
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 154 place count 150 transition count 238
Iterating global reduction 2 with 10 rules applied. Total rules applied 164 place count 150 transition count 238
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 6 rules applied. Total rules applied 170 place count 150 transition count 232
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 176 place count 144 transition count 232
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 196 place count 134 transition count 222
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 216 place count 124 transition count 292
Applied a total of 216 rules in 36 ms. Remains 124 /232 variables (removed 108) and now considering 292/330 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-584828456666820294.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2704791082778592552.kers'
[2026-05-24 14:11:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-584828456666820294.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2704791082778592552.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 292 rows 124 cols 694 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-24 14:11:57] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2704791082778592552.kers
Total runtime 1 ms.
[2026-05-24 14:11:58] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-24 14:11:58] [INFO ] Invariant cache hit.
[2026-05-24 14:11:58] [INFO ] State equation strengthened by 280 read => feed constraints.
[2026-05-24 14:11:58] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2026-05-24 14:11:58] [INFO ] Redundant transitions in 6 ms returned []
Running 282 sub problems to find dead transitions.
[2026-05-24 14:11:58] [INFO ] Invariant cache hit.
[2026-05-24 14:11:58] [INFO ] State equation strengthened by 280 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 292/415 variables, 123/134 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 280/414 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 1/416 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 0/416 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 415 constraints, problems are : Problem set: 0 solved, 282 unsolved in 20391 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 124/124 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 292/415 variables, 123/134 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 280/414 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 282/696 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/416 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/416 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 697 constraints, problems are : Problem set: 0 solved, 282 unsolved in 23959 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 124/124 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44391ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 44392ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/232 places, 292/330 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44908 ms. Remains : 124/232 places, 292/330 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 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-09
Product exploration explored 100000 steps with 2310 reset in 253 ms.
Stack based approach found an accepted trace after 248 steps with 5 reset with depth 24 and stack size 24 in 1 ms.
FORMULA CANConstruction-PT-010-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-09 finished in 45290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(X(G((p2&&X(!p0)))))))'
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 330/330 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 223 transition count 312
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 223 transition count 312
Applied a total of 18 rules in 6 ms. Remains 223 /232 variables (removed 9) and now considering 312/330 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3042418730705796635.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17349480766498583824.kers'
[2026-05-24 14:12:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3042418730705796635.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17349480766498583824.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 223 cols 644 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 14:12:43] [INFO ] Computed 11 invariants in 3 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17349480766498583824.kers
Total runtime 4 ms.
[2026-05-24 14:12:43] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-24 14:12:43] [INFO ] Invariant cache hit.
[2026-05-24 14:12:43] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:12:43] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2026-05-24 14:12:43] [INFO ] Invariant cache hit.
[2026-05-24 14:12:43] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 222/535 variables, and 251 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/223 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 240/240 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 240/251 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 20/331 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 20/391 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 20/411 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 20/431 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 20/451 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 20/471 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 20/491 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 20/511 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 222/535 variables, and 511 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/223 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/302 constraints, Known Traps: 500/500 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 223/232 places, 312/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60615 ms. Remains : 223/232 places, 312/330 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(X(G((p2&&X(!p0)))))))'
Stuttering acceptance computed with spot in 367 ms :[true, (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (NOT p2) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-14
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-14 finished in 61024 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(p0)&&G(p1))||X(G(p0))))))))'
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 330/330 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 224 transition count 314
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 224 transition count 314
Applied a total of 16 rules in 7 ms. Remains 224 /232 variables (removed 8) and now considering 314/330 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6423193989743018587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4924683944249500247.kers'
[2026-05-24 14:13:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6423193989743018587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4924683944249500247.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 314 rows 224 cols 648 entries
Finished phase 1 with 213 SingleSign rule and 0 generalized
[2026-05-24 14:13:44] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4924683944249500247.kers
Total runtime 4 ms.
[2026-05-24 14:13:44] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-24 14:13:44] [INFO ] Invariant cache hit.
[2026-05-24 14:13:44] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:13:44] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2026-05-24 14:13:44] [INFO ] Invariant cache hit.
[2026-05-24 14:13:44] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 223/538 variables, and 254 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/224 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 243/243 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 243/254 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 20/334 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 20/354 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 20/414 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 20/434 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 20/454 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 20/474 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 223/538 variables, and 477 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/224 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/304 constraints, Known Traps: 466/466 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 224/232 places, 314/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60589 ms. Remains : 224/232 places, 314/330 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(G(p0))||(X(p0)&&G(p1))))))))'
Stuttering acceptance computed with spot in 353 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLFireability-15
Entered a terminal (fully accepting) state of product in 103 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLFireability-15 finished in 60982 ms.
All properties solved by simple procedures.
Total runtime 422246 ms.

BK_STOP 1779632085295

--------------------
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-010"
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-010, 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-177946842100620"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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