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-177946842100699.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is CANInsertWithFailure-PT-005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100699
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 9.0K Mar 6 10:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 6 10:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 10:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 10:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 15 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 10:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Mar 6 10:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 6 10:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Mar 6 10:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 202K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779662360809

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 22:39:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 22:39:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 22:39:22] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2026-05-24 22:39:22] [INFO ] Transformed 114 places.
[2026-05-24 22:39:22] [INFO ] Transformed 180 transitions.
[2026-05-24 22:39:22] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 17 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (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-2611876028055252595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11590406720340667513.kers'
[2026-05-24 22:39:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2611876028055252595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11590406720340667513.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:39:22] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11590406720340667513.kers
Total runtime 2 ms.
[2026-05-24 22:39:22] [INFO ] Implicit Places using invariants in 217 ms returned []
[2026-05-24 22:39:22] [INFO ] Invariant cache hit.
[2026-05-24 22:39:22] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:39:22] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:39:22] [INFO ] Invariant cache hit.
[2026-05-24 22:39:22] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 17392 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 18303 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35752ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 35779ms
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36252 ms. Remains : 113/114 places, 180/180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:39:58] [INFO ] Invariant cache hit.
[2026-05-24 22:39:58] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-24 22:39:58] [INFO ] Invariant cache hit.
[2026-05-24 22:39:58] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:39:58] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 113/113 places, 180/180 transitions.
Support contains 36 out of 113 places after structural reductions.
[2026-05-24 22:39:58] [INFO ] Flatten gal took : 38 ms
[2026-05-24 22:39:58] [INFO ] Flatten gal took : 17 ms
[2026-05-24 22:39:59] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 33 out of 113 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (413 resets) in 871 ms. (45 steps per ms) remains 8/26 properties
BEST_FIRST walk for 40001 steps (96 resets) in 229 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (93 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (95 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (99 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (92 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (88 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (95 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (104 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
[2026-05-24 22:39:59] [INFO ] Invariant cache hit.
[2026-05-24 22:39:59] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 95/103 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 6/109 variables, 3/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/111 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 180/291 variables, 111/121 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 45/166 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/166 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 2/293 variables, 2/168 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 0/168 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/293 variables, 0/168 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 168 constraints, problems are : Problem set: 2 solved, 6 unsolved in 888 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 95/101 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/109 variables, 4/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/111 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 7/17 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 180/291 variables, 111/128 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 45/173 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 6/179 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/179 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/293 variables, 2/181 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/293 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/293 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 181 constraints, problems are : Problem set: 3 solved, 5 unsolved in 1184 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2081ms problems are : Problem set: 3 solved, 5 unsolved
Parikh walk visited 0 properties in 324 ms.
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 106 place count 60 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 116 place count 60 transition count 117
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 60 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 59 transition count 116
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 144 place count 59 transition count 116
Applied a total of 144 rules in 31 ms. Remains 59 /113 variables (removed 54) and now considering 116/180 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 59/113 places, 116/180 transitions.
RANDOM walk for 40000 steps (1420 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (293 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (277 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (264 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (275 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (266 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
Probably explored full state space saw : 15825 states, properties seen :0
Probabilistic random walk after 87731 steps, saw 15825 distinct states, run finished after 253 ms. (steps per millisecond=346 ) properties seen :0
Explored full state space saw : 15825 states, properties seen :0
Exhaustive walk after 87731 steps, saw 15825 distinct states, run finished after 217 ms. (steps per millisecond=404 ) properties seen :0
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 22 stabilizing places and 35 stable transitions
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F((p0&&X(X(X(X(F(p1))))))))))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:40:03] [INFO ] Invariant cache hit.
[2026-05-24 22:40:03] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-24 22:40:03] [INFO ] Invariant cache hit.
[2026-05-24 22:40:03] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:40:03] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 113/113 places, 180/180 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F((p0&&X(X(X(X(F(p1))))))))))))'
Stuttering acceptance computed with spot in 377 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLCardinality-03
Stuttering criterion allowed to conclude after 662 steps with 9 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLCardinality-03 finished in 684 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))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 113 transition count 146
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 79 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 68 place count 79 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 108 place count 59 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 59 transition count 114
Applied a total of 120 rules in 28 ms. Remains 59 /113 variables (removed 54) and now considering 114/180 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14173869010856879086.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4941949164608817298.kers'
[2026-05-24 22:40:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14173869010856879086.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4941949164608817298.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 59 cols 264 entries
Finished phase 1 with 47 SingleSign rule and 5 generalized
[2026-05-24 22:40:03] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4941949164608817298.kers
Total runtime 2 ms.
[2026-05-24 22:40:03] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-24 22:40:03] [INFO ] Invariant cache hit.
[2026-05-24 22:40:03] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-24 22:40:03] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2026-05-24 22:40:03] [INFO ] Redundant transitions in 4 ms returned []
Running 109 sub problems to find dead transitions.
[2026-05-24 22:40:03] [INFO ] Invariant cache hit.
[2026-05-24 22:40:03] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 114/172 variables, 58/83 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 67/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 1/173 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/173 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 151 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7920 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 114/172 variables, 58/83 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 67/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 109/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 1/173 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 260 constraints, problems are : Problem set: 0 solved, 109 unsolved in 9450 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17384ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 17384ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/113 places, 114/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17600 ms. Remains : 59/113 places, 114/180 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))'
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLCardinality-05
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLCardinality-05 finished in 17663 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((X(p0)||F(p1))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (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-9187090203338171512.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10512784789760846356.kers'
[2026-05-24 22:40:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9187090203338171512.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10512784789760846356.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:40:21] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10512784789760846356.kers
Total runtime 1 ms.
[2026-05-24 22:40:21] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 22:40:21] [INFO ] Invariant cache hit.
[2026-05-24 22:40:21] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:40:21] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:40:21] [INFO ] Invariant cache hit.
[2026-05-24 22:40:21] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 16736 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 18384 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35136ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 35138ms
Finished structural reductions in LTL mode , in 1 iterations and 35333 ms. Remains : 113/113 places, 180/180 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)||F(p1))))'
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLCardinality-06
Stuttering criterion allowed to conclude after 232 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLCardinality-06 finished in 35484 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||G(p1)))))'
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 113 transition count 146
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 79 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 92 place count 67 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 67 transition count 130
Partial Post-agglomeration rule applied 14 times.
Drop transitions (Partial Post agglomeration) removed 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 110 place count 67 transition count 130
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 116 place count 61 transition count 124
Iterating global reduction 3 with 6 rules applied. Total rules applied 122 place count 61 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 61 transition count 121
Applied a total of 125 rules in 25 ms. Remains 61 /113 variables (removed 52) and now considering 121/180 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1328087492198445058.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9119277031203026951.kers'
[2026-05-24 22:40:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1328087492198445058.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9119277031203026951.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 121 rows 61 cols 277 entries
Finished phase 1 with 49 SingleSign rule and 5 generalized
[2026-05-24 22:40:56] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9119277031203026951.kers
Total runtime 0 ms.
[2026-05-24 22:40:56] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-24 22:40:56] [INFO ] Invariant cache hit.
[2026-05-24 22:40:56] [INFO ] State equation strengthened by 69 read => feed constraints.
[2026-05-24 22:40:57] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2026-05-24 22:40:57] [INFO ] Redundant transitions in 6 ms returned []
Running 116 sub problems to find dead transitions.
[2026-05-24 22:40:57] [INFO ] Invariant cache hit.
[2026-05-24 22:40:57] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 121/181 variables, 60/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 69/154 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 1/182 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (OVERLAPS) 0/182 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 155 constraints, problems are : Problem set: 0 solved, 116 unsolved in 9852 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 121/181 variables, 60/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 69/154 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 116/270 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 1/182 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 271 constraints, problems are : Problem set: 0 solved, 116 unsolved in 10409 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20271ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 20271ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/113 places, 121/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20457 ms. Remains : 61/113 places, 121/180 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((G(p0)||p1))))'
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLCardinality-07
Product exploration explored 100000 steps with 3201 reset in 214 ms.
Product exploration explored 100000 steps with 3179 reset in 169 ms.
Computed a total of 18 stabilizing places and 25 stable transitions
Computed a total of 18 stabilizing places and 25 stable transitions
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (1286 resets) in 171 ms. (232 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (255 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
[2026-05-24 22:41:17] [INFO ] Invariant cache hit.
[2026-05-24 22:41:17] [INFO ] State equation strengthened by 69 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/57 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 121/180 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 69/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/182 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/182 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/57 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/59 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 121/180 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 69/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/182 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/182 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 370ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 121/121 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 120
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 24 place count 60 transition count 120
Applied a total of 24 rules in 12 ms. Remains 60 /61 variables (removed 1) and now considering 120/121 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 60/61 places, 120/121 transitions.
RANDOM walk for 40000 steps (1401 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (261 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Probably explored full state space saw : 18853 states, properties seen :0
Probabilistic random walk after 105368 steps, saw 18853 distinct states, run finished after 180 ms. (steps per millisecond=585 ) properties seen :0
Explored full state space saw : 18853 states, properties seen :0
Exhaustive walk after 105368 steps, saw 18853 distinct states, run finished after 107 ms. (steps per millisecond=984 ) properties seen :0
Found 1 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 15 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 931 ms.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-005-LTLCardinality-07 finished in 21871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(X(X(p1))&&G(p2)))))'
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (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-2068397342898893057.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3759695503531129604.kers'
[2026-05-24 22:41:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2068397342898893057.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3759695503531129604.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:41:18] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3759695503531129604.kers
Total runtime 5 ms.
[2026-05-24 22:41:18] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-24 22:41:18] [INFO ] Invariant cache hit.
[2026-05-24 22:41:18] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:41:18] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:41:18] [INFO ] Invariant cache hit.
[2026-05-24 22:41:18] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 17140 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 18399 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35551ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 35552ms
Finished structural reductions in LTL mode , in 1 iterations and 35748 ms. Remains : 113/113 places, 180/180 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(X(X(p1))&&G(p2)))))'
Stuttering acceptance computed with spot in 188 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 210 steps with 2 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLCardinality-09 finished in 35970 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(G(p0)) U (p1&&F(!p0)))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:41:54] [INFO ] Invariant cache hit.
[2026-05-24 22:41:54] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-24 22:41:54] [INFO ] Invariant cache hit.
[2026-05-24 22:41:54] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:41:54] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 113/113 places, 180/180 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(G(p0)) U (p1&&F(!p0)))))'
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p0), p0]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLCardinality-10
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLCardinality-10 finished in 359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:41:55] [INFO ] Invariant cache hit.
[2026-05-24 22:41:55] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-24 22:41:55] [INFO ] Invariant cache hit.
[2026-05-24 22:41:55] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:41:55] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 113/113 places, 180/180 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLCardinality-12 finished in 333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&X(F(p1))))&&G(p0))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:41:55] [INFO ] Invariant cache hit.
[2026-05-24 22:41:55] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-24 22:41:55] [INFO ] Invariant cache hit.
[2026-05-24 22:41:55] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:41:55] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 113/113 places, 180/180 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&X(F(p1))))&&G(p0))))'
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 183 steps with 2 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLCardinality-14 finished in 445 ms.
All properties solved by simple procedures.
Total runtime 153879 ms.

BK_STOP 1779662515857

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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