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-177969914200579.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-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914200579
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.2K Mar 8 07:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 8 07:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 8 07:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 3.8K Mar 16 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 16 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 16 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 16 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 8 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Mar 8 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 8 07:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 8 07:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 16 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 37K 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-COL-10-LTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779789522821

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202604301425
[2026-05-26 09:58:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 09:58:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 09:58:44] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-26 09:58:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 09:58:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 540 ms
[2026-05-26 09:58:44] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2026-05-26 09:58:44] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 5 ms.
[2026-05-26 09:58:44] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PermAdmissibility-COL-10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40005 steps (224 resets) in 305 ms. (130 steps per ms) remains 4/34 properties
BEST_FIRST walk for 40003 steps (44 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (44 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (48 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (65 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5221991618083307532.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10366817809369666072.kers'
[2026-05-26 09:58:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5221991618083307532.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10366817809369666072.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 16 rows 34 cols 75 entries
Finished phase 1 with 1 SingleSign rule and 15 generalized
[2026-05-26 09:58:45] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10366817809369666072.kers
Total runtime 1 ms.
Problem AtomicPropp7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 1 (OVERLAPS) 24/31 variables, 15/15 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp24 is UNSAT
After SMT solving in domain Real declared 40/56 variables, and 24 constraints, problems are : Problem set: 4 solved, 0 unsolved in 190 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/40 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 232ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
[2026-05-26 09:58:45] [INFO ] Flatten gal took : 16 ms
[2026-05-26 09:58:45] [INFO ] Flatten gal took : 4 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2026-05-26 09:58:45] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 8 ms.
[2026-05-26 09:58:45] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Support contains 32 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 37 transition count 16
Applied a total of 3 rules in 14 ms. Remains 37 /40 variables (removed 3) and now considering 16/16 (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-18309199566519579689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5401668545337634692.kers'
[2026-05-26 09:58:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18309199566519579689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5401668545337634692.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 16 rows 34 cols 75 entries
Finished phase 1 with 1 SingleSign rule and 15 generalized
[2026-05-26 09:58:45] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5401668545337634692.kers
Total runtime 0 ms.
[2026-05-26 09:58:45] [INFO ] Implicit Places using invariants in 57 ms returned [23, 25]
[2026-05-26 09:58:45] [INFO ] Actually due to overlaps returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/40 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 36 /36 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 36/40 places, 16/16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 16/16 (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-13997866502246968746.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12296509572229462530.kers'
[2026-05-26 09:58:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13997866502246968746.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12296509572229462530.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 16 rows 33 cols 72 entries
Finished phase 1 with 2 SingleSign rule and 14 generalized
[2026-05-26 09:58:45] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12296509572229462530.kers
Total runtime 0 ms.
[2026-05-26 09:58:45] [INFO ] Implicit Places using invariants in 44 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/36 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 35 /35 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 35/36 places, 16/16 transitions.
Support contains 32 out of 35 places after structural reductions.
[2026-05-26 09:58:45] [INFO ] Flatten gal took : 4 ms
[2026-05-26 09:58:45] [INFO ] Flatten gal took : 4 ms
[2026-05-26 09:58:45] [INFO ] Input system was already deterministic with 16 transitions.
RANDOM walk for 40001 steps (224 resets) in 40 ms. (975 steps per ms) remains 4/34 properties
BEST_FIRST walk for 40003 steps (44 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (44 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (47 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (66 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6129317516812964064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9130329348558663566.kers'
[2026-05-26 09:58:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6129317516812964064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9130329348558663566.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 16 rows 32 cols 69 entries
Finished phase 1 with 5 SingleSign rule and 11 generalized
[2026-05-26 09:58:45] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9130329348558663566.kers
Total runtime 0 ms.
Problem AtomicPropp7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp32 is UNSAT
After SMT solving in domain Real declared 29/51 variables, and 13 constraints, problems are : Problem set: 4 solved, 0 unsolved in 33 ms.
Refiners :[Generalized P Invariants (flows): 13/19 constraints, State Equation: 0/35 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PermAdmissibility-COL-10-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
Computed a total of 35 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35 transition count 16
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((F(p0)||X(G(p1)))))'
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 28 transition count 16
Applied a total of 7 rules in 0 ms. Remains 28 /35 variables (removed 7) and now considering 16/16 (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-4781635037757953638.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4537314479432932811.kers'
[2026-05-26 09:58:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4781635037757953638.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4537314479432932811.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 28 cols 65 entries
Finished phase 1 with 5 SingleSign rule and 11 generalized
[2026-05-26 09:58:46] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4537314479432932811.kers
Total runtime 0 ms.
[2026-05-26 09:58:46] [INFO ] Implicit Places using invariants in 47 ms returned [4, 5, 7, 12, 13, 14, 15, 16, 17, 22, 23]
[2026-05-26 09:58:46] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 15, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 48 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/35 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 21/35 places, 16/16 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(G(p1)))))'
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Computed a total of 21 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 16
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 8 factoid took 31 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 160 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-10-LTLCardinality-00 finished in 803 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 U X(p1))) U (p2 U X(p3)))))'
Support contains 4 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 29 transition count 16
Applied a total of 6 rules in 3 ms. Remains 29 /35 variables (removed 6) and now considering 16/16 (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-15785968944372939445.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-290352161938483242.kers'
[2026-05-26 09:58:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15785968944372939445.kers, --Pflows, --basisKERS=/tmp/petrispot-output-290352161938483242.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 29 cols 66 entries
Finished phase 1 with 4 SingleSign rule and 12 generalized
[2026-05-26 09:58:47] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-290352161938483242.kers
Total runtime 0 ms.
[2026-05-26 09:58:47] [INFO ] Implicit Places using invariants in 49 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 17, 22]
[2026-05-26 09:58:47] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 15, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 51 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/35 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 22/35 places, 16/16 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((p0 U X(p1))) U (p2 U X(p3)))))'
Stuttering acceptance computed with spot in 529 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-02
Product exploration explored 100000 steps with 19962 reset in 273 ms.
Product exploration explored 100000 steps with 19952 reset in 199 ms.
Computed a total of 22 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 16
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 15 factoid took 149 ms. Reduced automaton from 12 states, 21 edges and 4 AP (stutter sensitive) to 12 states, 20 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (224 resets) in 41 ms. (952 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40004 steps (52 resets) in 115 ms. (344 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (44 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15896899631107679030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10840113566071486663.kers'
[2026-05-26 09:58:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15896899631107679030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10840113566071486663.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 22 cols 47 entries
Finished phase 1 with 11 SingleSign rule and 5 generalized
[2026-05-26 09:58:48] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10840113566071486663.kers
Total runtime 0 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/22 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/38 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 28 constraints, problems are : Problem set: 0 solved, 1 unsolved in 40 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf8 is UNSAT
After SMT solving in domain Int declared 2/38 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/22 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 16 factoid took 810 ms. Reduced automaton from 12 states, 20 edges and 4 AP (stutter sensitive) to 12 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 456 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3)]
[2026-05-26 09:58:49] [INFO ] Invariant cache hit.
[2026-05-26 09:58:49] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned unsat
Proved EG (NOT p3) asserting that LTL formula F !(NOT p3) is false.
Negative knowledge disproves property using: (F p3)
Knowledge-based reduction took 1651 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-02 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property PermAdmissibility-COL-10-LTLCardinality-02 finished in 2753 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 G(!p0)))'
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Graph (complete) has 76 edges and 35 vertex of which 18 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Applied a total of 1 rules in 11 ms. Remains 18 /35 variables (removed 17) and now considering 10/16 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14326569479223142484.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4854479505347848595.kers'
[2026-05-26 09:58:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14326569479223142484.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4854479505347848595.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 18 cols 41 entries
Finished phase 1 with 3 SingleSign rule and 7 generalized
[2026-05-26 09:58:50] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4854479505347848595.kers
Total runtime 0 ms.
[2026-05-26 09:58:50] [INFO ] Implicit Places using invariants in 35 ms returned [3, 8, 9, 10, 11, 13]
[2026-05-26 09:58:50] [INFO ] Actually due to overlaps returned [3, 8, 9, 10, 11]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 36 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/35 places, 10/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 10 transition count 7
Applied a total of 4 rules in 6 ms. Remains 10 /13 variables (removed 3) and now considering 7/10 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8903835291692567255.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-820310414706275020.kers'
[2026-05-26 09:58:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8903835291692567255.kers, --Pflows, --basisKERS=/tmp/petrispot-output-820310414706275020.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 10 cols 21 entries
Finished phase 1 with 5 SingleSign rule and 2 generalized
[2026-05-26 09:58:50] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-820310414706275020.kers
Total runtime 0 ms.
[2026-05-26 09:58:50] [INFO ] Implicit Places using invariants in 22 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/35 places, 7/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7316237290248383109.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3693049500970349604.kers'
[2026-05-26 09:58:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7316237290248383109.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3693049500970349604.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 8 cols 17 entries
Finished phase 1 with 5 SingleSign rule and 1 generalized
[2026-05-26 09:58:50] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3693049500970349604.kers
Total runtime 0 ms.
[2026-05-26 09:58:50] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-26 09:58:50] [INFO ] Invariant cache hit.
[2026-05-26 09:58:50] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 8/35 places, 6/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 124 ms. Remains : 8/35 places, 6/16 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 G(!p0)))'
Stuttering acceptance computed with spot in 96 ms :[p0, true, p0]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLCardinality-03 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p0||X(F((p0&&X(F(!p0))))))) U X(X(p1)))))'
Support contains 4 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 29 transition count 16
Applied a total of 6 rules in 2 ms. Remains 29 /35 variables (removed 6) and now considering 16/16 (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-16965191072745963218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16942817296956893036.kers'
[2026-05-26 09:58:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16965191072745963218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16942817296956893036.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 29 cols 66 entries
Finished phase 1 with 5 SingleSign rule and 11 generalized
[2026-05-26 09:58:50] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16942817296956893036.kers
Total runtime 0 ms.
[2026-05-26 09:58:50] [INFO ] Implicit Places using invariants in 79 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 17, 23]
[2026-05-26 09:58:50] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 15, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 82 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/35 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 22/35 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p0||X(F((p0&&X(F(!p0))))))) U X(X(p1)))))'
Stuttering acceptance computed with spot in 333 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), true, p0, (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-04
Stuttering criterion allowed to conclude after 380 steps with 6 reset in 1 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLCardinality-04 finished in 463 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(p1)&&F(p2)))))'
Support contains 4 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 29 transition count 16
Applied a total of 6 rules in 1 ms. Remains 29 /35 variables (removed 6) and now considering 16/16 (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-16574363024369444325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1406774290071574378.kers'
[2026-05-26 09:58:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16574363024369444325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1406774290071574378.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 29 cols 66 entries
Finished phase 1 with 6 SingleSign rule and 10 generalized
[2026-05-26 09:58:50] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1406774290071574378.kers
Total runtime 1 ms.
[2026-05-26 09:58:50] [INFO ] Implicit Places using invariants in 55 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 22, 23]
[2026-05-26 09:58:50] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 15, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 56 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/35 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 22/35 places, 16/16 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(p1)&&F(p2)))))'
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-05
Product exploration explored 100000 steps with 1061 reset in 124 ms.
Product exploration explored 100000 steps with 1064 reset in 145 ms.
Computed a total of 22 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 16
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 62 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 11 factoid took 85 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 305 ms.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (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-14308813154054822701.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15980508370545706443.kers'
[2026-05-26 09:58:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14308813154054822701.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15980508370545706443.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 22 cols 47 entries
Finished phase 1 with 13 SingleSign rule and 3 generalized
[2026-05-26 09:58:51] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15980508370545706443.kers
Total runtime 0 ms.
[2026-05-26 09:58:51] [INFO ] Implicit Places using invariants in 37 ms returned [4, 5, 10, 16]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 38 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/22 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 18/22 places, 16/16 transitions.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 16
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 3 factoid took 44 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 230 ms.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1064 reset in 83 ms.
Product exploration explored 100000 steps with 1052 reset in 98 ms.
Spot run failed in 83 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/ltsmin12908187878068826219
[2026-05-26 09:58:52] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12908187878068826219
Running compilation step : cd /tmp/ltsmin12908187878068826219;'/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 184 ms.
Running link step : cd /tmp/ltsmin12908187878068826219;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12908187878068826219;'/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/stateBased11830408892103041559.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 16
Applied a total of 1 rules in 0 ms. Remains 17 /18 variables (removed 1) and now considering 16/16 (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-13572224893260148137.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3999005857566421061.kers'
[2026-05-26 09:59:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13572224893260148137.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3999005857566421061.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 17 cols 34 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-26 09:59:07] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3999005857566421061.kers
Total runtime 0 ms.
[2026-05-26 09:59:07] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-26 09:59:07] [INFO ] Invariant cache hit.
[2026-05-26 09:59:07] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2026-05-26 09:59:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 16/32 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/33 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/33 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 18 constraints, problems are : Problem set: 0 solved, 15 unsolved in 345 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 16/32 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/33 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 33 constraints, problems are : Problem set: 0 solved, 15 unsolved in 289 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 638ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 638ms
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 717 ms. Remains : 17/18 places, 16/16 transitions.
Built C files in :
/tmp/ltsmin14351958623168679226
[2026-05-26 09:59:08] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14351958623168679226
Running compilation step : cd /tmp/ltsmin14351958623168679226;'/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 68 ms.
Running link step : cd /tmp/ltsmin14351958623168679226;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14351958623168679226;'/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/stateBased3013250905456085715.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 09:59:23] [INFO ] Flatten gal took : 2 ms
[2026-05-26 09:59:23] [INFO ] Flatten gal took : 1 ms
[2026-05-26 09:59:23] [INFO ] Time to serialize gal into /tmp/LTL17963520397597397469.gal : 1 ms
[2026-05-26 09:59:23] [INFO ] Time to serialize properties into /tmp/LTL16937798791902660520.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17963520397597397469.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17121654242864529265.hoa' '-atoms' '/tmp/LTL16937798791902660520.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16937798791902660520.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17121654242864529265.hoa
Reverse transition relation is NOT exact ! Due to transitions t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
123 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.25301,51948,1,0,760,204873,53,463,589,260297,1515
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-10-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property PermAdmissibility-COL-10-LTLCardinality-05 finished in 34007 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||G(p1)))))'
Support contains 4 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Graph (complete) has 76 edges and 35 vertex of which 24 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 2 ms. Remains 24 /35 variables (removed 11) and now considering 14/16 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16538400909869455640.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15119117207899729391.kers'
[2026-05-26 09:59:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16538400909869455640.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15119117207899729391.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 14 rows 24 cols 55 entries
Finished phase 1 with 5 SingleSign rule and 9 generalized
[2026-05-26 09:59:24] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15119117207899729391.kers
Total runtime 0 ms.
[2026-05-26 09:59:24] [INFO ] Implicit Places using invariants in 40 ms returned [4, 5, 6, 12, 14, 16, 17]
[2026-05-26 09:59:24] [INFO ] Actually due to overlaps returned [4, 5, 12, 14, 17]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 41 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/35 places, 14/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 19 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 13
Applied a total of 2 rules in 2 ms. Remains 18 /19 variables (removed 1) and now considering 13/14 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5918178367744054956.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4608659833413111577.kers'
[2026-05-26 09:59:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5918178367744054956.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4608659833413111577.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 13 rows 18 cols 39 entries
Finished phase 1 with 9 SingleSign rule and 4 generalized
[2026-05-26 09:59:24] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4608659833413111577.kers
Total runtime 0 ms.
[2026-05-26 09:59:24] [INFO ] Implicit Places using invariants in 35 ms returned [4, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/35 places, 13/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 12
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 14 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 13 transition count 10
Applied a total of 6 rules in 3 ms. Remains 13 /16 variables (removed 3) and now considering 10/13 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14275710884047721214.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9979202839174291586.kers'
[2026-05-26 09:59:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14275710884047721214.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9979202839174291586.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 13 cols 27 entries
Finished phase 1 with 7 SingleSign rule and 3 generalized
[2026-05-26 09:59:24] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9979202839174291586.kers
Total runtime 0 ms.
[2026-05-26 09:59:24] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-26 09:59:24] [INFO ] Invariant cache hit.
[2026-05-26 09:59:24] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 13/35 places, 10/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 137 ms. Remains : 13/35 places, 10/16 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((G(p0)||p1))))'
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-06
Stuttering criterion allowed to conclude after 292 steps with 3 reset in 1 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLCardinality-06 finished in 235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(X(X(F(p1)))))))'
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 28 transition count 16
Applied a total of 7 rules in 1 ms. Remains 28 /35 variables (removed 7) and now considering 16/16 (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-9616579248478588455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13094961608475384296.kers'
[2026-05-26 09:59:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9616579248478588455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13094961608475384296.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 28 cols 65 entries
Finished phase 1 with 5 SingleSign rule and 11 generalized
[2026-05-26 09:59:24] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13094961608475384296.kers
Total runtime 0 ms.
[2026-05-26 09:59:25] [INFO ] Implicit Places using invariants in 58 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 17, 22, 23]
[2026-05-26 09:59:25] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 15, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 73 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/35 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 21/35 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(X(X(F(p1)))))))'
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 42 ms.
Product exploration explored 100000 steps with 25000 reset in 52 ms.
Computed a total of 21 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 16
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 3 factoid took 10 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 45 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-10-LTLCardinality-07 finished in 375 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(X(X((!p0&&F(G(p1))))))))'
Support contains 3 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 28 transition count 16
Applied a total of 7 rules in 1 ms. Remains 28 /35 variables (removed 7) and now considering 16/16 (removed 0) transitions.
[2026-05-26 09:59:25] [INFO ] Invariant cache hit.
[2026-05-26 09:59:25] [INFO ] Implicit Places using invariants in 34 ms returned [5, 6, 7, 13, 14, 15, 16, 17, 22, 23]
[2026-05-26 09:59:25] [INFO ] Actually due to overlaps returned [5, 6, 13, 14, 15, 22]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 46 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/35 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 22/35 places, 16/16 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(X(X((!p0&&F(G(p1))))))))'
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLCardinality-08 finished in 299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U (p1||G(p0))) U X(p2))&&(p3||X(X(G(p3)))))))'
Support contains 6 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 28 transition count 16
Applied a total of 7 rules in 1 ms. Remains 28 /35 variables (removed 7) and now considering 16/16 (removed 0) transitions.
[2026-05-26 09:59:25] [INFO ] Invariant cache hit.
[2026-05-26 09:59:25] [INFO ] Implicit Places using invariants in 33 ms returned [4, 5, 6, 7, 12, 13, 16, 17, 22, 23]
[2026-05-26 09:59:25] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 16, 17, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 43 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/35 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 21/35 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U (p1||G(p0))) U X(p2))&&(p3||X(X(G(p3)))))))'
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (NOT p3), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLCardinality-09 finished in 414 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)||G(F(p1)))))'
Support contains 3 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Graph (complete) has 76 edges and 35 vertex of which 30 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 30 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 29 transition count 15
Applied a total of 3 rules in 9 ms. Remains 29 /35 variables (removed 6) and now considering 15/16 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1651907763157642586.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8521277425594745631.kers'
[2026-05-26 09:59:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1651907763157642586.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8521277425594745631.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 15 rows 29 cols 65 entries
Finished phase 1 with 5 SingleSign rule and 10 generalized
[2026-05-26 09:59:26] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8521277425594745631.kers
Total runtime 0 ms.
[2026-05-26 09:59:26] [INFO ] Implicit Places using invariants in 41 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 17, 22, 23]
[2026-05-26 09:59:26] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 15, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 48 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/35 places, 15/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 21 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 20 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 19 transition count 12
Applied a total of 6 rules in 2 ms. Remains 19 /22 variables (removed 3) and now considering 12/15 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11718574847577882354.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2625545937341218018.kers'
[2026-05-26 09:59:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11718574847577882354.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2625545937341218018.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 19 cols 40 entries
Finished phase 1 with 8 SingleSign rule and 4 generalized
[2026-05-26 09:59:26] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2625545937341218018.kers
Total runtime 0 ms.
[2026-05-26 09:59:26] [INFO ] Implicit Places using invariants in 32 ms returned [4, 5, 8, 9, 13]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 33 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/35 places, 12/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 14 transition count 5
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 7 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 6 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 6 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 5 transition count 3
Applied a total of 18 rules in 1 ms. Remains 5 /14 variables (removed 9) and now considering 3/12 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2567855300813348313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7580583734744317134.kers'
[2026-05-26 09:59:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2567855300813348313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7580583734744317134.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 5 cols 7 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-26 09:59:26] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7580583734744317134.kers
Total runtime 0 ms.
[2026-05-26 09:59:26] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-26 09:59:26] [INFO ] Invariant cache hit.
[2026-05-26 09:59:26] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 5/35 places, 3/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 123 ms. Remains : 5/35 places, 3/16 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)||G(F(p1)))))'
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-10
Product exploration explored 100000 steps with 3225 reset in 149 ms.
Product exploration explored 100000 steps with 3225 reset in 175 ms.
Computed a total of 5 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 3
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 44 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 4472 steps (130 resets) in 9 ms. (447 steps per ms) remains 0/4 properties
Knowledge based reduction with 11 factoid took 114 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 260 ms.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2026-05-26 09:59:26] [INFO ] Invariant cache hit.
[2026-05-26 09:59:26] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-26 09:59:26] [INFO ] Invariant cache hit.
[2026-05-26 09:59:26] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2026-05-26 09:59:26] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-26 09:59:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/8 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/8 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 9 constraints, problems are : Problem set: 0 solved, 2 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 77ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 78ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 5/5 places, 3/3 transitions.
Computed a total of 5 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 3
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 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 4880 steps (142 resets) in 7 ms. (610 steps per ms) remains 0/4 properties
Knowledge based reduction with 11 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 231 ms.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3225 reset in 49 ms.
Product exploration explored 100000 steps with 3225 reset in 54 ms.
Built C files in :
/tmp/ltsmin11882603263312375482
[2026-05-26 09:59:27] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2026-05-26 09:59:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:59:27] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2026-05-26 09:59:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:59:27] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2026-05-26 09:59:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:59:27] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11882603263312375482
Running compilation step : cd /tmp/ltsmin11882603263312375482;'/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 59 ms.
Running link step : cd /tmp/ltsmin11882603263312375482;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11882603263312375482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1424917219308718733.hoa' '--buchi-type=spotba'
LTSmin run took 23 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-10-LTLCardinality-10 finished in 1617 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((X(X(G(p0)))||(!p0&&G(p1))))))'
Support contains 4 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 30 transition count 16
Applied a total of 5 rules in 1 ms. Remains 30 /35 variables (removed 5) and now considering 16/16 (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-4730830406035993588.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15888548486296610701.kers'
[2026-05-26 09:59:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4730830406035993588.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15888548486296610701.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 67 entries
Finished phase 1 with 6 SingleSign rule and 10 generalized
[2026-05-26 09:59:27] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15888548486296610701.kers
Total runtime 0 ms.
[2026-05-26 09:59:27] [INFO ] Implicit Places using invariants in 59 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 17, 22, 23]
[2026-05-26 09:59:27] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 15, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 62 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/35 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 23/35 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(G(p0)))||(!p0&&G(p1))))))'
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLCardinality-12 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(!p1))))'
Support contains 3 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 29 transition count 16
Applied a total of 6 rules in 0 ms. Remains 29 /35 variables (removed 6) and now considering 16/16 (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-806904589909214943.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-63167677247164035.kers'
[2026-05-26 09:59:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-806904589909214943.kers, --Pflows, --basisKERS=/tmp/petrispot-output-63167677247164035.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 29 cols 66 entries
Finished phase 1 with 6 SingleSign rule and 10 generalized
[2026-05-26 09:59:28] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-63167677247164035.kers
Total runtime 0 ms.
[2026-05-26 09:59:28] [INFO ] Implicit Places using invariants in 37 ms returned [4, 6, 7, 12, 13, 14, 15, 16, 17, 22, 23]
[2026-05-26 09:59:28] [INFO ] Actually due to overlaps returned [4, 7, 12, 13, 14, 15, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 38 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/35 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 22/35 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLCardinality-13 finished in 194 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 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Graph (complete) has 76 edges and 35 vertex of which 22 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Applied a total of 1 rules in 1 ms. Remains 22 /35 variables (removed 13) and now considering 12/16 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2944912637289245046.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-896419722024267854.kers'
[2026-05-26 09:59:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2944912637289245046.kers, --Pflows, --basisKERS=/tmp/petrispot-output-896419722024267854.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 22 cols 51 entries
Finished phase 1 with 3 SingleSign rule and 9 generalized
[2026-05-26 09:59:28] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-896419722024267854.kers
Total runtime 1 ms.
[2026-05-26 09:59:28] [INFO ] Implicit Places using invariants in 35 ms returned [4, 5, 12, 13, 14, 15, 16, 17]
[2026-05-26 09:59:28] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 15]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 36 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/35 places, 12/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 14 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 8
Applied a total of 5 rules in 2 ms. Remains 12 /16 variables (removed 4) and now considering 8/12 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2194383293954830315.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8889176358473475105.kers'
[2026-05-26 09:59:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2194383293954830315.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8889176358473475105.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 12 cols 25 entries
Finished phase 1 with 5 SingleSign rule and 3 generalized
[2026-05-26 09:59:28] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8889176358473475105.kers
Total runtime 0 ms.
[2026-05-26 09:59:28] [INFO ] Implicit Places using invariants in 24 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/35 places, 8/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 1 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9199964533535937446.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7053223748197081086.kers'
[2026-05-26 09:59:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9199964533535937446.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7053223748197081086.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 8 cols 17 entries
Finished phase 1 with 5 SingleSign rule and 1 generalized
[2026-05-26 09:59:28] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7053223748197081086.kers
Total runtime 0 ms.
[2026-05-26 09:59:28] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-26 09:59:28] [INFO ] Invariant cache hit.
[2026-05-26 09:59:28] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 8/35 places, 6/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 105 ms. Remains : 8/35 places, 6/16 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 34 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-14
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLCardinality-14 finished in 178 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 3 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Graph (complete) has 76 edges and 35 vertex of which 24 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Applied a total of 1 rules in 2 ms. Remains 24 /35 variables (removed 11) and now considering 13/16 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7492708410096193150.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6414951437199901462.kers'
[2026-05-26 09:59:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7492708410096193150.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6414951437199901462.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 13 rows 24 cols 54 entries
Finished phase 1 with 5 SingleSign rule and 8 generalized
[2026-05-26 09:59:28] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6414951437199901462.kers
Total runtime 0 ms.
[2026-05-26 09:59:28] [INFO ] Implicit Places using invariants in 35 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 17]
[2026-05-26 09:59:28] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 15]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 36 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/35 places, 13/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 17 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 16 transition count 11
Applied a total of 4 rules in 1 ms. Remains 16 /18 variables (removed 2) and now considering 11/13 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14970723078770993219.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11649074415407344256.kers'
[2026-05-26 09:59:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14970723078770993219.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11649074415407344256.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 16 cols 34 entries
Finished phase 1 with 9 SingleSign rule and 2 generalized
[2026-05-26 09:59:28] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11649074415407344256.kers
Total runtime 0 ms.
[2026-05-26 09:59:28] [INFO ] Implicit Places using invariants in 32 ms returned [4, 5, 9, 10]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 32 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/35 places, 11/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 12 transition count 6
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 6 transition count 5
Applied a total of 12 rules in 1 ms. Remains 6 /12 variables (removed 6) and now considering 5/11 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18257757340510515133.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8097875774127936006.kers'
[2026-05-26 09:59:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18257757340510515133.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8097875774127936006.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 6 cols 10 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-26 09:59:28] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8097875774127936006.kers
Total runtime 0 ms.
[2026-05-26 09:59:28] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-26 09:59:28] [INFO ] Invariant cache hit.
[2026-05-26 09:59:28] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 6/35 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 103 ms. Remains : 6/35 places, 5/16 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 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-15
Product exploration explored 100000 steps with 3421 reset in 144 ms.
Product exploration explored 100000 steps with 3452 reset in 173 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 5
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 4 factoid took 10 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 30 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-10-LTLCardinality-15 finished in 533 ms.
All properties solved by simple procedures.
Total runtime 44919 ms.

BK_STOP 1779789569288

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-COL-10"
export BK_EXAMINATION="LTLCardinality"
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-COL-10, examination is LTLCardinality"
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-177969914200579"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-10.tgz
mv PermAdmissibility-COL-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;