Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366000156.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 Anderson-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366000156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 9.1K Mar 4 18:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 4 18:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 4 18:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Mar 4 18:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 15 07:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 4 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 4 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 4 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 4 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 185K 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 Anderson-PT-05-LTLFireability-00
FORMULA_NAME Anderson-PT-05-LTLFireability-01
FORMULA_NAME Anderson-PT-05-LTLFireability-02
FORMULA_NAME Anderson-PT-05-LTLFireability-03
FORMULA_NAME Anderson-PT-05-LTLFireability-04
FORMULA_NAME Anderson-PT-05-LTLFireability-05
FORMULA_NAME Anderson-PT-05-LTLFireability-06
FORMULA_NAME Anderson-PT-05-LTLFireability-07
FORMULA_NAME Anderson-PT-05-LTLFireability-08
FORMULA_NAME Anderson-PT-05-LTLFireability-09
FORMULA_NAME Anderson-PT-05-LTLFireability-10
FORMULA_NAME Anderson-PT-05-LTLFireability-11
FORMULA_NAME Anderson-PT-05-LTLFireability-12
FORMULA_NAME Anderson-PT-05-LTLFireability-13
FORMULA_NAME Anderson-PT-05-LTLFireability-14
FORMULA_NAME Anderson-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779462006486

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 15:00:07] [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-22 15:00:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 15:00:08] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2026-05-22 15:00:08] [INFO ] Transformed 161 places.
[2026-05-22 15:00:08] [INFO ] Transformed 365 transitions.
[2026-05-22 15:00:08] [INFO ] Found NUPN structural information;
[2026-05-22 15:00:08] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Anderson-PT-05-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 365/365 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 139 transition count 287
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 139 transition count 287
Applied a total of 44 rules in 25 ms. Remains 139 /161 variables (removed 22) and now considering 287/365 (removed 78) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12289179057328223008.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10248626126397729511.kers'
[2026-05-22 15:00:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12289179057328223008.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10248626126397729511.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 287 rows 139 cols 1048 entries
Finished phase 1 with 63 SingleSign rule and 63 generalized
[2026-05-22 15:00:08] [INFO ] Computed 13 invariants in 2 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10248626126397729511.kers
Total runtime 3 ms.
[2026-05-22 15:00:08] [INFO ] Implicit Places using invariants in 341 ms returned []
[2026-05-22 15:00:08] [INFO ] Invariant cache hit.
[2026-05-22 15:00:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 15:00:09] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2026-05-22 15:00:09] [INFO ] Invariant cache hit.
[2026-05-22 15:00:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 287/426 variables, 139/184 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 209 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 287/426 variables, 139/191 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 282/493 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 493 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60281ms
Starting structural reductions in LTL mode, iteration 1 : 139/161 places, 287/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61363 ms. Remains : 139/161 places, 287/365 transitions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 287/287 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2026-05-22 15:01:09] [INFO ] Invariant cache hit.
[2026-05-22 15:01:09] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-22 15:01:09] [INFO ] Invariant cache hit.
[2026-05-22 15:01:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 15:01:10] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 590 ms. Remains : 139/139 places, 287/287 transitions.
Support contains 41 out of 139 places after structural reductions.
[2026-05-22 15:01:10] [INFO ] Flatten gal took : 87 ms
[2026-05-22 15:01:10] [INFO ] Flatten gal took : 23 ms
[2026-05-22 15:01:10] [INFO ] Input system was already deterministic with 287 transitions.
RANDOM walk for 40000 steps (8 resets) in 2328 ms. (17 steps per ms) remains 9/31 properties
BEST_FIRST walk for 40001 steps (8 resets) in 134 ms. (296 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 206 ms. (193 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 202 ms. (197 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 2/4 properties
[2026-05-22 15:01:11] [INFO ] Invariant cache hit.
[2026-05-22 15:01:11] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/112 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 5 (OVERLAPS) 27/139 variables, 7/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 287/426 variables, 139/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 20/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/426 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 173 constraints, problems are : Problem set: 1 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/25 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/34 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/105 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/138 variables, 7/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 287/426 variables, 139/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 20/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 1/174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/426 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 174 constraints, problems are : Problem set: 1 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 584ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 287/287 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 139 transition count 267
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 119 transition count 267
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 102 transition count 154
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 102 transition count 154
Applied a total of 74 rules in 39 ms. Remains 102 /139 variables (removed 37) and now considering 154/287 (removed 133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 102/139 places, 154/287 transitions.
RANDOM walk for 40000 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30626 steps (6 resets) in 43 ms. (696 steps per ms) remains 0/1 properties
FORMULA Anderson-PT-05-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Anderson-PT-05-LTLFireability-09 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(p0))&&F(p1)) U (G(((X(X(p0))&&F(p1))||X(X(G(p0)))))||(X(p2)&&((X(X(p0))&&F(p1))||X(X(G(p0)))))))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 287/287 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 167
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 167
Applied a total of 32 rules in 7 ms. Remains 123 /139 variables (removed 16) and now considering 167/287 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7474975955081738885.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3618041169234977882.kers'
[2026-05-22 15:01:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7474975955081738885.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3618041169234977882.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 123 cols 574 entries
Finished phase 1 with 47 SingleSign rule and 63 generalized
[2026-05-22 15:01:13] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3618041169234977882.kers
Total runtime 3 ms.
[2026-05-22 15:01:13] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-22 15:01:13] [INFO ] Invariant cache hit.
[2026-05-22 15:01:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 15:01:13] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2026-05-22 15:01:13] [INFO ] Invariant cache hit.
[2026-05-22 15:01:13] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 1/123 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 167/290 variables, 123/144 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/290 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 14 (OVERLAPS) 0/290 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/290 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 16 (OVERLAPS) 0/290 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 168 constraints, problems are : Problem set: 0 solved, 162 unsolved in 17139 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 1/123 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 167/290 variables, 123/148 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 162/330 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 330 constraints, problems are : Problem set: 0 solved, 162 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47213ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 47214ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 167/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47682 ms. Remains : 123/139 places, 167/287 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(p0))&&F(p1)) U (G(((X(X(p0))&&F(p1))||X(X(G(p0)))))||(X(p2)&&(X(X(G(p0)))||(X(X(p0))&&F(p1))))))))'
Stuttering acceptance computed with spot in 528 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 5 ms.
FORMULA Anderson-PT-05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-05-LTLFireability-00 finished in 48377 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) U p1) U p2))'
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 287/287 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 124 transition count 192
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 124 transition count 192
Applied a total of 30 rules in 6 ms. Remains 124 /139 variables (removed 15) and now considering 192/287 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9708530979073047274.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16595597658586415277.kers'
[2026-05-22 15:02:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9708530979073047274.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16595597658586415277.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 192 rows 124 cols 678 entries
Finished phase 1 with 48 SingleSign rule and 63 generalized
[2026-05-22 15:02:01] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16595597658586415277.kers
Total runtime 1 ms.
[2026-05-22 15:02:01] [INFO ] Implicit Places using invariants in 111 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 125 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 192/287 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 123/139 places, 192/287 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) U p1) U p2))'
Stuttering acceptance computed with spot in 111 ms :[true, p2, (AND p2 p1 p0), (AND p1 p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 267 ms.
Product exploration explored 100000 steps with 0 reset in 178 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 21 factoid took 55 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 359 ms. (111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 290 ms. (137 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 37 ms. (1052 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16697664389347493829.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13970462434972412769.kers'
[2026-05-22 15:02:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16697664389347493829.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13970462434972412769.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 192 rows 123 cols 628 entries
Finished phase 1 with 73 SingleSign rule and 38 generalized
[2026-05-22 15:02:02] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13970462434972412769.kers
Total runtime 1 ms.
[2026-05-22 15:02:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 105/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/122 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf6 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem apf3 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 123/315 variables, and 12 constraints, problems are : Problem set: 3 solved, 0 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 24 factoid took 15 ms. Proved property starting from automaton with 4 states, 10 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 580 ms.
FORMULA Anderson-PT-05-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-05-LTLFireability-01 finished in 1309 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&&X(X(F(!p0))))||G(F(!p0)))) U p1)))'
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 287/287 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 175
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 175
Applied a total of 32 rules in 6 ms. Remains 123 /139 variables (removed 16) and now considering 175/287 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17124889344500404484.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13632554505087811522.kers'
[2026-05-22 15:02:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17124889344500404484.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13632554505087811522.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 123 cols 608 entries
Finished phase 1 with 47 SingleSign rule and 63 generalized
[2026-05-22 15:02:02] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13632554505087811522.kers
Total runtime 3 ms.
[2026-05-22 15:02:02] [INFO ] Implicit Places using invariants in 175 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 177 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/139 places, 175/287 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 122/139 places, 175/287 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(F(!p0))||(!p0&&X(X(F(!p0)))))) U p1)))'
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), false, p0, p0]
Running random walk in product with property : Anderson-PT-05-LTLFireability-04
Product exploration explored 100000 steps with 38483 reset in 189 ms.
Product exploration explored 100000 steps with 38623 reset in 184 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 3 factoid took 250 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 96 ms. (412 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13424502582942403857.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17628498755800057712.kers'
[2026-05-22 15:02:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13424502582942403857.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17628498755800057712.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 122 cols 558 entries
Finished phase 1 with 72 SingleSign rule and 38 generalized
[2026-05-22 15:02:03] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17628498755800057712.kers
Total runtime 3 ms.
[2026-05-22 15:02:03] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 3/297 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/122 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 4 factoid took 366 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), p0, (NOT p1), (OR (NOT p1) p0)]
[2026-05-22 15:02:04] [INFO ] Invariant cache hit.
[2026-05-22 15:02:04] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2026-05-22 15:02:04] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 13 ms returned sat
[2026-05-22 15:02:04] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2026-05-22 15:02:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 15:02:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-22 15:02:04] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 11 ms returned unsat
Proved EG (NOT p1) asserting that LTL formula F !(NOT p1) is false.
Negative knowledge disproves property using: (F p1)
Knowledge-based reduction took 1553 ms.
FORMULA Anderson-PT-05-LTLFireability-04 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property Anderson-PT-05-LTLFireability-04 finished in 2314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((p0 U (p1&&X(p0))))) U ((!p2&&X(X((p0 U (p1&&X(p0))))))||X(X(G((p0 U (p1&&X(p0))))))))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 287/287 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 175
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 175
Applied a total of 32 rules in 17 ms. Remains 123 /139 variables (removed 16) and now considering 175/287 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14860304692289224003.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7147502934143193507.kers'
[2026-05-22 15:02:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14860304692289224003.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7147502934143193507.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 123 cols 608 entries
Finished phase 1 with 47 SingleSign rule and 63 generalized
[2026-05-22 15:02:04] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7147502934143193507.kers
Total runtime 1 ms.
[2026-05-22 15:02:05] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-22 15:02:05] [INFO ] Invariant cache hit.
[2026-05-22 15:02:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 15:02:05] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2026-05-22 15:02:05] [INFO ] Invariant cache hit.
[2026-05-22 15:02:05] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 175/298 variables, 123/144 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/298 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 164 constraints, problems are : Problem set: 0 solved, 170 unsolved in 8161 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 175/298 variables, 123/145 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 170/335 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/298 variables, and 335 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38293ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 38293ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 175/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38986 ms. Remains : 123/139 places, 175/287 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((p0 U (p1&&X(p0))))) U (X(X(G((p0 U (p1&&X(p0))))))||(!p2&&X(X((p0 U (p1&&X(p0))))))))))'
Stuttering acceptance computed with spot in 786 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-05
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-05-LTLFireability-05 finished in 39823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 287/287 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 139 transition count 267
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 119 transition count 267
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 56 place count 103 transition count 163
Iterating global reduction 0 with 16 rules applied. Total rules applied 72 place count 103 transition count 163
Applied a total of 72 rules in 11 ms. Remains 103 /139 variables (removed 36) and now considering 163/287 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11020233435796132527.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2959740890310589026.kers'
[2026-05-22 15:02:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11020233435796132527.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2959740890310589026.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 163 rows 103 cols 602 entries
Finished phase 1 with 27 SingleSign rule and 63 generalized
[2026-05-22 15:02:44] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2959740890310589026.kers
Total runtime 1 ms.
[2026-05-22 15:02:44] [INFO ] Implicit Places using invariants in 167 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 170 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/139 places, 163/287 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 102 transition count 140
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 79 transition count 140
Applied a total of 46 rules in 11 ms. Remains 79 /102 variables (removed 23) and now considering 140/163 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7166481390904865280.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7285228268188918430.kers'
[2026-05-22 15:02:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7166481390904865280.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7285228268188918430.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 79 cols 506 entries
Finished phase 1 with 29 SingleSign rule and 38 generalized
[2026-05-22 15:02:44] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7285228268188918430.kers
Total runtime 1 ms.
[2026-05-22 15:02:45] [INFO ] Implicit Places using invariants in 185 ms returned []
[2026-05-22 15:02:45] [INFO ] Invariant cache hit.
[2026-05-22 15:02:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 15:02:45] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/139 places, 140/287 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 569 ms. Remains : 79/139 places, 140/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 139 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 1 ms.
FORMULA Anderson-PT-05-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-06 finished in 909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(X(X(X(F((G(p1)&&X(p2))))))))))'
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 287/287 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 122 transition count 174
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 122 transition count 174
Applied a total of 34 rules in 8 ms. Remains 122 /139 variables (removed 17) and now considering 174/287 (removed 113) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9510052240108688243.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16058690512373781952.kers'
[2026-05-22 15:02:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9510052240108688243.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16058690512373781952.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 122 cols 606 entries
Finished phase 1 with 46 SingleSign rule and 63 generalized
[2026-05-22 15:02:45] [INFO ] Computed 13 invariants in 2 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16058690512373781952.kers
Total runtime 3 ms.
[2026-05-22 15:02:45] [INFO ] Implicit Places using invariants in 204 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 210 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/139 places, 174/287 transitions.
Applied a total of 0 rules in 2 ms. Remains 121 /121 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 220 ms. Remains : 121/139 places, 174/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(X(X(X(F((G(p1)&&X(p2))))))))))'
Stuttering acceptance computed with spot in 742 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 152 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-07 finished in 1201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U ((p1 U G(!p2))&&X(p3))))'
Support contains 8 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 287/287 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 125 transition count 201
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 125 transition count 201
Applied a total of 28 rules in 4 ms. Remains 125 /139 variables (removed 14) and now considering 201/287 (removed 86) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13552974572093978647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16414823783070795156.kers'
[2026-05-22 15:02:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13552974572093978647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16414823783070795156.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 125 cols 714 entries
Finished phase 1 with 49 SingleSign rule and 63 generalized
[2026-05-22 15:02:46] [INFO ] Computed 13 invariants in 2 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16414823783070795156.kers
Total runtime 3 ms.
[2026-05-22 15:02:47] [INFO ] Implicit Places using invariants in 176 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 204 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/139 places, 201/287 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 210 ms. Remains : 124/139 places, 201/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U ((p1 U G(!p2))&&X(p3))))'
Stuttering acceptance computed with spot in 514 ms :[(OR (NOT p3) p2), (NOT p0), (AND (NOT p0) p2), p2, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (NOT p3), p2, (AND (NOT p0) p2 p1 (NOT p3)), (AND p1 p2 (NOT p3))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-08
Product exploration explored 100000 steps with 3 reset in 113 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 65 in 1 ms.
FORMULA Anderson-PT-05-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-08 finished in 900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||X((p1||X(G(p0)))))))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 287/287 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 121 transition count 165
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 121 transition count 165
Applied a total of 36 rules in 3 ms. Remains 121 /139 variables (removed 18) and now considering 165/287 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16764968214652000159.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16034591239164041460.kers'
[2026-05-22 15:02:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16764968214652000159.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16034591239164041460.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 121 cols 570 entries
Finished phase 1 with 45 SingleSign rule and 63 generalized
[2026-05-22 15:02:47] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16034591239164041460.kers
Total runtime 1 ms.
[2026-05-22 15:02:47] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-22 15:02:47] [INFO ] Invariant cache hit.
[2026-05-22 15:02:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 15:02:48] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2026-05-22 15:02:48] [INFO ] Invariant cache hit.
[2026-05-22 15:02:48] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 1/121 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (OVERLAPS) 165/286 variables, 121/142 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 13 (OVERLAPS) 0/286 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 164 constraints, problems are : Problem set: 0 solved, 160 unsolved in 13044 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 121/121 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 1/121 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 165/286 variables, 121/144 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 160/324 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/286 variables, and 324 constraints, problems are : Problem set: 0 solved, 160 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 121/121 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43079ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 43079ms
Starting structural reductions in LTL mode, iteration 1 : 121/139 places, 165/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43494 ms. Remains : 121/139 places, 165/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X((p0||X(G(p1))))||p1)))))'
Stuttering acceptance computed with spot in 216 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-11
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-05-LTLFireability-11 finished in 43753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(p0)&&G(p1))))&&X(p0)))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 287/287 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 183
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 183
Applied a total of 32 rules in 14 ms. Remains 123 /139 variables (removed 16) and now considering 183/287 (removed 104) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7718122238185571952.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10112413876087057853.kers'
[2026-05-22 15:03:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7718122238185571952.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10112413876087057853.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 183 rows 123 cols 642 entries
Finished phase 1 with 47 SingleSign rule and 63 generalized
[2026-05-22 15:03:31] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10112413876087057853.kers
Total runtime 1 ms.
[2026-05-22 15:03:31] [INFO ] Implicit Places using invariants in 89 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/139 places, 183/287 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 122/139 places, 183/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(p0)&&G(p1))))&&X(p0)))'
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-05-LTLFireability-12 finished in 289 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((F(G(p1))&&F(p2)&&p0))))'
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 287/287 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 125 transition count 201
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 125 transition count 201
Applied a total of 28 rules in 2 ms. Remains 125 /139 variables (removed 14) and now considering 201/287 (removed 86) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16813193566616074943.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5982349122019039391.kers'
[2026-05-22 15:03:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16813193566616074943.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5982349122019039391.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 125 cols 714 entries
Finished phase 1 with 49 SingleSign rule and 63 generalized
[2026-05-22 15:03:31] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5982349122019039391.kers
Total runtime 1 ms.
[2026-05-22 15:03:31] [INFO ] Implicit Places using invariants in 101 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/139 places, 201/287 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 124/139 places, 201/287 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((F(G(p1))&&F(p2)&&p0))))'
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 102 ms.
Stack based approach found an accepted trace after 2911 steps with 0 reset with depth 2912 and stack size 1471 in 5 ms.
FORMULA Anderson-PT-05-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-13 finished in 425 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 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 287/287 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 139 transition count 268
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 120 transition count 268
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 55 place count 103 transition count 147
Iterating global reduction 0 with 17 rules applied. Total rules applied 72 place count 103 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 102 transition count 146
Applied a total of 74 rules in 12 ms. Remains 102 /139 variables (removed 37) and now considering 146/287 (removed 141) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6162119655191613389.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11779355959214863108.kers'
[2026-05-22 15:03:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6162119655191613389.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11779355959214863108.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 102 cols 532 entries
Finished phase 1 with 26 SingleSign rule and 63 generalized
[2026-05-22 15:03:32] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11779355959214863108.kers
Total runtime 1 ms.
[2026-05-22 15:03:32] [INFO ] Implicit Places using invariants in 166 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/139 places, 146/287 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 101 transition count 121
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 76 transition count 121
Applied a total of 50 rules in 5 ms. Remains 76 /101 variables (removed 25) and now considering 121/146 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18246083866591906463.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7289024977941733265.kers'
[2026-05-22 15:03:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18246083866591906463.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7289024977941733265.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 121 rows 76 cols 432 entries
Finished phase 1 with 26 SingleSign rule and 38 generalized
[2026-05-22 15:03:32] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7289024977941733265.kers
Total runtime 0 ms.
[2026-05-22 15:03:32] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-22 15:03:32] [INFO ] Invariant cache hit.
[2026-05-22 15:03:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 15:03:32] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/139 places, 121/287 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 644 ms. Remains : 76/139 places, 121/287 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 28 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 90 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-15 finished in 795 ms.
All properties solved by simple procedures.
Total runtime 205087 ms.

BK_STOP 1779462213085

--------------------
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="Anderson-PT-05"
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 Anderson-PT-05, 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 r002-oct2-177944366000156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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