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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 8.2K Mar 8 14:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 8 14:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 8 14:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 8 14:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 16 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 16 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 16 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 16 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Mar 8 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 8 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 8 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 8 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 12K 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 Murphy-PT-D2N050-LTLFireability-00
FORMULA_NAME Murphy-PT-D2N050-LTLFireability-01
FORMULA_NAME Murphy-PT-D2N050-LTLFireability-02
FORMULA_NAME Murphy-PT-D2N050-LTLFireability-03
FORMULA_NAME Murphy-PT-D2N050-LTLFireability-04
FORMULA_NAME Murphy-PT-D2N050-LTLFireability-05
FORMULA_NAME Murphy-PT-D2N050-LTLFireability-06
FORMULA_NAME Murphy-PT-D2N050-LTLFireability-07
FORMULA_NAME Murphy-PT-D2N050-LTLFireability-08
FORMULA_NAME Murphy-PT-D2N050-LTLFireability-09
FORMULA_NAME Murphy-PT-D2N050-LTLFireability-10
FORMULA_NAME Murphy-PT-D2N050-LTLFireability-11
FORMULA_NAME Murphy-PT-D2N050-LTLFireability-12
FORMULA_NAME Murphy-PT-D2N050-LTLFireability-13
FORMULA_NAME Murphy-PT-D2N050-LTLFireability-14
FORMULA_NAME Murphy-PT-D2N050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779709046012

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D2N050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 11:37:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 11:37:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 11:37:27] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2026-05-25 11:37:27] [INFO ] Transformed 18 places.
[2026-05-25 11:37:27] [INFO ] Transformed 21 transitions.
[2026-05-25 11:37:27] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 114 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Murphy-PT-D2N050-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N050-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N050-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N050-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 14 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17978197752339569859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4024922037337721951.kers'
[2026-05-25 11:37:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17978197752339569859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4024922037337721951.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 21 rows 15 cols 51 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 11:37:27] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4024922037337721951.kers
Total runtime 1 ms.
[2026-05-25 11:37:27] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 769ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 782ms
[2026-05-25 11:37:28] [INFO ] Invariant cache hit.
[2026-05-25 11:37:28] [INFO ] Implicit Places using invariants in 38 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 906 ms. Remains : 17/18 places, 21/21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14037218612047392879.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1821133862006190865.kers'
[2026-05-25 11:37:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14037218612047392879.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1821133862006190865.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 21 rows 15 cols 51 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 11:37:28] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1821133862006190865.kers
Total runtime 0 ms.
[2026-05-25 11:37:28] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/14 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/35 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/38 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/38 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 26 constraints, problems are : Problem set: 0 solved, 12 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/14 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/35 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/38 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 38 constraints, problems are : Problem set: 0 solved, 12 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 353ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 355ms
[2026-05-25 11:37:28] [INFO ] Invariant cache hit.
[2026-05-25 11:37:28] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-25 11:37:28] [INFO ] Invariant cache hit.
[2026-05-25 11:37:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 11:37:28] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 402 ms. Remains : 17/17 places, 21/21 transitions.
Support contains 13 out of 17 places after structural reductions.
[2026-05-25 11:37:28] [INFO ] Flatten gal took : 15 ms
[2026-05-25 11:37:28] [INFO ] Flatten gal took : 4 ms
[2026-05-25 11:37:28] [INFO ] Input system was already deterministic with 21 transitions.
RANDOM walk for 40135 steps (8 resets) in 323 ms. (123 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
[2026-05-25 11:37:29] [INFO ] Invariant cache hit.
[2026-05-25 11:37:29] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/20 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 11/31 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/31 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/31 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/33 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/33 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/33 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/38 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/38 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/38 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 26 constraints, problems are : Problem set: 0 solved, 2 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/20 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/31 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/31 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/31 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/33 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/33 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/38 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/38 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/38 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 28 constraints, problems are : Problem set: 0 solved, 2 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 17 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 21/21 transitions.
Graph (complete) has 59 edges and 17 vertex of which 6 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 6 transition count 8
Applied a total of 3 rules in 20 ms. Remains 6 /17 variables (removed 11) and now considering 8/21 (removed 13) transitions.
Running 6 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17787715235290886561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17216120779079167823.kers'
[2026-05-25 11:37:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17787715235290886561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17216120779079167823.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 6 cols 18 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-25 11:37:29] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17216120779079167823.kers
Total runtime 0 ms.
[2026-05-25 11:37:29] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[State Equation: 6/6 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[State Equation: 6/6 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 6/17 places, 8/21 transitions.
RANDOM walk for 40001 steps (8 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Probably explored full state space saw : 36 states, properties seen :0
Probabilistic random walk after 132 steps, saw 36 distinct states, run finished after 16 ms. (steps per millisecond=8 ) properties seen :0
Explored full state space saw : 36 states, properties seen :0
Exhaustive walk after 132 steps, saw 36 distinct states, run finished after 2 ms. (steps per millisecond=66 ) properties seen :0
FORMULA Murphy-PT-D2N050-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA Murphy-PT-D2N050-LTLFireability-08 FALSE 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' '!((G(F(p0))||G((G(p1) U X(X((!p0||X(!p0))))))))'
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4765302047334277916.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10156621125655294460.kers'
[2026-05-25 11:37:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4765302047334277916.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10156621125655294460.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 21 rows 15 cols 51 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 11:37:29] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10156621125655294460.kers
Total runtime 0 ms.
[2026-05-25 11:37:29] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/14 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/35 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/38 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/38 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 26 constraints, problems are : Problem set: 0 solved, 12 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/14 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/35 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/38 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 38 constraints, problems are : Problem set: 0 solved, 12 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 332ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 333ms
[2026-05-25 11:37:30] [INFO ] Invariant cache hit.
[2026-05-25 11:37:30] [INFO ] Implicit Places using invariants in 26 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/17 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 360 ms. Remains : 15/17 places, 21/21 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))||G((G(p1) U X(X((!p0||X(!p0))))))))'
Stuttering acceptance computed with spot in 621 ms :[false, false, false, false, false, false, false, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-PT-D2N050-LTLFireability-01
Product exploration explored 100000 steps with 4497 reset in 288 ms.
Stack based approach found an accepted trace after 31 steps with 1 reset with depth 28 and stack size 26 in 0 ms.
FORMULA Murphy-PT-D2N050-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N050-LTLFireability-01 finished in 1338 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(X(p0))))&&(G(p0)||X(p1))))'
Support contains 4 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:37:31] [INFO ] Invariant cache hit.
[2026-05-25 11:37:31] [INFO ] Implicit Places using invariants in 19 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/17 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21 ms. Remains : 16/17 places, 21/21 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))))&&(G(p0)||X(p1))))'
Stuttering acceptance computed with spot in 320 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Murphy-PT-D2N050-LTLFireability-02
Entered a terminal (fully accepting) state of product in 89 steps with 0 reset in 1 ms.
FORMULA Murphy-PT-D2N050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D2N050-LTLFireability-02 finished in 373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (F(p2) U G(p0))))'
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 6 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:37:31] [INFO ] Invariant cache hit.
[2026-05-25 11:37:31] [INFO ] Implicit Places using invariants in 20 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/17 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30 ms. Remains : 16/17 places, 21/21 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (F(p2) U G(p0))))'
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p2), (NOT p0)]
Running random walk in product with property : Murphy-PT-D2N050-LTLFireability-03
Product exploration explored 100000 steps with 146 reset in 174 ms.
Stack based approach found an accepted trace after 69 steps with 1 reset with depth 41 and stack size 40 in 1 ms.
FORMULA Murphy-PT-D2N050-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N050-LTLFireability-03 finished in 349 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 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:37:31] [INFO ] Invariant cache hit.
[2026-05-25 11:37:31] [INFO ] Implicit Places using invariants in 22 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/17 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 28 ms. Remains : 16/17 places, 21/21 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 45 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D2N050-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 158 ms.
Stack based approach found an accepted trace after 80 steps with 0 reset with depth 81 and stack size 79 in 2 ms.
FORMULA Murphy-PT-D2N050-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N050-LTLFireability-05 finished in 272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(((F(G(!p0))||G(X(p1))) U p0))))))'
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:37:32] [INFO ] Invariant cache hit.
[2026-05-25 11:37:32] [INFO ] Implicit Places using invariants in 24 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/17 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27 ms. Remains : 16/17 places, 21/21 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(((F(G(!p0))||G(X(p1))) U p0))))))'
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), p0, (AND p0 (NOT p1))]
Running random walk in product with property : Murphy-PT-D2N050-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 159 ms.
Stack based approach found an accepted trace after 2055 steps with 0 reset with depth 2056 and stack size 1983 in 4 ms.
FORMULA Murphy-PT-D2N050-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N050-LTLFireability-07 finished in 449 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)||X(p1))) U (p1&&X((F(p0)||X(p1)))))))'
Support contains 4 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:37:32] [INFO ] Invariant cache hit.
[2026-05-25 11:37:32] [INFO ] Implicit Places using invariants in 22 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/17 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25 ms. Remains : 16/17 places, 21/21 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)||X(p1))) U (p1&&X((F(p0)||X(p1)))))))'
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Murphy-PT-D2N050-LTLFireability-09
Product exploration explored 100000 steps with 5282 reset in 129 ms.
Stack based approach found an accepted trace after 20 steps with 1 reset with depth 17 and stack size 17 in 1 ms.
FORMULA Murphy-PT-D2N050-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N050-LTLFireability-09 finished in 395 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))&&F(p0))))'
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:37:32] [INFO ] Invariant cache hit.
[2026-05-25 11:37:32] [INFO ] Implicit Places using invariants in 20 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/17 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23 ms. Remains : 15/17 places, 21/21 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))&&F(!p0))))'
Stuttering acceptance computed with spot in 161 ms :[true, true, p0, (NOT p0)]
Running random walk in product with property : Murphy-PT-D2N050-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 157 ms.
Stack based approach found an accepted trace after 56 steps with 0 reset with depth 57 and stack size 57 in 0 ms.
FORMULA Murphy-PT-D2N050-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N050-LTLFireability-10 finished in 366 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 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:37:33] [INFO ] Invariant cache hit.
[2026-05-25 11:37:33] [INFO ] Implicit Places using invariants in 22 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/17 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26 ms. Remains : 15/17 places, 21/21 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 35 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D2N050-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 134 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA Murphy-PT-D2N050-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N050-LTLFireability-11 finished in 219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 3 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:37:33] [INFO ] Invariant cache hit.
[2026-05-25 11:37:33] [INFO ] Implicit Places using invariants in 27 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/17 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32 ms. Remains : 15/17 places, 21/21 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D2N050-LTLFireability-14
Product exploration explored 100000 steps with 3229 reset in 119 ms.
Stack based approach found an accepted trace after 99 steps with 3 reset with depth 33 and stack size 33 in 1 ms.
FORMULA Murphy-PT-D2N050-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N050-LTLFireability-14 finished in 272 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||G(p1))) U X(p2))))'
Support contains 4 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:37:33] [INFO ] Invariant cache hit.
[2026-05-25 11:37:33] [INFO ] Implicit Places using invariants in 27 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/17 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 16/17 places, 21/21 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((G(p0)||p1)) U X(p2))))'
Stuttering acceptance computed with spot in 356 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), true, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-PT-D2N050-LTLFireability-15
Entered a terminal (fully accepting) state of product in 25 steps with 7 reset in 1 ms.
FORMULA Murphy-PT-D2N050-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D2N050-LTLFireability-15 finished in 427 ms.
All properties solved by simple procedures.
Total runtime 7048 ms.

BK_STOP 1779709054229

--------------------
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="Murphy-PT-D2N050"
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 Murphy-PT-D2N050, 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-177969913900068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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