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-177969914300708.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 Peterson-PT-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914300708
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 51K Mar 8 07:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 244K Mar 8 07:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31K Mar 8 07:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 161K Mar 8 07:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 19K Mar 16 08:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 16 08:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 16 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 16 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 66K Mar 8 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 311K Mar 8 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 99K Mar 8 07:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 481K Mar 8 07:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.4K Mar 16 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Mar 16 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 143K 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 Peterson-PT-3-LTLFireability-00
FORMULA_NAME Peterson-PT-3-LTLFireability-01
FORMULA_NAME Peterson-PT-3-LTLFireability-02
FORMULA_NAME Peterson-PT-3-LTLFireability-03
FORMULA_NAME Peterson-PT-3-LTLFireability-04
FORMULA_NAME Peterson-PT-3-LTLFireability-05
FORMULA_NAME Peterson-PT-3-LTLFireability-06
FORMULA_NAME Peterson-PT-3-LTLFireability-07
FORMULA_NAME Peterson-PT-3-LTLFireability-08
FORMULA_NAME Peterson-PT-3-LTLFireability-09
FORMULA_NAME Peterson-PT-3-LTLFireability-10
FORMULA_NAME Peterson-PT-3-LTLFireability-11
FORMULA_NAME Peterson-PT-3-LTLFireability-12
FORMULA_NAME Peterson-PT-3-LTLFireability-13
FORMULA_NAME Peterson-PT-3-LTLFireability-14
FORMULA_NAME Peterson-PT-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779818138923

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 17:55:40] [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-26 17:55:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 17:55:40] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2026-05-26 17:55:40] [INFO ] Transformed 244 places.
[2026-05-26 17:55:40] [INFO ] Transformed 332 transitions.
[2026-05-26 17:55:40] [INFO ] Found NUPN structural information;
[2026-05-26 17:55:40] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-3-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 210 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 11 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2026-05-26 17:55:40] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2600036763878076016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3872446857640906746.kers'
[2026-05-26 17:55:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2600036763878076016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3872446857640906746.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 308 rows 236 cols 688 entries
Finished phase 1 with 228 SingleSign rule and 1 generalized
[2026-05-26 17:55:40] [INFO ] Computed 15 invariants in 3 ms
Computed 15 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3872446857640906746.kers
Total runtime 4 ms.
[2026-05-26 17:55:40] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-26 17:55:40] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2026-05-26 17:55:40] [INFO ] Invariant cache hit.
[2026-05-26 17:55:40] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-26 17:55:40] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2026-05-26 17:55:40] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2026-05-26 17:55:40] [INFO ] Invariant cache hit.
[2026-05-26 17:55:40] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 10/250 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 11/322 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/552 variables, and 324 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30022 ms.
Refiners :[Domain max(s): 240/244 constraints, Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 1/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 10/250 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 73/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/552 variables, and 327 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30016 ms.
Refiners :[Domain max(s): 240/244 constraints, Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 1/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/328 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Finished structural reductions in LTL mode , in 1 iterations and 60582 ms. Remains : 244/244 places, 332/332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2026-05-26 17:56:40] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2026-05-26 17:56:40] [INFO ] Invariant cache hit.
[2026-05-26 17:56:41] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-26 17:56:41] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2026-05-26 17:56:41] [INFO ] Invariant cache hit.
[2026-05-26 17:56:41] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-26 17:56:41] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 210 out of 244 places after structural reductions.
[2026-05-26 17:56:41] [INFO ] Flatten gal took : 45 ms
[2026-05-26 17:56:41] [INFO ] Flatten gal took : 24 ms
[2026-05-26 17:56:41] [INFO ] Input system was already deterministic with 332 transitions.
Reduction of identical properties reduced properties to check from 36 to 32
RANDOM walk for 40000 steps (8 resets) in 1637 ms. (24 steps per ms) remains 7/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
[2026-05-26 17:56:42] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2026-05-26 17:56:42] [INFO ] Invariant cache hit.
[2026-05-26 17:56:42] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 2 (OVERLAPS) 158/176 variables, 4/22 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 158/180 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3/179 variables, 3/183 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 3/186 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 55/234 variables, 4/190 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 55/245 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/245 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/236 variables, 2/247 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 2/249 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/236 variables, 0/249 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 308/544 variables, 236/485 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 57/542 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/544 variables, 0/542 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 8/552 variables, 8/550 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/552 variables, 8/558 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/552 variables, 2/560 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/552 variables, 0/560 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/552 variables, 0/560 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 560 constraints, problems are : Problem set: 1 solved, 6 unsolved in 791 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 157/171 variables, 3/17 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 157/174 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/175 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/175 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 3/174 variables, 3/178 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 3/181 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 1/182 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 1/183 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/183 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 56/230 variables, 4/187 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 56/243 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 0/243 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/232 variables, 2/245 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 2/247 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 2/249 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 0/249 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 308/540 variables, 232/481 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/540 variables, 57/538 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/540 variables, 5/543 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/540 variables, 1/544 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/540 variables, 0/544 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 12/552 variables, 12/556 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/552 variables, 12/568 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/552 variables, 3/571 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/552 variables, 9/580 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/552 variables, 0/580 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 0/552 variables, 0/580 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 580 constraints, problems are : Problem set: 2 solved, 5 unsolved in 3229 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4026ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 601 ms.
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 244 transition count 244
Reduce places removed 88 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 89 rules applied. Total rules applied 177 place count 156 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 178 place count 155 transition count 243
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 178 place count 155 transition count 193
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 278 place count 105 transition count 193
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 298 place count 95 transition count 183
Applied a total of 298 rules in 36 ms. Remains 95 /244 variables (removed 149) and now considering 183/332 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 95/244 places, 183/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 274 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 107618 steps, run visited all 4 properties in 296 ms. (steps per millisecond=363 )
Probabilistic random walk after 107618 steps, saw 21737 distinct states, run finished after 300 ms. (steps per millisecond=358 ) properties seen :4
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-3-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 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(X(F((X(p0)&&p0)))) U !X(!p0))))'
Support contains 24 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 12 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2026-05-26 17:56:47] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2026-05-26 17:56:47] [INFO ] Invariant cache hit.
[2026-05-26 17:56:48] [INFO ] Implicit Places using invariants in 136 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 139 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 16 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 168 ms. Remains : 240/244 places, 332/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(X(F((X(p0)&&p0)))) U !X(!p0))))'
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-00
Product exploration explored 100000 steps with 8209 reset in 411 ms.
Stack based approach found an accepted trace after 2956 steps with 240 reset with depth 16 and stack size 16 in 29 ms.
FORMULA Peterson-PT-3-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-00 finished in 961 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)))'
Support contains 40 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 244 transition count 272
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 184 transition count 272
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 120 place count 184 transition count 224
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 216 place count 136 transition count 224
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 240 place count 124 transition count 212
Applied a total of 240 rules in 31 ms. Remains 124 /244 variables (removed 120) and now considering 212/332 (removed 120) transitions.
[2026-05-26 17:56:48] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6024184336233431289.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6123508314869394930.kers'
[2026-05-26 17:56:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6024184336233431289.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6123508314869394930.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 188 rows 116 cols 448 entries
Finished phase 1 with 108 SingleSign rule and 1 generalized
[2026-05-26 17:56:48] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6123508314869394930.kers
Total runtime 1 ms.
[2026-05-26 17:56:48] [INFO ] Implicit Places using invariants in 77 ms returned [117, 118, 119, 120]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 78 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/244 places, 212/332 transitions.
Applied a total of 0 rules in 7 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 116 ms. Remains : 120/244 places, 212/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)))'
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 430 ms.
Stack based approach found an accepted trace after 92 steps with 0 reset with depth 93 and stack size 90 in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-01 finished in 612 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&&(F(p1) U X(X(p2)))))))'
Support contains 44 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 244 transition count 242
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 154 transition count 242
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 180 place count 154 transition count 191
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 282 place count 103 transition count 191
Applied a total of 282 rules in 18 ms. Remains 103 /244 variables (removed 141) and now considering 191/332 (removed 141) transitions.
[2026-05-26 17:56:49] [INFO ] Flow matrix only has 167 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14910055995453656554.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17858511628428737438.kers'
[2026-05-26 17:56:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14910055995453656554.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17858511628428737438.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 2 ms.
// Phase 1: matrix 167 rows 95 cols 406 entries
Finished phase 1 with 87 SingleSign rule and 1 generalized
[2026-05-26 17:56:49] [INFO ] Computed 15 invariants in 3 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17858511628428737438.kers
Total runtime 3 ms.
[2026-05-26 17:56:49] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-26 17:56:49] [INFO ] Flow matrix only has 167 transitions (discarded 24 similar events)
[2026-05-26 17:56:49] [INFO ] Invariant cache hit.
[2026-05-26 17:56:49] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-26 17:56:49] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2026-05-26 17:56:49] [INFO ] Redundant transitions in 8 ms returned []
Running 187 sub problems to find dead transitions.
[2026-05-26 17:56:49] [INFO ] Flow matrix only has 167 transitions (discarded 24 similar events)
[2026-05-26 17:56:49] [INFO ] Invariant cache hit.
[2026-05-26 17:56:49] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 17/167 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/99 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (OVERLAPS) 1/100 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/100 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/100 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 17 (OVERLAPS) 3/103 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/103 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/103 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 20 (OVERLAPS) 167/270 variables, 103/292 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/270 variables, 57/349 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/270 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/270 variables, and 349 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30014 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 71/181 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 1/100 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (OVERLAPS) 3/103 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/103 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (OVERLAPS) 167/270 variables, 103/293 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 57/350 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 187/537 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/270 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 16 (OVERLAPS) 0/270 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 537 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30015 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/244 places, 191/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60267 ms. Remains : 103/244 places, 191/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) U X(X(p1)))&&p2))))'
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-02
Product exploration explored 100000 steps with 2086 reset in 273 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-02 finished in 60924 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((X(G((F(p0)||X(p1))))&&G(p2))))'
Support contains 112 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 244 transition count 329
Reduce places removed 3 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 15 rules applied. Total rules applied 18 place count 241 transition count 317
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 30 place count 229 transition count 317
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 30 place count 229 transition count 313
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 38 place count 225 transition count 313
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 56 place count 216 transition count 304
Applied a total of 56 rules in 24 ms. Remains 216 /244 variables (removed 28) and now considering 304/332 (removed 28) transitions.
[2026-05-26 17:57:50] [INFO ] Flow matrix only has 280 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16560692657193693634.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5390662760495252659.kers'
[2026-05-26 17:57:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16560692657193693634.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5390662760495252659.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 280 rows 208 cols 632 entries
Finished phase 1 with 200 SingleSign rule and 1 generalized
[2026-05-26 17:57:50] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5390662760495252659.kers
Total runtime 2 ms.
[2026-05-26 17:57:50] [INFO ] Implicit Places using invariants in 76 ms returned [206, 207, 208, 209]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 78 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 212/244 places, 304/332 transitions.
Applied a total of 0 rules in 7 ms. Remains 212 /212 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110 ms. Remains : 212/244 places, 304/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((X(G((F(p0)||X(p1))))&&G(p2))))'
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-03
Product exploration explored 100000 steps with 4705 reset in 708 ms.
Stack based approach found an accepted trace after 10074 steps with 484 reset with depth 16 and stack size 16 in 80 ms.
FORMULA Peterson-PT-3-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-03 finished in 1316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((!p0||G(F(p1))) U X(p1)) U p2)))'
Support contains 68 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2026-05-26 17:57:51] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17916358211590720180.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6913112351039618023.kers'
[2026-05-26 17:57:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17916358211590720180.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6913112351039618023.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 308 rows 236 cols 688 entries
Finished phase 1 with 228 SingleSign rule and 1 generalized
[2026-05-26 17:57:51] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6913112351039618023.kers
Total runtime 2 ms.
[2026-05-26 17:57:51] [INFO ] Implicit Places using invariants in 128 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 128 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 240/244 places, 332/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((((!p0||G(F(p1))) U X(p1)) U p2)))'
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-04
Product exploration explored 100000 steps with 3717 reset in 271 ms.
Stack based approach found an accepted trace after 242 steps with 10 reset with depth 21 and stack size 21 in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-04 finished in 681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((!p0||X(!p1)) U (G((!p0||X(!p1)))||(!p1&&(!p0||X(!p1))))) U X((F(G(p3))||p2)))))'
Support contains 44 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2026-05-26 17:57:52] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2026-05-26 17:57:52] [INFO ] Invariant cache hit.
[2026-05-26 17:57:52] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-26 17:57:52] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2026-05-26 17:57:52] [INFO ] Invariant cache hit.
[2026-05-26 17:57:52] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-26 17:57:52] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2026-05-26 17:57:52] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2026-05-26 17:57:52] [INFO ] Invariant cache hit.
[2026-05-26 17:57:52] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 10/250 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 11/322 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/552 variables, and 324 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30023 ms.
Refiners :[Domain max(s): 240/244 constraints, Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 1/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 10/250 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 73/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/552 variables, and 327 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30024 ms.
Refiners :[Domain max(s): 240/244 constraints, Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 1/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/328 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Finished structural reductions in LTL mode , in 1 iterations and 60362 ms. Remains : 244/244 places, 332/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((((!p0||X(!p1)) U (G((!p0||X(!p1)))||(!p1&&(!p0||X(!p1))))) U X((F(G(p3))||p2)))))'
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p0 (NOT p2) p1 (NOT p3)), (NOT p3), (AND (NOT p3) p1), (AND (NOT p3) p1 p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 155 ms.
Product exploration explored 100000 steps with 33333 reset in 172 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 10 factoid took 85 ms. Proved property starting from automaton with 8 states, 16 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 93 ms.
FORMULA Peterson-PT-3-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-3-LTLFireability-05 finished in 61191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Support contains 48 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 1 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2026-05-26 17:58:53] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2026-05-26 17:58:53] [INFO ] Invariant cache hit.
[2026-05-26 17:58:53] [INFO ] Implicit Places using invariants in 112 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 113 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 240/244 places, 332/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(G(p0)) U p1)))'
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 144 ms.
Stack based approach found an accepted trace after 85 steps with 0 reset with depth 86 and stack size 86 in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-06 finished in 412 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) U p1)||X(p2)))'
Support contains 48 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2026-05-26 17:58:54] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2026-05-26 17:58:54] [INFO ] Invariant cache hit.
[2026-05-26 17:58:54] [INFO ] Implicit Places using invariants in 108 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 109 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 240/244 places, 332/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) U p1)||X(p2)))'
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), true, (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 419 ms.
Product exploration explored 100000 steps with 50000 reset in 439 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 13 ms. Proved property starting from automaton with 6 states, 12 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 16 ms.
FORMULA Peterson-PT-3-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-3-LTLFireability-07 finished in 1234 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)||(p0&&F(!p1))))'
Support contains 3 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 244 transition count 239
Reduce places removed 93 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 187 place count 151 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 188 place count 150 transition count 238
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 188 place count 150 transition count 190
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 284 place count 102 transition count 190
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 308 place count 90 transition count 178
Applied a total of 308 rules in 17 ms. Remains 90 /244 variables (removed 154) and now considering 178/332 (removed 154) transitions.
[2026-05-26 17:58:55] [INFO ] Flow matrix only has 154 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16830618463117601724.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5799401802770264442.kers'
[2026-05-26 17:58:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16830618463117601724.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5799401802770264442.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 154 rows 82 cols 380 entries
Finished phase 1 with 74 SingleSign rule and 1 generalized
[2026-05-26 17:58:55] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5799401802770264442.kers
Total runtime 2 ms.
[2026-05-26 17:58:55] [INFO ] Implicit Places using invariants in 75 ms returned [84, 85, 86]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 76 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/244 places, 178/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 87/244 places, 178/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)||(p0&&F(p1))))'
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-09
Product exploration explored 100000 steps with 19904 reset in 120 ms.
Stack based approach found an accepted trace after 1000 steps with 210 reset with depth 12 and stack size 12 in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-09 finished in 362 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||X(((p2||G(p3))&&p1))))))'
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2026-05-26 17:58:55] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2228966673977869414.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2908148264623335850.kers'
[2026-05-26 17:58:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2228966673977869414.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2908148264623335850.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 308 rows 236 cols 688 entries
Finished phase 1 with 228 SingleSign rule and 1 generalized
[2026-05-26 17:58:55] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2908148264623335850.kers
Total runtime 4 ms.
[2026-05-26 17:58:55] [INFO ] Implicit Places using invariants in 153 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 154 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 240/244 places, 332/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((X(((p1||G(p2))&&p0))||p3))))'
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-11
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-11 finished in 391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2026-05-26 17:58:56] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2026-05-26 17:58:56] [INFO ] Invariant cache hit.
[2026-05-26 17:58:56] [INFO ] Implicit Places using invariants in 144 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 145 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150 ms. Remains : 240/244 places, 332/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(p0)))'
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-12
Product exploration explored 100000 steps with 1989 reset in 160 ms.
Stack based approach found an accepted trace after 93 steps with 1 reset with depth 32 and stack size 32 in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-12 finished in 420 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((F(p1)&&p0))))'
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2026-05-26 17:58:56] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2026-05-26 17:58:56] [INFO ] Invariant cache hit.
[2026-05-26 17:58:56] [INFO ] Implicit Places using invariants in 147 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 147 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 240/244 places, 332/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((F(p1)&&p0))))'
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1083 steps with 11 reset in 5 ms.
FORMULA Peterson-PT-3-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-13 finished in 329 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)||G((X(G(p2))||p1))))'
Support contains 3 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2026-05-26 17:58:56] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2026-05-26 17:58:56] [INFO ] Invariant cache hit.
[2026-05-26 17:58:56] [INFO ] Implicit Places using invariants in 146 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 147 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 240/244 places, 332/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)||G((X(G(p2))||p1))))'
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-14
Entered a terminal (fully accepting) state of product in 123 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-14 finished in 362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||X(F((p0&&F(p1))))) U p2)&&X(p3)))'
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2026-05-26 17:58:57] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2026-05-26 17:58:57] [INFO ] Invariant cache hit.
[2026-05-26 17:58:57] [INFO ] Implicit Places using invariants in 150 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 151 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 240/244 places, 332/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||X(F((p0&&F(p1))))) U p2)&&X(p3)))'
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p3), (NOT p1), true]
Running random walk in product with property : Peterson-PT-3-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 118 ms.
Stack based approach found an accepted trace after 169 steps with 0 reset with depth 170 and stack size 170 in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-15 finished in 518 ms.
All properties solved by simple procedures.
Total runtime 197607 ms.

BK_STOP 1779818337684

--------------------
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="Peterson-PT-3"
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 Peterson-PT-3, 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-177969914300708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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