About the Execution of ITS-Tools for NoC3x3-PT-4A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 565.020 | 412662.00 | 495052.00 | 1479.40 | FTFFFFFFFFFFFFFF | normal |
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-177969914000308.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000308
=====================================================================
--------------------
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-LTLFireability-00
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779749746114
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202604301425
[2026-05-25 22:55:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 22:55:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 22:55:47] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2026-05-25 22:55:47] [INFO ] Transformed 293 places.
[2026-05-25 22:55:47] [INFO ] Transformed 608 transitions.
[2026-05-25 22:55:47] [INFO ] Found NUPN structural information;
[2026-05-25 22:55:47] [INFO ] Parsed PT model containing 293 places and 608 transitions and 1905 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 155 transitions
Reduce redundant transitions removed 155 transitions.
FORMULA NoC3x3-PT-4A-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 453/453 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 244 transition count 375
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 244 transition count 375
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 0 with 43 rules applied. Total rules applied 141 place count 244 transition count 332
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 150 place count 235 transition count 332
Applied a total of 150 rules in 50 ms. Remains 235 /293 variables (removed 58) and now considering 332/453 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3386798528086262765.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9455610333571666941.kers'
[2026-05-25 22:55:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3386798528086262765.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9455610333571666941.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 332 rows 235 cols 1102 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-25 22:55:47] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9455610333571666941.kers
Total runtime 3 ms.
[2026-05-25 22:55:48] [INFO ] Implicit Places using invariants in 301 ms returned []
[2026-05-25 22:55:48] [INFO ] Invariant cache hit.
[2026-05-25 22:55:48] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2026-05-25 22:55:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (OVERLAPS) 332/567 variables, 235/292 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (OVERLAPS) 0/567 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 331 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 292 constraints, problems are : Problem set: 0 solved, 331 unsolved in 19273 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (OVERLAPS) 332/567 variables, 235/292 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 331/623 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (OVERLAPS) 0/567 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 331 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 623 constraints, problems are : Problem set: 0 solved, 331 unsolved in 25718 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45105ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 45126ms
Starting structural reductions in LTL mode, iteration 1 : 235/293 places, 332/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45799 ms. Remains : 235/293 places, 332/453 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2026-05-25 22:56:33] [INFO ] Invariant cache hit.
[2026-05-25 22:56:33] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-25 22:56:33] [INFO ] Invariant cache hit.
[2026-05-25 22:56:33] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 235/235 places, 332/332 transitions.
Support contains 48 out of 235 places after structural reductions.
[2026-05-25 22:56:33] [INFO ] Flatten gal took : 57 ms
[2026-05-25 22:56:33] [INFO ] Flatten gal took : 24 ms
[2026-05-25 22:56:34] [INFO ] Input system was already deterministic with 332 transitions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (8 resets) in 1677 ms. (23 steps per ms) remains 1/32 properties
BEST_FIRST walk for 28460 steps (5 resets) in 93 ms. (302 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-4A-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((p0&&F(p1)))&&X(p2)))))'
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 332/332 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 229 transition count 326
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 326
Applied a total of 12 rules in 9 ms. Remains 229 /235 variables (removed 6) and now considering 326/332 (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-12853901056697413063.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11704413620847216516.kers'
[2026-05-25 22:56:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12853901056697413063.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11704413620847216516.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:56:35] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11704413620847216516.kers
Total runtime 1 ms.
[2026-05-25 22:56:35] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-25 22:56:35] [INFO ] Invariant cache hit.
[2026-05-25 22:56:35] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2026-05-25 22:56:35] [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 18186 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 24629 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 42870ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 42871ms
Starting structural reductions in LTL mode, iteration 1 : 229/235 places, 326/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43152 ms. Remains : 229/235 places, 326/332 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((F((p0&&F(p1)))&&X(p2)))))'
Stuttering acceptance computed with spot in 438 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-00 finished in 43689 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((G(p0)||(F(G(p1)) U (p1||(F(p2) U p3))))))'
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 332/332 transitions.
Graph (trivial) has 129 edges and 235 vertex of which 69 / 235 are part of one of the 30 SCC in 4 ms
Free SCC test removed 39 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 190 transition count 249
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 190 transition count 249
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 190 transition count 246
Applied a total of 16 rules in 36 ms. Remains 190 /235 variables (removed 45) and now considering 246/332 (removed 86) transitions.
[2026-05-25 22:57:18] [INFO ] Flow matrix only has 217 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17301409698369077536.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1540812938818508465.kers'
[2026-05-25 22:57:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17301409698369077536.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1540812938818508465.kers]
Normalized transition count is 216 out of 217 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 216 rows 181 cols 655 entries
Finished phase 1 with 133 SingleSign rule and 0 generalized
[2026-05-25 22:57:18] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1540812938818508465.kers
Total runtime 1 ms.
[2026-05-25 22:57:18] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 22:57:18] [INFO ] Flow matrix only has 217 transitions (discarded 29 similar events)
[2026-05-25 22:57:18] [INFO ] Invariant cache hit.
[2026-05-25 22:57:19] [INFO ] State equation strengthened by 98 read => feed constraints.
[2026-05-25 22:57:19] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2026-05-25 22:57:19] [INFO ] Redundant transitions in 12 ms returned []
Running 245 sub problems to find dead transitions.
[2026-05-25 22:57:19] [INFO ] Flow matrix only has 217 transitions (discarded 29 similar events)
[2026-05-25 22:57:19] [INFO ] Invariant cache hit.
[2026-05-25 22:57:19] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 216/406 variables, 190/247 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 97/344 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 1/407 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 0/407 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 345 constraints, problems are : Problem set: 0 solved, 245 unsolved in 14779 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 190/190 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 216/406 variables, 190/247 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 97/344 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 245/589 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (OVERLAPS) 1/407 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (OVERLAPS) 0/407 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 590 constraints, problems are : Problem set: 0 solved, 245 unsolved in 19413 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 190/190 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34225ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 34226ms
Starting structural reductions in SI_LTL mode, iteration 1 : 190/235 places, 246/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34609 ms. Remains : 190/235 places, 246/332 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((G(p0)||(F(G(p1)) U (p1||(F(p2) U p3))))))'
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p0) p3), false]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-02 finished in 34870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(X(G(p2))||p1)))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 332/332 transitions.
Graph (trivial) has 134 edges and 235 vertex of which 70 / 235 are part of one of the 31 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 189 transition count 247
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 189 transition count 247
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 189 transition count 245
Applied a total of 17 rules in 21 ms. Remains 189 /235 variables (removed 46) and now considering 245/332 (removed 87) transitions.
[2026-05-25 22:57:53] [INFO ] Flow matrix only has 215 transitions (discarded 30 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9135088422386927643.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8496546912089444905.kers'
[2026-05-25 22:57:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9135088422386927643.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8496546912089444905.kers]
Normalized transition count is 214 out of 215 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 214 rows 181 cols 656 entries
Finished phase 1 with 132 SingleSign rule and 0 generalized
[2026-05-25 22:57:53] [INFO ] Computed 57 invariants in 0 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8496546912089444905.kers
Total runtime 1 ms.
[2026-05-25 22:57:53] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-25 22:57:53] [INFO ] Flow matrix only has 215 transitions (discarded 30 similar events)
[2026-05-25 22:57:53] [INFO ] Invariant cache hit.
[2026-05-25 22:57:53] [INFO ] State equation strengthened by 95 read => feed constraints.
[2026-05-25 22:57:54] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2026-05-25 22:57:54] [INFO ] Redundant transitions in 4 ms returned []
Running 244 sub problems to find dead transitions.
[2026-05-25 22:57:54] [INFO ] Flow matrix only has 215 transitions (discarded 30 similar events)
[2026-05-25 22:57:54] [INFO ] Invariant cache hit.
[2026-05-25 22:57:54] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 214/403 variables, 189/246 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 94/340 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 1/404 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 0/404 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 341 constraints, problems are : Problem set: 0 solved, 244 unsolved in 13790 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 189/189 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 214/403 variables, 189/246 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 94/340 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 244/584 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (OVERLAPS) 0/404 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 585 constraints, problems are : Problem set: 0 solved, 244 unsolved in 18174 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 189/189 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31992ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 31994ms
Starting structural reductions in SI_LTL mode, iteration 1 : 189/235 places, 245/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32393 ms. Remains : 189/235 places, 245/332 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(X(G(p2))||p1)))))'
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-03
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-03 finished in 32534 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||(p1&&G(p2))))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 332/332 transitions.
Graph (trivial) has 133 edges and 235 vertex of which 71 / 235 are part of one of the 31 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 185 transition count 220
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 161 transition count 220
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 73 place count 154 transition count 213
Iterating global reduction 2 with 7 rules applied. Total rules applied 80 place count 154 transition count 213
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 2 with 23 rules applied. Total rules applied 103 place count 154 transition count 190
Applied a total of 103 rules in 21 ms. Remains 154 /235 variables (removed 81) and now considering 190/332 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2338082228035725658.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15246731091889786748.kers'
[2026-05-25 22:58:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2338082228035725658.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15246731091889786748.kers]
Normalized transition count is 189 out of 190 initially.
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 0 ms.
// Phase 1: matrix 189 rows 132 cols 456 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-25 22:58:26] [INFO ] Computed 48 invariants in 1 ms
Computed 48 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15246731091889786748.kers
Total runtime 1 ms.
[2026-05-25 22:58:26] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 22:58:26] [INFO ] Invariant cache hit.
[2026-05-25 22:58:26] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-25 22:58:26] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2026-05-25 22:58:26] [INFO ] Redundant transitions in 56 ms returned []
Running 165 sub problems to find dead transitions.
[2026-05-25 22:58:26] [INFO ] Invariant cache hit.
[2026-05-25 22:58:26] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 189/343 variables, 154/202 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 50/252 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 0/343 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/344 variables, and 252 constraints, problems are : Problem set: 0 solved, 165 unsolved in 5791 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 154/154 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 189/343 variables, 154/202 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 50/252 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 165/417 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/343 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/344 variables, and 417 constraints, problems are : Problem set: 0 solved, 165 unsolved in 5770 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 154/154 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11572ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 11573ms
Starting structural reductions in SI_LTL mode, iteration 1 : 154/235 places, 190/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11890 ms. Remains : 154/235 places, 190/332 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||(p1&&G(p2))))))'
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-06
Stuttering criterion allowed to conclude after 132 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-06 finished in 12066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 332/332 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 228 transition count 325
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 228 transition count 325
Applied a total of 14 rules in 4 ms. Remains 228 /235 variables (removed 7) and now considering 325/332 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11868358997362025052.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7617912523647610252.kers'
[2026-05-25 22:58:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11868358997362025052.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7617912523647610252.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:58:38] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7617912523647610252.kers
Total runtime 3 ms.
[2026-05-25 22:58:38] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-25 22:58:38] [INFO ] Invariant cache hit.
[2026-05-25 22:58:38] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2026-05-25 22:58:38] [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 18033 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 24223 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 42295ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 42296ms
Starting structural reductions in LTL mode, iteration 1 : 228/235 places, 325/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42572 ms. Remains : 228/235 places, 325/332 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-07
Product exploration explored 100000 steps with 156 reset in 388 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-07 finished in 43217 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&&F((F(p1)&&((p2 U p3)||X(p4)))))||G((F(p1)&&F(((p2 U p3)||X(p4))))))))'
Support contains 7 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 230 transition count 327
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 230 transition count 327
Applied a total of 10 rules in 8 ms. Remains 230 /235 variables (removed 5) and now considering 327/332 (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-9494978366381633938.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14795490311653122496.kers'
[2026-05-25 22:59:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9494978366381633938.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14795490311653122496.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 327 rows 230 cols 1082 entries
Finished phase 1 with 173 SingleSign rule and 0 generalized
[2026-05-25 22:59:21] [INFO ] Computed 57 invariants in 4 ms
Computed 57 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14795490311653122496.kers
Total runtime 5 ms.
[2026-05-25 22:59:21] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 22:59:21] [INFO ] Invariant cache hit.
[2026-05-25 22:59:21] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2026-05-25 22:59:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 327/557 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (OVERLAPS) 0/557 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 287 constraints, problems are : Problem set: 0 solved, 326 unsolved in 18053 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 327/557 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 326/613 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (OVERLAPS) 0/557 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 613 constraints, problems are : Problem set: 0 solved, 326 unsolved in 25140 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43217ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 43219ms
Starting structural reductions in LTL mode, iteration 1 : 230/235 places, 327/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43507 ms. Remains : 230/235 places, 327/332 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p0)&&F(((p1 U p2)||X(p3)))))||(F((F(p0)&&((p1 U p2)||X(p3))))&&p4))))'
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-08
Product exploration explored 100000 steps with 358 reset in 341 ms.
Stack based approach found an accepted trace after 22 steps with 1 reset with depth 5 and stack size 5 in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-08 finished in 44188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((X(X((p0 U p1)))||G(p2))))&&F(p3)))'
Support contains 5 out of 235 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 332/332 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 229 transition count 326
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 326
Applied a total of 12 rules in 9 ms. Remains 229 /235 variables (removed 6) and now considering 326/332 (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-5013027472290520514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10188539856577843633.kers'
[2026-05-25 23:00:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5013027472290520514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10188539856577843633.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 23:00:05] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10188539856577843633.kers
Total runtime 1 ms.
[2026-05-25 23:00:05] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-25 23:00:05] [INFO ] Invariant cache hit.
[2026-05-25 23:00:05] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2026-05-25 23:00:05] [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 17818 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 24464 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 42330ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 42331ms
Starting structural reductions in LTL mode, iteration 1 : 229/235 places, 326/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42605 ms. Remains : 229/235 places, 326/332 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((X(X((p0 U p1)))||G(p2))))&&F(p3)))'
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-09
Product exploration explored 100000 steps with 28 reset in 285 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-09 finished in 43135 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 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 332/332 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 229 transition count 326
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 326
Applied a total of 12 rules in 5 ms. Remains 229 /235 variables (removed 6) and now considering 326/332 (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-8284582310226367402.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12357046214870071781.kers'
[2026-05-25 23:00:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8284582310226367402.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12357046214870071781.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 23:00:48] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12357046214870071781.kers
Total runtime 2 ms.
[2026-05-25 23:00:48] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-25 23:00:48] [INFO ] Invariant cache hit.
[2026-05-25 23:00:49] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 229/235 places, 326/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 229/235 places, 326/332 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 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 298 ms.
Entered a terminal (fully accepting) state of product in 62626 steps with 0 reset in 231 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-10 finished in 1002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (X(X((p2 U p3)))||p1))))'
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 332/332 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 228 transition count 325
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 228 transition count 325
Applied a total of 14 rules in 9 ms. Remains 228 /235 variables (removed 7) and now considering 325/332 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7543087181240331600.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16451759730165571425.kers'
[2026-05-25 23:00:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7543087181240331600.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16451759730165571425.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 23:00:49] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16451759730165571425.kers
Total runtime 2 ms.
[2026-05-25 23:00:49] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-25 23:00:49] [INFO ] Invariant cache hit.
[2026-05-25 23:00:50] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2026-05-25 23:00:50] [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 17975 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 23928 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 41935ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 41936ms
Starting structural reductions in LTL mode, iteration 1 : 228/235 places, 325/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42221 ms. Remains : 228/235 places, 325/332 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) U (X(X((p2 U p3)))||p1))))'
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), true, (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-12 finished in 42645 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 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 332/332 transitions.
Graph (trivial) has 134 edges and 235 vertex of which 71 / 235 are part of one of the 31 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 185 transition count 220
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 161 transition count 220
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 73 place count 154 transition count 213
Iterating global reduction 2 with 7 rules applied. Total rules applied 80 place count 154 transition count 213
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 104 place count 154 transition count 189
Applied a total of 104 rules in 17 ms. Remains 154 /235 variables (removed 81) and now considering 189/332 (removed 143) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2327127347074286972.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17302606313020319362.kers'
[2026-05-25 23:01:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2327127347074286972.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17302606313020319362.kers]
Normalized transition count is 188 out of 189 initially.
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 0 ms.
// Phase 1: matrix 188 rows 132 cols 448 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-25 23:01:32] [INFO ] Computed 48 invariants in 0 ms
Computed 48 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17302606313020319362.kers
Total runtime 1 ms.
[2026-05-25 23:01:32] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 23:01:32] [INFO ] Invariant cache hit.
[2026-05-25 23:01:32] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-25 23:01:32] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2026-05-25 23:01:32] [INFO ] Redundant transitions in 47 ms returned []
Running 164 sub problems to find dead transitions.
[2026-05-25 23:01:32] [INFO ] Invariant cache hit.
[2026-05-25 23:01:32] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 188/342 variables, 154/202 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 52/254 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 0/342 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/343 variables, and 254 constraints, problems are : Problem set: 0 solved, 164 unsolved in 5754 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 154/154 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 188/342 variables, 154/202 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 52/254 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 164/418 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/342 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/343 variables, and 418 constraints, problems are : Problem set: 0 solved, 164 unsolved in 5650 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 154/154 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11421ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 11422ms
Starting structural reductions in SI_LTL mode, iteration 1 : 154/235 places, 189/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11713 ms. Remains : 154/235 places, 189/332 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 50 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-13 finished in 11791 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 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 332/332 transitions.
Graph (trivial) has 137 edges and 235 vertex of which 73 / 235 are part of one of the 32 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 184 transition count 218
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 160 transition count 218
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 73 place count 153 transition count 211
Iterating global reduction 2 with 7 rules applied. Total rules applied 80 place count 153 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 104 place count 153 transition count 187
Applied a total of 104 rules in 17 ms. Remains 153 /235 variables (removed 82) and now considering 187/332 (removed 145) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9973646154504313960.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1301737633696814586.kers'
[2026-05-25 23:01:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9973646154504313960.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1301737633696814586.kers]
Normalized transition count is 186 out of 187 initially.
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 0 ms.
// Phase 1: matrix 186 rows 130 cols 436 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-25 23:01:44] [INFO ] Computed 48 invariants in 2 ms
Computed 48 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1301737633696814586.kers
Total runtime 2 ms.
[2026-05-25 23:01:44] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 23:01:44] [INFO ] Invariant cache hit.
[2026-05-25 23:01:44] [INFO ] State equation strengthened by 54 read => feed constraints.
[2026-05-25 23:01:44] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2026-05-25 23:01:44] [INFO ] Redundant transitions in 49 ms returned []
Running 162 sub problems to find dead transitions.
[2026-05-25 23:01:44] [INFO ] Invariant cache hit.
[2026-05-25 23:01:44] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 186/339 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 54/255 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 0/339 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/340 variables, and 255 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5568 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 153/153 constraints, ReadFeed: 54/54 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/153 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 186/339 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 54/255 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 162/417 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/340 variables, and 417 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5498 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 153/153 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11079ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 11080ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/235 places, 187/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11372 ms. Remains : 153/235 places, 187/332 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 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-14 finished in 11488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p1) U (F(p2)&&X(G(!p0)))))'
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 332/332 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 228 transition count 325
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 228 transition count 325
Applied a total of 14 rules in 11 ms. Remains 228 /235 variables (removed 7) and now considering 325/332 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14452372847982309117.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13917446195202718122.kers'
[2026-05-25 23:01:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14452372847982309117.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13917446195202718122.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 23:01:55] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13917446195202718122.kers
Total runtime 3 ms.
[2026-05-25 23:01:55] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 23:01:55] [INFO ] Invariant cache hit.
[2026-05-25 23:01:56] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2026-05-25 23:01:56] [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 18002 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 24343 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 42376ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 42376ms
Starting structural reductions in LTL mode, iteration 1 : 228/235 places, 325/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42646 ms. Remains : 228/235 places, 325/332 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p1) U (F(p2)&&X(G(!p0)))))'
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p2) p0), (NOT p2), p0, p0, (AND p1 p0), true, p1]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3572 steps with 0 reset in 14 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-15 finished in 42971 ms.
All properties solved by simple procedures.
Total runtime 411416 ms.
BK_STOP 1779750158776
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-4A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-4A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969914000308"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;