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.r130-smll-177955809100356.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 FlexibleBarrier-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809100356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 8.4K Mar 7 06:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 7 06:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 7 06:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 7 06:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 10:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 06:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Mar 7 06:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 06:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Mar 7 06:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 94K 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 FlexibleBarrier-PT-10a-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779882423631

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 11:47:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 11:47:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 11:47:06] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2026-05-27 11:47:06] [INFO ] Transformed 123 places.
[2026-05-27 11:47:06] [INFO ] Transformed 334 transitions.
[2026-05-27 11:47:06] [INFO ] Found NUPN structural information;
[2026-05-27 11:47:06] [INFO ] Parsed PT model containing 123 places and 334 transitions and 1467 arcs in 404 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 82 transitions
Reduce redundant transitions removed 82 transitions.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 252/252 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 123 transition count 242
Applied a total of 10 rules in 74 ms. Remains 123 /123 variables (removed 0) and now considering 242/252 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1067778517102146831.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9019448831349694154.kers'
[2026-05-27 11:47:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1067778517102146831.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9019448831349694154.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 242 rows 121 cols 655 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-27 11:47:07] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9019448831349694154.kers
Total runtime 3 ms.
[2026-05-27 11:47:07] [INFO ] Implicit Places using invariants in 554 ms returned []
[2026-05-27 11:47:07] [INFO ] Invariant cache hit.
[2026-05-27 11:47:08] [INFO ] State equation strengthened by 141 read => feed constraints.
[2026-05-27 11:47:08] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1397 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2026-05-27 11:47:08] [INFO ] Invariant cache hit.
[2026-05-27 11:47:08] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 25150 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 23138 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48612ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 48653ms
Starting structural reductions in LTL mode, iteration 1 : 123/123 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50201 ms. Remains : 123/123 places, 242/252 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 10 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2026-05-27 11:47:57] [INFO ] Invariant cache hit.
[2026-05-27 11:47:57] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-27 11:47:57] [INFO ] Invariant cache hit.
[2026-05-27 11:47:57] [INFO ] State equation strengthened by 141 read => feed constraints.
[2026-05-27 11:47:57] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 123/123 places, 242/242 transitions.
Support contains 30 out of 123 places after structural reductions.
[2026-05-27 11:47:58] [INFO ] Flatten gal took : 86 ms
[2026-05-27 11:47:58] [INFO ] Flatten gal took : 44 ms
[2026-05-27 11:47:58] [INFO ] Input system was already deterministic with 242 transitions.
Reduction of identical properties reduced properties to check from 30 to 27
RANDOM walk for 2914 steps (0 resets) in 345 ms. (8 steps per ms) remains 0/27 properties
FORMULA FlexibleBarrier-PT-10a-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(p0)))||G(p1)))))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 9 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2026-05-27 11:47:59] [INFO ] Invariant cache hit.
[2026-05-27 11:47:59] [INFO ] Implicit Places using invariants in 224 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 228 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 247 ms. Remains : 122/123 places, 242/242 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(X(p0)))||G(p1)))))'
Stuttering acceptance computed with spot in 738 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-01 finished in 1113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&G(F(!p0)))))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 100 edges and 123 vertex of which 30 / 123 are part of one of the 10 SCC in 5 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 61 place count 73 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 0 with 45 rules applied. Total rules applied 106 place count 73 transition count 111
Applied a total of 106 rules in 115 ms. Remains 73 /123 variables (removed 50) and now considering 111/242 (removed 131) transitions.
[2026-05-27 11:48:00] [INFO ] Flow matrix only has 92 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17676310154382645718.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1688446340814403245.kers'
[2026-05-27 11:48:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17676310154382645718.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1688446340814403245.kers]
Normalized transition count is 91 out of 92 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 91 rows 71 cols 191 entries
Finished phase 1 with 61 SingleSign rule and 0 generalized
[2026-05-27 11:48:00] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1688446340814403245.kers
Total runtime 1 ms.
[2026-05-27 11:48:00] [INFO ] Implicit Places using invariants in 187 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 189 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/123 places, 111/242 transitions.
Graph (trivial) has 99 edges and 72 vertex of which 30 / 72 are part of one of the 10 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 52 transition count 61
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 42 transition count 61
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 21 place count 42 transition count 52
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 39 place count 33 transition count 52
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 59 place count 23 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 69 place count 23 transition count 32
Applied a total of 69 rules in 21 ms. Remains 23 /72 variables (removed 49) and now considering 32/111 (removed 79) transitions.
[2026-05-27 11:48:00] [INFO ] Flow matrix only has 23 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13346979097638949964.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10671248090634791477.kers'
[2026-05-27 11:48:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13346979097638949964.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10671248090634791477.kers]
Normalized transition count is 22 out of 23 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 22 rows 22 cols 53 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-27 11:48:00] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10671248090634791477.kers
Total runtime 1 ms.
[2026-05-27 11:48:00] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-27 11:48:00] [INFO ] Flow matrix only has 23 transitions (discarded 9 similar events)
[2026-05-27 11:48:00] [INFO ] Invariant cache hit.
[2026-05-27 11:48:00] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-27 11:48:00] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/123 places, 32/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 451 ms. Remains : 23/123 places, 32/242 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&G(F(!p0)))))'
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-02 finished in 545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(F((p1||G(p2))))))&&p0)))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 9 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (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-3632240640934691623.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12690920812772106075.kers'
[2026-05-27 11:48:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3632240640934691623.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12690920812772106075.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 242 rows 121 cols 655 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-27 11:48:00] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12690920812772106075.kers
Total runtime 3 ms.
[2026-05-27 11:48:01] [INFO ] Implicit Places using invariants in 223 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 226 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 10 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 246 ms. Remains : 122/123 places, 242/242 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(F((p1||G(p2))))))&&p0)))'
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-03
Product exploration explored 100000 steps with 2834 reset in 954 ms.
Stack based approach found an accepted trace after 16 steps with 1 reset with depth 9 and stack size 9 in 1 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-03 finished in 1490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0))))&&F(p1)))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 13 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2026-05-27 11:48:02] [INFO ] Invariant cache hit.
[2026-05-27 11:48:02] [INFO ] Implicit Places using invariants in 215 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 216 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 234 ms. Remains : 122/123 places, 242/242 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0))))&&F(p1)))'
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-04
Product exploration explored 100000 steps with 980 reset in 583 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-04 finished in 1123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 98 edges and 123 vertex of which 30 / 123 are part of one of the 10 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 137 edges and 100 vertex of which 98 / 100 are part of one of the 10 SCC in 0 ms
Free SCC test removed 88 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 12 transition count 185
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 179 transitions
Reduce isomorphic transitions removed 179 transitions.
Iterating post reduction 1 with 188 rules applied. Total rules applied 192 place count 3 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 194 place count 3 transition count 3
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 196 place count 2 transition count 3
Applied a total of 196 rules in 14 ms. Remains 2 /123 variables (removed 121) and now considering 3/242 (removed 239) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7589267165327420317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2499771011995906531.kers'
[2026-05-27 11:48:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7589267165327420317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2499771011995906531.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-27 11:48:03] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2499771011995906531.kers
Total runtime 0 ms.
[2026-05-27 11:48:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-27 11:48:03] [INFO ] Invariant cache hit.
[2026-05-27 11:48:03] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2026-05-27 11:48:03] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-27 11:48:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 48 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 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
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 97ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/123 places, 3/242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 2/123 places, 3/242 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 52 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-05 finished in 267 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(p1)||p0)))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (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-9402183529195236447.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8581000441834611503.kers'
[2026-05-27 11:48:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9402183529195236447.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8581000441834611503.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 242 rows 121 cols 655 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-27 11:48:03] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8581000441834611503.kers
Total runtime 2 ms.
[2026-05-27 11:48:04] [INFO ] Implicit Places using invariants in 223 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 224 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 232 ms. Remains : 122/123 places, 242/242 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(p1)||p0)))'
Stuttering acceptance computed with spot in 171 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 940 ms.
Product exploration explored 100000 steps with 50000 reset in 567 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge based reduction with 5 factoid took 74 ms. Proved property starting from automaton with 4 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 84 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-06 finished in 2033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G((p0||G(p1)))&&X(F(p1)))))))'
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2026-05-27 11:48:05] [INFO ] Invariant cache hit.
[2026-05-27 11:48:05] [INFO ] Implicit Places using invariants in 167 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 169 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 178 ms. Remains : 122/123 places, 242/242 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G((p0||G(p1)))&&X(F(p1)))))))'
Stuttering acceptance computed with spot in 320 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-07
Product exploration explored 100000 steps with 536 reset in 300 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 1 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-07 finished in 834 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((G(p1)&&p0)) U !p2)))'
Support contains 7 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2026-05-27 11:48:06] [INFO ] Invariant cache hit.
[2026-05-27 11:48:06] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-27 11:48:06] [INFO ] Invariant cache hit.
[2026-05-27 11:48:06] [INFO ] State equation strengthened by 141 read => feed constraints.
[2026-05-27 11:48:07] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2026-05-27 11:48:07] [INFO ] Invariant cache hit.
[2026-05-27 11:48:07] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 24136 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 23152 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47395ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 47401ms
Finished structural reductions in LTL mode , in 1 iterations and 47863 ms. Remains : 123/123 places, 242/242 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((G(p1)&&p0)) U !p2)))'
Stuttering acceptance computed with spot in 219 ms :[true, p1, (NOT p2), (NOT p2), (AND p1 (NOT p2) p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-08 finished in 48129 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))||((!p1&&(p2 U G(p3))) U X(p4))))'
Support contains 8 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2026-05-27 11:48:54] [INFO ] Invariant cache hit.
[2026-05-27 11:48:54] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-27 11:48:54] [INFO ] Invariant cache hit.
[2026-05-27 11:48:55] [INFO ] State equation strengthened by 141 read => feed constraints.
[2026-05-27 11:48:55] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 554 ms. Remains : 123/123 places, 242/242 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))||((!p1&&(p2 U G(p3))) U X(p4))))'
Stuttering acceptance computed with spot in 906 ms :[(AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p0) (NOT p4)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-10
Product exploration explored 100000 steps with 305 reset in 368 ms.
Stack based approach found an accepted trace after 8757 steps with 18 reset with depth 162 and stack size 161 in 44 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-10 finished in 1975 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 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 93 edges and 123 vertex of which 24 / 123 are part of one of the 8 SCC in 0 ms
Free SCC test removed 16 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 78 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 0 with 58 rules applied. Total rules applied 117 place count 78 transition count 118
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 78 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 77 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 77 transition count 117
Applied a total of 120 rules in 56 ms. Remains 77 /123 variables (removed 46) and now considering 117/242 (removed 125) transitions.
[2026-05-27 11:48:56] [INFO ] Flow matrix only has 100 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5596191929706440747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-165618679445007213.kers'
[2026-05-27 11:48:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5596191929706440747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-165618679445007213.kers]
Normalized transition count is 99 out of 100 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 99 rows 75 cols 211 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-27 11:48:56] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-165618679445007213.kers
Total runtime 1 ms.
[2026-05-27 11:48:56] [INFO ] Implicit Places using invariants in 124 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 125 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/123 places, 117/242 transitions.
Graph (trivial) has 96 edges and 76 vertex of which 21 / 76 are part of one of the 7 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 62 transition count 79
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 52 transition count 79
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 21 place count 52 transition count 69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 41 place count 42 transition count 69
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 30 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 74 place count 30 transition count 48
Applied a total of 74 rules in 15 ms. Remains 30 /76 variables (removed 46) and now considering 48/117 (removed 69) transitions.
[2026-05-27 11:48:56] [INFO ] Flow matrix only has 35 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1345755248576051739.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3624100567076395162.kers'
[2026-05-27 11:48:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1345755248576051739.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3624100567076395162.kers]
Normalized transition count is 34 out of 35 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 34 rows 29 cols 81 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-27 11:48:56] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3624100567076395162.kers
Total runtime 0 ms.
[2026-05-27 11:48:56] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-27 11:48:56] [INFO ] Flow matrix only has 35 transitions (discarded 13 similar events)
[2026-05-27 11:48:56] [INFO ] Invariant cache hit.
[2026-05-27 11:48:57] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-27 11:48:57] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/123 places, 48/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 324 ms. Remains : 30/123 places, 48/242 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-11 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' '!(G(F(p0)))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 98 edges and 123 vertex of which 27 / 123 are part of one of the 9 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 74 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 0 with 53 rules applied. Total rules applied 116 place count 74 transition count 112
Applied a total of 116 rules in 22 ms. Remains 74 /123 variables (removed 49) and now considering 112/242 (removed 130) transitions.
[2026-05-27 11:48:57] [INFO ] Flow matrix only has 94 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12749624791782383166.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-221707164950373756.kers'
[2026-05-27 11:48:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12749624791782383166.kers, --Pflows, --basisKERS=/tmp/petrispot-output-221707164950373756.kers]
Normalized transition count is 93 out of 94 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 93 rows 72 cols 195 entries
Finished phase 1 with 62 SingleSign rule and 0 generalized
[2026-05-27 11:48:57] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-221707164950373756.kers
Total runtime 1 ms.
[2026-05-27 11:48:57] [INFO ] Implicit Places using invariants in 202 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 204 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/123 places, 112/242 transitions.
Graph (trivial) has 98 edges and 73 vertex of which 27 / 73 are part of one of the 9 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 55 transition count 66
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 45 transition count 66
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 21 place count 45 transition count 56
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 41 place count 35 transition count 56
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 63 place count 24 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 73 place count 24 transition count 35
Applied a total of 73 rules in 13 ms. Remains 24 /73 variables (removed 49) and now considering 35/112 (removed 77) transitions.
[2026-05-27 11:48:57] [INFO ] Flow matrix only has 25 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5500808419423467302.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17941563199423328524.kers'
[2026-05-27 11:48:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5500808419423467302.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17941563199423328524.kers]
Normalized transition count is 24 out of 25 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 24 rows 23 cols 57 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-27 11:48:57] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17941563199423328524.kers
Total runtime 0 ms.
[2026-05-27 11:48:57] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-27 11:48:57] [INFO ] Flow matrix only has 25 transitions (discarded 10 similar events)
[2026-05-27 11:48:57] [INFO ] Invariant cache hit.
[2026-05-27 11:48:57] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-27 11:48:57] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/123 places, 35/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 365 ms. Remains : 24/123 places, 35/242 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 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-12 finished in 500 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 U p1) U X(p2)))&&X(F(p0))) U p3)))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (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-8337110369731283920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16624346065947467070.kers'
[2026-05-27 11:48:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8337110369731283920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16624346065947467070.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 242 rows 121 cols 655 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-27 11:48:57] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16624346065947467070.kers
Total runtime 2 ms.
[2026-05-27 11:48:57] [INFO ] Implicit Places using invariants in 227 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 229 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 237 ms. Remains : 122/123 places, 242/242 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 U p1) U X(p2)))&&X(F(p0))) U p3)))'
Stuttering acceptance computed with spot in 462 ms :[(NOT p3), (NOT p2), (NOT p2), (NOT p0), (NOT p3), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-13 finished in 794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X((X(X(!p1)) U ((X(X(!p1))&&p2)||X(X(G(!p1)))))))))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2026-05-27 11:48:58] [INFO ] Invariant cache hit.
[2026-05-27 11:48:58] [INFO ] Implicit Places using invariants in 190 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 204 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 213 ms. Remains : 122/123 places, 242/242 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X((X(X(!p1)) U (X(X(G(!p1)))||(X(X(!p1))&&p2)))))))'
Stuttering acceptance computed with spot in 760 ms :[p1, p1, p1, (AND p1 (NOT p0)), p1, p1, p1, p1, p1, p1, p1, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1), true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-14
Entered a terminal (fully accepting) state of product in 9 steps with 1 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-14 finished in 1105 ms.
All properties solved by simple procedures.
Total runtime 113365 ms.

BK_STOP 1779882539683

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-10a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-10a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-177955809100356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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