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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.4K Mar 8 07:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 8 07:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Mar 8 07:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 232K Mar 8 07:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K Mar 16 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Mar 16 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Mar 16 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 16 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 8 07:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Mar 8 07:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 52K Mar 8 07:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 262K Mar 8 07:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 16 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Mar 16 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 336K 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 PermAdmissibility-PT-05-LTLFireability-00
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-01
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-02
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-03
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-04
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-05
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-06
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-07
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-08
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-09
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-10
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-11
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-12
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-13
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-14
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779799154183

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 12:39:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 12:39:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 12:39:15] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2026-05-26 12:39:15] [INFO ] Transformed 168 places.
[2026-05-26 12:39:15] [INFO ] Transformed 592 transitions.
[2026-05-26 12:39:15] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA PermAdmissibility-PT-05-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 101 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 104 transition count 592
Applied a total of 64 rules in 30 ms. Remains 104 /168 variables (removed 64) and now considering 592/592 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2153368157460719262.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13125978777875150723.kers'
[2026-05-26 12:39:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2153368157460719262.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13125978777875150723.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 592 rows 104 cols 2944 entries
Finished phase 1 with 40 SingleSign rule and 48 generalized
[2026-05-26 12:39:15] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13125978777875150723.kers
Total runtime 3 ms.
[2026-05-26 12:39:16] [INFO ] Implicit Places using invariants in 214 ms returned []
[2026-05-26 12:39:16] [INFO ] Invariant cache hit.
[2026-05-26 12:39:16] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2026-05-26 12:39:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 592/696 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 6 (OVERLAPS) 0/696 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
No progress, stopping.
After SMT solving in domain Real declared 696/696 variables, and 120 constraints, problems are : Problem set: 0 solved, 588 unsolved in 22340 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 592/696 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 588/708 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 696/696 variables, and 708 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53143ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 53161ms
Starting structural reductions in LTL mode, iteration 1 : 104/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53715 ms. Remains : 104/168 places, 592/592 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 592/592 (removed 0) transitions.
[2026-05-26 12:40:09] [INFO ] Invariant cache hit.
[2026-05-26 12:40:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-26 12:40:09] [INFO ] Invariant cache hit.
[2026-05-26 12:40:09] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 104/104 places, 592/592 transitions.
Support contains 101 out of 104 places after structural reductions.
[2026-05-26 12:40:09] [INFO ] Flatten gal took : 98 ms
[2026-05-26 12:40:10] [INFO ] Flatten gal took : 53 ms
[2026-05-26 12:40:10] [INFO ] Input system was already deterministic with 592 transitions.
RANDOM walk for 40007 steps (413 resets) in 505 ms. (79 steps per ms) remains 1/27 properties
BEST_FIRST walk for 1145 steps (0 resets) in 7 ms. (143 steps per ms) remains 0/1 properties
FORMULA PermAdmissibility-PT-05-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 104 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 592
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(G(p0))))))'
Support contains 17 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 14 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (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-16176319854415107510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3650781671500679022.kers'
[2026-05-26 12:40:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16176319854415107510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3650781671500679022.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 91 cols 2368 entries
Finished phase 1 with 27 SingleSign rule and 48 generalized
[2026-05-26 12:40:11] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3650781671500679022.kers
Total runtime 3 ms.
[2026-05-26 12:40:11] [INFO ] Implicit Places using invariants in 236 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 238 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 258 ms. Remains : 90/104 places, 468/592 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(G(p0))))))'
Stuttering acceptance computed with spot in 314 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-02
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-02 finished in 666 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&&F((G(F(!p0))||(!p1&&F(!p0)))))) U (p2 U X(p3))))'
Support contains 44 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 8 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (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-12321195708554996837.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13366398295287939299.kers'
[2026-05-26 12:40:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12321195708554996837.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13366398295287939299.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 91 cols 2412 entries
Finished phase 1 with 27 SingleSign rule and 48 generalized
[2026-05-26 12:40:11] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13366398295287939299.kers
Total runtime 3 ms.
[2026-05-26 12:40:11] [INFO ] Implicit Places using invariants in 66 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 90/104 places, 468/592 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&&F((G(F(!p0))||(!p1&&F(!p0)))))) U (p2 U X(p3))))'
Stuttering acceptance computed with spot in 501 ms :[(NOT p3), (AND p0 (NOT p3)), (NOT p3), (AND p0 p2 (NOT p3)), true, p0, p0, (AND (NOT p3) (NOT p0)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (AND p0 (NOT p3)), (AND p0 (NOT p3))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-03
Entered a terminal (fully accepting) state of product in 409 steps with 133 reset in 21 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-03 finished in 660 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 G(p0)))&&X((G(p2) U p3))))'
Support contains 32 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 68 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 68 transition count 234
Applied a total of 72 rules in 6 ms. Remains 68 /104 variables (removed 36) and now considering 234/592 (removed 358) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6013556156764960494.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6013747819861137278.kers'
[2026-05-26 12:40:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6013556156764960494.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6013747819861137278.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 234 rows 68 cols 1236 entries
Finished phase 1 with 30 SingleSign rule and 22 generalized
[2026-05-26 12:40:12] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6013747819861137278.kers
Total runtime 1 ms.
[2026-05-26 12:40:12] [INFO ] Implicit Places using invariants in 116 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 118 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/104 places, 234/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 66/104 places, 234/592 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 G(p0)))&&X((G(p2) U p3))))'
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p3)), true, (NOT p0), (NOT p3), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-04
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-04 finished in 385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((!p1 U (!p0||G(!p1))))))'
Support contains 14 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 76 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 100 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 52 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 52 transition count 92
Applied a total of 104 rules in 7 ms. Remains 52 /104 variables (removed 52) and now considering 92/592 (removed 500) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14369532896038170079.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15309048266203391820.kers'
[2026-05-26 12:40:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14369532896038170079.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15309048266203391820.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 52 cols 489 entries
Finished phase 1 with 15 SingleSign rule and 21 generalized
[2026-05-26 12:40:12] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15309048266203391820.kers
Total runtime 1 ms.
[2026-05-26 12:40:12] [INFO ] Implicit Places using invariants in 78 ms returned [0, 5, 19, 26]
[2026-05-26 12:40:12] [INFO ] Actually due to overlaps returned [0, 5, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 84 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/104 places, 92/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 49/104 places, 92/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((!p1 U (!p0||G(!p1))))))'
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1), true]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-05
Entered a terminal (fully accepting) state of product in 57 steps with 14 reset in 1 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-05 finished in 228 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 U p1))))'
Support contains 14 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 22 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.6 ms
Discarding 82 places :
Also discarding 544 output transitions
Drop transitions (Output transitions of discarded places.) removed 544 transitions
Applied a total of 1 rules in 23 ms. Remains 22 /104 variables (removed 82) and now considering 48/592 (removed 544) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3869749257413583712.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17551034819754105523.kers'
[2026-05-26 12:40:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3869749257413583712.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17551034819754105523.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 22 cols 192 entries
Finished phase 1 with 13 SingleSign rule and 3 generalized
[2026-05-26 12:40:12] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17551034819754105523.kers
Total runtime 0 ms.
[2026-05-26 12:40:13] [INFO ] Implicit Places using invariants in 180 ms returned []
[2026-05-26 12:40:13] [INFO ] Invariant cache hit.
[2026-05-26 12:40:13] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2026-05-26 12:40:13] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2026-05-26 12:40:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 48/70 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/70 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 28 constraints, problems are : Problem set: 0 solved, 44 unsolved in 581 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 48/70 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 44/72 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/70 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 72 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1270 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1859ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1860ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/104 places, 48/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2105 ms. Remains : 22/104 places, 48/592 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 U p1))))'
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-07
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-07 finished in 2206 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&&G(p1)))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 76 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 100 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 51 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 51 transition count 84
Applied a total of 106 rules in 8 ms. Remains 51 /104 variables (removed 53) and now considering 84/592 (removed 508) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5831001002510321295.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14383054455878928333.kers'
[2026-05-26 12:40:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5831001002510321295.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14383054455878928333.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 51 cols 446 entries
Finished phase 1 with 14 SingleSign rule and 21 generalized
[2026-05-26 12:40:15] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14383054455878928333.kers
Total runtime 0 ms.
[2026-05-26 12:40:15] [INFO ] Implicit Places using invariants in 53 ms returned [0, 5, 18, 25]
[2026-05-26 12:40:15] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/104 places, 84/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 48/104 places, 84/592 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)&&p1))))'
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-08
Product exploration explored 100000 steps with 1234 reset in 450 ms.
Product exploration explored 100000 steps with 1234 reset in 268 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 11 ms. Proved property starting from automaton with 3 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 55 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-05-LTLFireability-08 finished in 953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(X(G(p1))&&F(!p0))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 66 place count 62 transition count 154
Iterating global reduction 0 with 18 rules applied. Total rules applied 84 place count 62 transition count 154
Applied a total of 84 rules in 7 ms. Remains 62 /104 variables (removed 42) and now considering 154/592 (removed 438) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12860978935636653304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16884960171371397611.kers'
[2026-05-26 12:40:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12860978935636653304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16884960171371397611.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 154 rows 62 cols 826 entries
Finished phase 1 with 20 SingleSign rule and 26 generalized
[2026-05-26 12:40:16] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16884960171371397611.kers
Total runtime 1 ms.
[2026-05-26 12:40:16] [INFO ] Implicit Places using invariants in 88 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/104 places, 154/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 61/104 places, 154/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(X(G(p1))&&F(!p0))))'
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-09
Stuttering criterion allowed to conclude after 426 steps with 5 reset in 2 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-09 finished in 221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 68 place count 60 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 88 place count 60 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 58 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 58 transition count 120
Applied a total of 92 rules in 5 ms. Remains 58 /104 variables (removed 46) and now considering 120/592 (removed 472) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12745730988816141996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14475774223066550177.kers'
[2026-05-26 12:40:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12745730988816141996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14475774223066550177.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 120 rows 58 cols 638 entries
Finished phase 1 with 19 SingleSign rule and 23 generalized
[2026-05-26 12:40:16] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14475774223066550177.kers
Total runtime 1 ms.
[2026-05-26 12:40:16] [INFO ] Implicit Places using invariants in 71 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/104 places, 120/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 57/104 places, 120/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-10
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-10 finished in 162 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(F(p1)))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 74 place count 56 transition count 114
Iterating global reduction 0 with 22 rules applied. Total rules applied 96 place count 56 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 54 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 54 transition count 98
Applied a total of 100 rules in 5 ms. Remains 54 /104 variables (removed 50) and now considering 98/592 (removed 494) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18414683839973391344.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-325788456565859005.kers'
[2026-05-26 12:40:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18414683839973391344.kers, --Pflows, --basisKERS=/tmp/petrispot-output-325788456565859005.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 54 cols 525 entries
Finished phase 1 with 17 SingleSign rule and 21 generalized
[2026-05-26 12:40:16] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-325788456565859005.kers
Total runtime 4 ms.
[2026-05-26 12:40:16] [INFO ] Implicit Places using invariants in 55 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/104 places, 98/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 52/104 places, 98/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(F(p1)))))'
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-11
Stuttering criterion allowed to conclude after 94 steps with 1 reset in 1 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-11 finished in 237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U !p1))))'
Support contains 12 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 81 transition count 356
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 81 transition count 356
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 64 place count 63 transition count 150
Iterating global reduction 0 with 18 rules applied. Total rules applied 82 place count 63 transition count 150
Applied a total of 82 rules in 6 ms. Remains 63 /104 variables (removed 41) and now considering 150/592 (removed 442) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12009695658501870801.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4517404335311777074.kers'
[2026-05-26 12:40:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12009695658501870801.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4517404335311777074.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 150 rows 63 cols 802 entries
Finished phase 1 with 21 SingleSign rule and 26 generalized
[2026-05-26 12:40:16] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4517404335311777074.kers
Total runtime 2 ms.
[2026-05-26 12:40:16] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-26 12:40:16] [INFO ] Invariant cache hit.
[2026-05-26 12:40:16] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-26 12:40:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 150/213 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 79 constraints, problems are : Problem set: 0 solved, 146 unsolved in 2585 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 150/213 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 146/225 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 225 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32637ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 32639ms
Starting structural reductions in LTL mode, iteration 1 : 63/104 places, 150/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32798 ms. Remains : 63/104 places, 150/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U !p1))))'
Stuttering acceptance computed with spot in 138 ms :[p1, p1, true, p1]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-12
Entered a terminal (fully accepting) state of product in 373 steps with 14 reset in 2 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-12 finished in 32961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1)&&X(X(F(p0))))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 76 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 100 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 51 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 51 transition count 84
Applied a total of 106 rules in 9 ms. Remains 51 /104 variables (removed 53) and now considering 84/592 (removed 508) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-594815706041875856.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9739232035399920464.kers'
[2026-05-26 12:40:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-594815706041875856.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9739232035399920464.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 51 cols 446 entries
Finished phase 1 with 14 SingleSign rule and 21 generalized
[2026-05-26 12:40:49] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9739232035399920464.kers
Total runtime 0 ms.
[2026-05-26 12:40:49] [INFO ] Implicit Places using invariants in 47 ms returned [0, 5, 18, 25]
[2026-05-26 12:40:49] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/104 places, 84/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 48/104 places, 84/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1)&&X(X(F(p0))))))'
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-13
Product exploration explored 100000 steps with 16008 reset in 186 ms.
Product exploration explored 100000 steps with 15972 reset in 193 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 11 factoid took 49 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 52 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/2 properties
Knowledge based reduction with 11 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12419137995587823978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3164466490583940552.kers'
[2026-05-26 12:40:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12419137995587823978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3164466490583940552.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 48 cols 422 entries
Finished phase 1 with 21 SingleSign rule and 14 generalized
[2026-05-26 12:40:50] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3164466490583940552.kers
Total runtime 0 ms.
[2026-05-26 12:40:50] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2026-05-26 12:40:50] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-26 12:40:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 12:40:50] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2026-05-26 12:40:50] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-26 12:40:50] [INFO ] Computed and/alt/rep : 18/93/18 causal constraints (skipped 62 transitions) in 6 ms.
[2026-05-26 12:40:50] [INFO ] Added : 2 causal constraints over 1 iterations in 44 ms. Result :sat
Could not prove EG (NOT p0)
[2026-05-26 12:40:50] [INFO ] Invariant cache hit.
[2026-05-26 12:40:50] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2026-05-26 12:40:50] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2026-05-26 12:40:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 12:40:50] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2026-05-26 12:40:50] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-26 12:40:50] [INFO ] Computed and/alt/rep : 18/93/18 causal constraints (skipped 62 transitions) in 8 ms.
[2026-05-26 12:40:50] [INFO ] Added : 2 causal constraints over 1 iterations in 23 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 680 ms.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2026-05-26 12:40:51] [INFO ] Invariant cache hit.
[2026-05-26 12:40:51] [INFO ] Implicit Places using invariants in 51 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/48 places, 84/84 transitions.
Applied a total of 0 rules in 0 ms. Remains 47 /47 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 47/48 places, 84/84 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 6 factoid took 39 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 52 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/2 properties
Knowledge based reduction with 6 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18043029969904374110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15916716758140522809.kers'
[2026-05-26 12:40:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18043029969904374110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15916716758140522809.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 47 cols 412 entries
Finished phase 1 with 24 SingleSign rule and 11 generalized
[2026-05-26 12:40:51] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15916716758140522809.kers
Total runtime 1 ms.
[2026-05-26 12:40:51] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 3 ms returned sat
[2026-05-26 12:40:51] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2026-05-26 12:40:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 12:40:51] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 3 ms returned sat
[2026-05-26 12:40:51] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-26 12:40:51] [INFO ] Computed and/alt/rep : 19/94/19 causal constraints (skipped 61 transitions) in 10 ms.
[2026-05-26 12:40:51] [INFO ] Added : 2 causal constraints over 1 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
[2026-05-26 12:40:51] [INFO ] Invariant cache hit.
[2026-05-26 12:40:51] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 4 ms returned sat
[2026-05-26 12:40:51] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-26 12:40:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 12:40:51] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 4 ms returned sat
[2026-05-26 12:40:51] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2026-05-26 12:40:51] [INFO ] Computed and/alt/rep : 19/94/19 causal constraints (skipped 61 transitions) in 6 ms.
[2026-05-26 12:40:51] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 654 ms.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15970 reset in 153 ms.
Product exploration explored 100000 steps with 16003 reset in 156 ms.
Spot run failed in 82 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin18403681395455470791
[2026-05-26 12:40:52] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18403681395455470791
Running compilation step : cd /tmp/ltsmin18403681395455470791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 275 ms.
Running link step : cd /tmp/ltsmin18403681395455470791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin18403681395455470791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased9482562277033383285.hoa' '--buchi-type=spotba'
LTSmin run took 75 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-05-LTLFireability-13 finished in 3329 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 X(G((p0 U X(p1))))) U X(p2)))'
Support contains 9 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 74 place count 56 transition count 114
Iterating global reduction 0 with 22 rules applied. Total rules applied 96 place count 56 transition count 114
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 53 transition count 90
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 53 transition count 90
Applied a total of 102 rules in 7 ms. Remains 53 /104 variables (removed 51) and now considering 90/592 (removed 502) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-774063759800253023.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13079444007066103765.kers'
[2026-05-26 12:40:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-774063759800253023.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13079444007066103765.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 90 rows 53 cols 482 entries
Finished phase 1 with 18 SingleSign rule and 19 generalized
[2026-05-26 12:40:53] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13079444007066103765.kers
Total runtime 1 ms.
[2026-05-26 12:40:53] [INFO ] Implicit Places using invariants in 49 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/104 places, 90/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 51/104 places, 90/592 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 X(G((p0 U X(p1))))) U X(p2)))'
Stuttering acceptance computed with spot in 337 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), false, (NOT p1), (NOT p1), true]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Computed a total of 51 stabilizing places and 90 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 90
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 15 factoid took 13 ms. Proved property starting from automaton with 10 states, 28 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 55 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-05-LTLFireability-14 finished in 723 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((p0||(F(p0) U !p1)||X(p2)))))'
Support contains 9 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 82 transition count 360
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 82 transition count 360
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 60 place count 66 transition count 172
Iterating global reduction 0 with 16 rules applied. Total rules applied 76 place count 66 transition count 172
Applied a total of 76 rules in 6 ms. Remains 66 /104 variables (removed 38) and now considering 172/592 (removed 420) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17591264738869476917.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9583264183172367874.kers'
[2026-05-26 12:40:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17591264738869476917.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9583264183172367874.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 66 cols 926 entries
Finished phase 1 with 27 SingleSign rule and 23 generalized
[2026-05-26 12:40:53] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9583264183172367874.kers
Total runtime 3 ms.
[2026-05-26 12:40:53] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-26 12:40:53] [INFO ] Invariant cache hit.
[2026-05-26 12:40:53] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2026-05-26 12:40:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 168 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 172/238 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/238 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 82 constraints, problems are : Problem set: 0 solved, 168 unsolved in 3106 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 172/238 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 168/250 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/238 variables, and 250 constraints, problems are : Problem set: 0 solved, 168 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33168ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 33168ms
Starting structural reductions in LTL mode, iteration 1 : 66/104 places, 172/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33446 ms. Remains : 66/104 places, 172/592 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) U !p1)||X(p2)||p0))))'
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p0), p1]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 114 ms.
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Computed a total of 66 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 172
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 12 ms. Proved property starting from automaton with 6 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 58 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-05-LTLFireability-15 finished in 34005 ms.
All properties solved by simple procedures.
Total runtime 132329 ms.

BK_STOP 1779799288091

--------------------
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="PermAdmissibility-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 PermAdmissibility-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 r194-tall-177969914200620"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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