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.r194-tall-177969914000307.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 NoC3x3-PT-4A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.5K Mar 8 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 8 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 8 06:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 8 06:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 16 08:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 16 08:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 8 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 8 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 8 06:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 8 06:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 16 08:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 144K 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 NoC3x3-PT-4A-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779749482903

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-4A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 22:51:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 22:51:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 22:51:24] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2026-05-25 22:51:24] [INFO ] Transformed 293 places.
[2026-05-25 22:51:24] [INFO ] Transformed 608 transitions.
[2026-05-25 22:51:24] [INFO ] Found NUPN structural information;
[2026-05-25 22:51:24] [INFO ] Parsed PT model containing 293 places and 608 transitions and 1905 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 155 transitions
Reduce redundant transitions removed 155 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-4A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 453/453 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 243 transition count 373
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 243 transition count 373
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 142 place count 243 transition count 331
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 149 place count 236 transition count 331
Applied a total of 149 rules in 69 ms. Remains 236 /293 variables (removed 57) and now considering 331/453 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16335155019280465481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2583052483964937112.kers'
[2026-05-25 22:51:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16335155019280465481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2583052483964937112.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 331 rows 234 cols 1098 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-25 22:51:24] [INFO ] Computed 59 invariants in 1 ms
Computed 59 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2583052483964937112.kers
Total runtime 2 ms.
[2026-05-25 22:51:24] [INFO ] Implicit Places using invariants in 362 ms returned []
[2026-05-25 22:51:24] [INFO ] Invariant cache hit.
[2026-05-25 22:51:24] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2026-05-25 22:51:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 2/236 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 331/567 variables, 236/295 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 0/567 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 295 constraints, problems are : Problem set: 0 solved, 330 unsolved in 22670 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 2/236 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 331/567 variables, 236/295 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 330/625 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (OVERLAPS) 0/567 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 625 constraints, problems are : Problem set: 0 solved, 330 unsolved in 27581 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50382ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 50400ms
Starting structural reductions in LTL mode, iteration 1 : 236/293 places, 331/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51106 ms. Remains : 236/293 places, 331/453 transitions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 331/331 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 331/331 (removed 0) transitions.
[2026-05-25 22:52:15] [INFO ] Invariant cache hit.
[2026-05-25 22:52:15] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-25 22:52:15] [INFO ] Invariant cache hit.
[2026-05-25 22:52:15] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 236/236 places, 331/331 transitions.
Support contains 25 out of 236 places after structural reductions.
[2026-05-25 22:52:15] [INFO ] Flatten gal took : 50 ms
[2026-05-25 22:52:15] [INFO ] Flatten gal took : 23 ms
[2026-05-25 22:52:15] [INFO ] Input system was already deterministic with 331 transitions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (8 resets) in 1130 ms. (35 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
[2026-05-25 22:52:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 229/236 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 331/567 variables, 236/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/567 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 236/236 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Int declared 7/567 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 2/59 constraints, State Equation: 0/236 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA NoC3x3-PT-4A-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 787 edges and 236 vertex of which 234 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 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||G(p0))))'
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 331/331 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 331
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 228 transition count 325
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 228 transition count 325
Applied a total of 14 rules in 9 ms. Remains 228 /236 variables (removed 8) and now considering 325/331 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-412815580555796231.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1591453606962493590.kers'
[2026-05-25 22:52:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-412815580555796231.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1591453606962493590.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 325 rows 228 cols 1074 entries
Finished phase 1 with 171 SingleSign rule and 0 generalized
[2026-05-25 22:52:16] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1591453606962493590.kers
Total runtime 1 ms.
[2026-05-25 22:52:16] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 22:52:16] [INFO ] Invariant cache hit.
[2026-05-25 22:52:17] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2026-05-25 22:52:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 17528 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 23997 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41566ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 41568ms
Starting structural reductions in LTL mode, iteration 1 : 228/236 places, 325/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41817 ms. Remains : 228/236 places, 325/331 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)||!p0)))'
Stuttering acceptance computed with spot in 240 ms :[true, false, false, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 151 steps with 0 reset in 8 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLCardinality-01 finished in 42134 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||X(X(!p1))) U (G((!p0||X(X(!p1))))||((!p0||X(X(!p1)))&&X(X(X(G(p2))))))))'
Support contains 6 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 331/331 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 331
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 230 transition count 326
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 230 transition count 326
Applied a total of 11 rules in 13 ms. Remains 230 /236 variables (removed 6) and now considering 326/331 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3128579290070311687.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1790466539529848210.kers'
[2026-05-25 22:52:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3128579290070311687.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1790466539529848210.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 326 rows 229 cols 1078 entries
Finished phase 1 with 172 SingleSign rule and 0 generalized
[2026-05-25 22:52:58] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1790466539529848210.kers
Total runtime 1 ms.
[2026-05-25 22:52:59] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-25 22:52:59] [INFO ] Invariant cache hit.
[2026-05-25 22:52:59] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2026-05-25 22:52:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 1/230 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (OVERLAPS) 326/556 variables, 230/288 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (OVERLAPS) 0/556 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 288 constraints, problems are : Problem set: 0 solved, 325 unsolved in 21566 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 1/230 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (OVERLAPS) 326/556 variables, 230/288 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 325/613 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 8 (OVERLAPS) 0/556 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 613 constraints, problems are : Problem set: 0 solved, 325 unsolved in 26645 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48247ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 48248ms
Starting structural reductions in LTL mode, iteration 1 : 230/236 places, 326/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48576 ms. Remains : 230/236 places, 326/331 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||X(X(!p1))) U (G((!p0||X(X(!p1))))||(X(X(X(G(p2))))&&(!p0||X(X(!p1)))))))'
Stuttering acceptance computed with spot in 337 ms :[(AND p0 p1), p1, (AND p0 p1 (NOT p2)), p1, true, (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 360 steps with 0 reset in 7 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLCardinality-06 finished in 48965 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((p1&&F(p2)))||p0))))'
Support contains 6 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 331/331 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 331
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 231 transition count 328
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 231 transition count 328
Applied a total of 8 rules in 10 ms. Remains 231 /236 variables (removed 5) and now considering 328/331 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11592762505982795385.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16216924854456699214.kers'
[2026-05-25 22:53:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11592762505982795385.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16216924854456699214.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 328 rows 231 cols 1086 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-25 22:53:47] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16216924854456699214.kers
Total runtime 2 ms.
[2026-05-25 22:53:47] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-25 22:53:47] [INFO ] Invariant cache hit.
[2026-05-25 22:53:48] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
[2026-05-25 22:53:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (OVERLAPS) 328/559 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 0/559 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 288 constraints, problems are : Problem set: 0 solved, 327 unsolved in 18170 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (OVERLAPS) 328/559 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 327/615 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (OVERLAPS) 0/559 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 615 constraints, problems are : Problem set: 0 solved, 327 unsolved in 24924 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43120ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 43120ms
Starting structural reductions in LTL mode, iteration 1 : 231/236 places, 328/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43379 ms. Remains : 231/236 places, 328/331 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((p1&&F(p2)))||p0))))'
Stuttering acceptance computed with spot in 246 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 427 ms.
Product exploration explored 100000 steps with 33333 reset in 379 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 2 factoid took 52 ms. Proved property starting from automaton with 6 states, 7 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 62 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-4A-LTLCardinality-08 finished in 44538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(G((F(p2)&&p1)))&&p0))))'
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 331/331 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 331
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 229 transition count 326
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 229 transition count 326
Applied a total of 12 rules in 12 ms. Remains 229 /236 variables (removed 7) and now considering 326/331 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9217290176068131311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2777954970051843272.kers'
[2026-05-25 22:54:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9217290176068131311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2777954970051843272.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 326 rows 229 cols 1078 entries
Finished phase 1 with 172 SingleSign rule and 0 generalized
[2026-05-25 22:54:32] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2777954970051843272.kers
Total runtime 2 ms.
[2026-05-25 22:54:32] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-25 22:54:32] [INFO ] Invariant cache hit.
[2026-05-25 22:54:32] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2026-05-25 22:54:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 326/555 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (OVERLAPS) 0/555 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 286 constraints, problems are : Problem set: 0 solved, 325 unsolved in 17987 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 326/555 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 325/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 611 constraints, problems are : Problem set: 0 solved, 325 unsolved in 23578 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41593ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 41593ms
Starting structural reductions in LTL mode, iteration 1 : 229/236 places, 326/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41880 ms. Remains : 229/236 places, 326/331 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(G((F(p2)&&p1)))&&p0))))'
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-10
Product exploration explored 100000 steps with 11 reset in 313 ms.
Stack based approach found an accepted trace after 76 steps with 0 reset with depth 77 and stack size 77 in 1 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLCardinality-10 finished in 42400 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((X(!p1) U ((p2&&X(!p1))||X(G(!p1)))))))'
Support contains 5 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 331/331 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 331
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 228 transition count 325
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 228 transition count 325
Applied a total of 14 rules in 10 ms. Remains 228 /236 variables (removed 8) and now considering 325/331 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7551595047530726321.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-830792823029719042.kers'
[2026-05-25 22:55:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7551595047530726321.kers, --Pflows, --basisKERS=/tmp/petrispot-output-830792823029719042.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 325 rows 228 cols 1074 entries
Finished phase 1 with 171 SingleSign rule and 0 generalized
[2026-05-25 22:55:14] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-830792823029719042.kers
Total runtime 2 ms.
[2026-05-25 22:55:14] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 22:55:14] [INFO ] Invariant cache hit.
[2026-05-25 22:55:15] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2026-05-25 22:55:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 17826 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 24076 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41926ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 41927ms
Starting structural reductions in LTL mode, iteration 1 : 228/236 places, 325/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42171 ms. Remains : 228/236 places, 325/331 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((X(!p1) U ((p2&&X(!p1))||X(G(!p1)))))))'
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1, true]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLCardinality-12 finished in 42403 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 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 331/331 transitions.
Graph (trivial) has 140 edges and 236 vertex of which 75 / 236 are part of one of the 33 SCC in 7 ms
Free SCC test removed 42 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Graph (complete) has 704 edges and 194 vertex of which 192 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 182 transition count 216
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 65 place count 159 transition count 216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 70 place count 154 transition count 211
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 154 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 99 place count 154 transition count 187
Applied a total of 99 rules in 38 ms. Remains 154 /236 variables (removed 82) and now considering 187/331 (removed 144) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15229346074633567102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18394690113317377052.kers'
[2026-05-25 22:55:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15229346074633567102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18394690113317377052.kers]
Normalized transition count is 186 out of 187 initially.
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 0 ms.
// Phase 1: matrix 186 rows 130 cols 429 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-25 22:55:57] [INFO ] Computed 48 invariants in 0 ms
Computed 48 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18394690113317377052.kers
Total runtime 1 ms.
[2026-05-25 22:55:57] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 22:55:57] [INFO ] Invariant cache hit.
[2026-05-25 22:55:57] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-25 22:55:57] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2026-05-25 22:55:57] [INFO ] Redundant transitions in 61 ms returned []
Running 162 sub problems to find dead transitions.
[2026-05-25 22:55:57] [INFO ] Invariant cache hit.
[2026-05-25 22:55:57] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 186/340 variables, 154/202 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 56/258 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 0/340 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/341 variables, and 258 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5582 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 154/154 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 186/340 variables, 154/202 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 56/258 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 162/420 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/340 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/341 variables, and 420 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5569 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 154/154 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11165ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 11165ms
Starting structural reductions in SI_LTL mode, iteration 1 : 154/236 places, 187/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11525 ms. Remains : 154/236 places, 187/331 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 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLCardinality-15 finished in 11642 ms.
All properties solved by simple procedures.
Total runtime 284851 ms.

BK_STOP 1779749768873

--------------------
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="NoC3x3-PT-4A"
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 NoC3x3-PT-4A, 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 r194-tall-177969914000307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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