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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 748K
-rw-r--r-- 1 mcc users 6.4K Mar 7 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 06:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 06:56 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 3.6K Mar 15 10:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Mar 7 07:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 07:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 7 07:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 7 07:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:15 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 321K 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-20a-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779924518956

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-20a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 23:28:41] [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 23:28:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 23:28:41] [INFO ] Load time of PNML (sax parser for PT used): 272 ms
[2026-05-27 23:28:41] [INFO ] Transformed 243 places.
[2026-05-27 23:28:41] [INFO ] Transformed 1064 transitions.
[2026-05-27 23:28:41] [INFO ] Found NUPN structural information;
[2026-05-27 23:28:41] [INFO ] Parsed PT model containing 243 places and 1064 transitions and 5317 arcs in 506 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 362 transitions
Reduce redundant transitions removed 362 transitions.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 702/702 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 243 transition count 682
Applied a total of 20 rules in 101 ms. Remains 243 /243 variables (removed 0) and now considering 682/702 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1085404205296057379.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17181879971936637627.kers'
[2026-05-27 23:28:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1085404205296057379.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17181879971936637627.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 682 rows 241 cols 2105 entries
Finished phase 1 with 221 SingleSign rule and 0 generalized
[2026-05-27 23:28:42] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17181879971936637627.kers
Total runtime 6 ms.
[2026-05-27 23:28:43] [INFO ] Implicit Places using invariants in 708 ms returned []
[2026-05-27 23:28:43] [INFO ] Invariant cache hit.
[2026-05-27 23:28:43] [INFO ] State equation strengthened by 481 read => feed constraints.
[2026-05-27 23:28:44] [INFO ] Implicit Places using invariants and state equation in 1213 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2026-05-27 23:28:44] [INFO ] Invariant cache hit.
[2026-05-27 23:28:44] [INFO ] State equation strengthened by 481 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 22/264 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 243/925 variables, and 265 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30078 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/243 constraints, ReadFeed: 0/481 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 22/264 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/925 variables, 243/508 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/925 variables, 481/989 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 681/1670 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 925/925 variables, and 1670 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30035 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 243/243 constraints, ReadFeed: 481/481 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61048ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 61082ms
Starting structural reductions in LTL mode, iteration 1 : 243/243 places, 682/702 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63247 ms. Remains : 243/243 places, 682/702 transitions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 8 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2026-05-27 23:29:45] [INFO ] Invariant cache hit.
[2026-05-27 23:29:45] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-27 23:29:45] [INFO ] Invariant cache hit.
[2026-05-27 23:29:46] [INFO ] State equation strengthened by 481 read => feed constraints.
[2026-05-27 23:29:46] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1208 ms. Remains : 243/243 places, 682/682 transitions.
Support contains 44 out of 243 places after structural reductions.
[2026-05-27 23:29:47] [INFO ] Flatten gal took : 103 ms
[2026-05-27 23:29:47] [INFO ] Flatten gal took : 58 ms
[2026-05-27 23:29:47] [INFO ] Input system was already deterministic with 682 transitions.
Support contains 43 out of 243 places (down from 44) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (8 resets) in 3100 ms. (12 steps per ms) remains 1/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
[2026-05-27 23:29:48] [INFO ] Invariant cache hit.
[2026-05-27 23:29:48] [INFO ] State equation strengthened by 481 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/51 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 192/243 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 192/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 682/925 variables, 243/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 481/989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/925 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/925 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 925/925 variables, and 989 constraints, problems are : Problem set: 0 solved, 1 unsolved in 447 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 243/243 constraints, ReadFeed: 481/481 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/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/51 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 192/243 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 192/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 682/925 variables, 243/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 481/989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/925 variables, 1/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/925 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/925 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 925/925 variables, and 990 constraints, problems are : Problem set: 0 solved, 1 unsolved in 489 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 243/243 constraints, ReadFeed: 481/481 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 954ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 8 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FlexibleBarrier-PT-20a-LTLFireability-01 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' '!((G(p0) U X((G(p1)&&(F((G(F(!p2))||(p0&&F(!p2)))) U p2)))))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2026-05-27 23:29:49] [INFO ] Invariant cache hit.
[2026-05-27 23:29:50] [INFO ] Implicit Places using invariants in 350 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 352 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 5 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 365 ms. Remains : 242/243 places, 682/682 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((G(p1)&&(F((G(F(!p2))||(p0&&F(!p2)))) U p2)))))'
Stuttering acceptance computed with spot in 734 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), p2, (NOT p2), p2, (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 453 steps with 0 reset in 28 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-02 finished in 1279 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) U (X(p1)&&G(!p2)))))'
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 23 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2026-05-27 23:29:51] [INFO ] Invariant cache hit.
[2026-05-27 23:29:51] [INFO ] Implicit Places using invariants in 244 ms returned []
[2026-05-27 23:29:51] [INFO ] Invariant cache hit.
[2026-05-27 23:29:51] [INFO ] State equation strengthened by 481 read => feed constraints.
[2026-05-27 23:29:52] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1089 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1113 ms. Remains : 243/243 places, 682/682 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) U (X(p1)&&G(!p2)))))'
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p1) p2), (NOT p0), (OR (NOT p1) p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), p2]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-03
Product exploration explored 100000 steps with 1676 reset in 1504 ms.
Stack based approach found an accepted trace after 57 steps with 3 reset with depth 6 and stack size 6 in 1 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-03 finished in 3011 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 U (p1||G(!p0))))))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 190 edges and 243 vertex of which 48 / 243 are part of one of the 16 SCC in 4 ms
Free SCC test removed 32 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 121 place count 151 transition count 485
Drop transitions (Redundant composition of simpler transitions.) removed 244 transitions
Redundant transition composition rules discarded 244 transitions
Iterating global reduction 0 with 244 rules applied. Total rules applied 365 place count 151 transition count 241
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 367 place count 151 transition count 241
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 369 place count 149 transition count 239
Iterating global reduction 0 with 2 rules applied. Total rules applied 371 place count 149 transition count 239
Applied a total of 371 rules in 157 ms. Remains 149 /243 variables (removed 94) and now considering 239/682 (removed 443) transitions.
[2026-05-27 23:29:54] [INFO ] Flow matrix only has 204 transitions (discarded 35 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14263146734560289874.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2499523660317382864.kers'
[2026-05-27 23:29:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14263146734560289874.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2499523660317382864.kers]
Normalized transition count is 203 out of 204 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 203 rows 147 cols 449 entries
Finished phase 1 with 127 SingleSign rule and 0 generalized
[2026-05-27 23:29:54] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2499523660317382864.kers
Total runtime 3 ms.
[2026-05-27 23:29:54] [INFO ] Implicit Places using invariants in 221 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 225 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/243 places, 239/682 transitions.
Graph (trivial) has 196 edges and 148 vertex of which 48 / 148 are part of one of the 16 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 116 transition count 155
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 96 transition count 155
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 41 place count 96 transition count 135
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 81 place count 76 transition count 135
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 129 place count 52 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 149 place count 52 transition count 91
Applied a total of 149 rules in 33 ms. Remains 52 /148 variables (removed 96) and now considering 91/239 (removed 148) transitions.
[2026-05-27 23:29:54] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14819608255014859870.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8253735067929262541.kers'
[2026-05-27 23:29:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14819608255014859870.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8253735067929262541.kers]
Normalized transition count is 67 out of 68 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 67 rows 51 cols 177 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-27 23:29:54] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8253735067929262541.kers
Total runtime 1 ms.
[2026-05-27 23:29:54] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-27 23:29:54] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2026-05-27 23:29:54] [INFO ] Invariant cache hit.
[2026-05-27 23:29:54] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-27 23:29:54] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/243 places, 91/682 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 588 ms. Remains : 52/243 places, 91/682 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 U (G(!p0)||p1)))))'
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-04
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-04 finished in 737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 190 edges and 243 vertex of which 48 / 243 are part of one of the 16 SCC in 3 ms
Free SCC test removed 32 places
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 121 place count 151 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 232 transitions
Redundant transition composition rules discarded 232 transitions
Iterating global reduction 0 with 232 rules applied. Total rules applied 353 place count 151 transition count 238
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 355 place count 151 transition count 238
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 357 place count 149 transition count 236
Iterating global reduction 0 with 2 rules applied. Total rules applied 359 place count 149 transition count 236
Applied a total of 359 rules in 109 ms. Remains 149 /243 variables (removed 94) and now considering 236/682 (removed 446) transitions.
[2026-05-27 23:29:54] [INFO ] Flow matrix only has 201 transitions (discarded 35 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1716219171667545367.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1705334990414128708.kers'
[2026-05-27 23:29:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1716219171667545367.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1705334990414128708.kers]
Normalized transition count is 200 out of 201 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 200 rows 147 cols 437 entries
Finished phase 1 with 127 SingleSign rule and 0 generalized
[2026-05-27 23:29:54] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1705334990414128708.kers
Total runtime 3 ms.
[2026-05-27 23:29:55] [INFO ] Implicit Places using invariants in 251 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 253 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/243 places, 236/682 transitions.
Graph (trivial) has 196 edges and 148 vertex of which 48 / 148 are part of one of the 16 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 116 transition count 152
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 96 transition count 152
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 41 place count 96 transition count 132
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 81 place count 76 transition count 132
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 129 place count 52 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 149 place count 52 transition count 88
Applied a total of 149 rules in 22 ms. Remains 52 /148 variables (removed 96) and now considering 88/236 (removed 148) transitions.
[2026-05-27 23:29:55] [INFO ] Flow matrix only has 65 transitions (discarded 23 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-243425146533486471.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3588578442399776481.kers'
[2026-05-27 23:29:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-243425146533486471.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3588578442399776481.kers]
Normalized transition count is 64 out of 65 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 64 rows 51 cols 165 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-27 23:29:55] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3588578442399776481.kers
Total runtime 1 ms.
[2026-05-27 23:29:55] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-27 23:29:55] [INFO ] Flow matrix only has 65 transitions (discarded 23 similar events)
[2026-05-27 23:29:55] [INFO ] Invariant cache hit.
[2026-05-27 23:29:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-27 23:29:55] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/243 places, 88/682 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 581 ms. Remains : 52/243 places, 88/682 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-05 finished in 741 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(p1)))||X(X(X(G(p0)))))))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 22 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (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-4887444764220933273.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12622438626730591233.kers'
[2026-05-27 23:29:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4887444764220933273.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12622438626730591233.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 682 rows 241 cols 2105 entries
Finished phase 1 with 221 SingleSign rule and 0 generalized
[2026-05-27 23:29:55] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12622438626730591233.kers
Total runtime 5 ms.
[2026-05-27 23:29:55] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-27 23:29:55] [INFO ] Invariant cache hit.
[2026-05-27 23:29:56] [INFO ] State equation strengthened by 481 read => feed constraints.
[2026-05-27 23:29:56] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1111 ms. Remains : 243/243 places, 682/682 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(p1)))||X(X(X(G(p0)))))))'
Stuttering acceptance computed with spot in 465 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-06
Product exploration explored 100000 steps with 1859 reset in 1400 ms.
Stack based approach found an accepted trace after 11899 steps with 248 reset with depth 333 and stack size 329 in 167 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-06 finished in 3191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1||X(X((p2||F(G(p1))))))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2026-05-27 23:29:58] [INFO ] Invariant cache hit.
[2026-05-27 23:29:59] [INFO ] Implicit Places using invariants in 501 ms returned [241]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 503 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 510 ms. Remains : 242/243 places, 682/682 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (X(X((p1||F(G(p2)))))||p2)))'
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-07
Product exploration explored 100000 steps with 129 reset in 879 ms.
Stack based approach found an accepted trace after 162 steps with 0 reset with depth 163 and stack size 163 in 2 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-07 finished in 1717 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)))&&(X(F(p1))||(p2 U (p3||G(p2)))))))'
Support contains 9 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2026-05-27 23:30:00] [INFO ] Invariant cache hit.
[2026-05-27 23:30:00] [INFO ] Implicit Places using invariants in 254 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 256 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 2 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 261 ms. Remains : 242/243 places, 682/682 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)))&&(X(F(p1))||(p2 U (p3||G(p2)))))))'
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-08
Product exploration explored 100000 steps with 2137 reset in 963 ms.
Stack based approach found an accepted trace after 132 steps with 1 reset with depth 121 and stack size 121 in 2 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-08 finished in 1584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (G(!p1) U X(p2))))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 9 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2026-05-27 23:30:01] [INFO ] Invariant cache hit.
[2026-05-27 23:30:02] [INFO ] Implicit Places using invariants in 380 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 382 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 2 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 394 ms. Remains : 242/243 places, 682/682 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (G(!p1) U X(p2))))'
Stuttering acceptance computed with spot in 408 ms :[(NOT p2), (NOT p2), (AND p1 p0 (NOT p2)), (NOT p2), (NOT p2), (AND p0 (NOT p2)), true, p0, p1, (AND p0 p1)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 220 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-09 finished in 873 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(p0))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2026-05-27 23:30:02] [INFO ] Invariant cache hit.
[2026-05-27 23:30:03] [INFO ] Implicit Places using invariants in 237 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 238 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 244 ms. Remains : 242/243 places, 682/682 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(p0))))'
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-12 finished in 417 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 (F(p2)&&p1)) U (p3 U X(p4))))'
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2026-05-27 23:30:03] [INFO ] Invariant cache hit.
[2026-05-27 23:30:03] [INFO ] Implicit Places using invariants in 246 ms returned []
[2026-05-27 23:30:03] [INFO ] Invariant cache hit.
[2026-05-27 23:30:03] [INFO ] State equation strengthened by 481 read => feed constraints.
[2026-05-27 23:30:04] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1076 ms. Remains : 243/243 places, 682/682 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 (F(p2)&&p1)) U (p3 U X(p4))))'
Stuttering acceptance computed with spot in 458 ms :[(NOT p4), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4)) (AND (NOT p2) (NOT p4))), (NOT p4), (AND (NOT p2) (NOT p4)), (AND (NOT p0) (NOT p4)), true, (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p4), (NOT p4)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 271 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-13 finished in 1613 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)))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2026-05-27 23:30:04] [INFO ] Invariant cache hit.
[2026-05-27 23:30:05] [INFO ] Implicit Places using invariants in 346 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 348 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 353 ms. Remains : 242/243 places, 682/682 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)))))'
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-14
Product exploration explored 100000 steps with 13 reset in 876 ms.
Stack based approach found an accepted trace after 105 steps with 0 reset with depth 106 and stack size 106 in 3 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-14 finished in 1481 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))'
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 197 edges and 243 vertex of which 57 / 243 are part of one of the 19 SCC in 1 ms
Free SCC test removed 38 places
Ensure Unique test removed 191 transitions
Reduce isomorphic transitions removed 191 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 279 edges and 202 vertex of which 195 / 202 are part of one of the 21 SCC in 0 ms
Free SCC test removed 174 places
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 4 rules applied. Total rules applied 5 place count 28 transition count 489
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 475 transitions
Reduce isomorphic transitions removed 475 transitions.
Graph (trivial) has 10 edges and 8 vertex of which 2 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 497 rules applied. Total rules applied 502 place count 7 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 504 place count 6 transition count 12
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 505 place count 5 transition count 10
Iterating global reduction 3 with 1 rules applied. Total rules applied 506 place count 5 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 3 with 2 rules applied. Total rules applied 508 place count 5 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 510 place count 4 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 511 place count 3 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 514 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 515 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 516 place count 2 transition count 3
Applied a total of 516 rules in 12 ms. Remains 2 /243 variables (removed 241) and now considering 3/682 (removed 679) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14963385628077240058.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13498477865620071997.kers'
[2026-05-27 23:30:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14963385628077240058.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13498477865620071997.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 23:30:06] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13498477865620071997.kers
Total runtime 0 ms.
[2026-05-27 23:30:06] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-27 23:30:06] [INFO ] Invariant cache hit.
[2026-05-27 23:30:06] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2026-05-27 23:30:06] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-27 23:30:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[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, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[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 64ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 64ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/243 places, 3/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 2/243 places, 3/682 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))'
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-15 finished in 187 ms.
All properties solved by simple procedures.
Total runtime 85206 ms.

BK_STOP 1779924606586

--------------------
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-20a"
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-20a, 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-177955809100436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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