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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.5K Mar 7 06:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 7 06:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 7 06:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 7 06:14 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.7K Mar 15 10:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 06:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Mar 7 06:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 7 06:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Mar 7 06:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:11 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 64K 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-08a-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779874140512

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-27 09:29:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 09:29:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 09:29:03] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2026-05-27 09:29:03] [INFO ] Transformed 99 places.
[2026-05-27 09:29:03] [INFO ] Transformed 236 transitions.
[2026-05-27 09:29:03] [INFO ] Found NUPN structural information;
[2026-05-27 09:29:03] [INFO ] Parsed PT model containing 99 places and 236 transitions and 985 arcs in 346 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 50 transitions
Reduce redundant transitions removed 50 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 186/186 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 99 transition count 178
Applied a total of 8 rules in 34 ms. Remains 99 /99 variables (removed 0) and now considering 178/186 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5125727609720850930.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15475927886845970830.kers'
[2026-05-27 09:29:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5125727609720850930.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15475927886845970830.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 178 rows 97 cols 461 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-27 09:29:03] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15475927886845970830.kers
Total runtime 3 ms.
[2026-05-27 09:29:04] [INFO ] Implicit Places using invariants in 524 ms returned [97, 98]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 582 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/99 places, 178/186 transitions.
Applied a total of 0 rules in 7 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 646 ms. Remains : 97/99 places, 178/186 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 7 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (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-5191421931832312028.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16319887754682573654.kers'
[2026-05-27 09:29:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5191421931832312028.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16319887754682573654.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 178 rows 97 cols 461 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-27 09:29:04] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16319887754682573654.kers
Total runtime 1 ms.
[2026-05-27 09:29:04] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-27 09:29:04] [INFO ] Invariant cache hit.
[2026-05-27 09:29:04] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2026-05-27 09:29:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/275 variables, 97/202 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 202 constraints, problems are : Problem set: 0 solved, 177 unsolved in 11419 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/275 variables, 97/202 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 177/379 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/275 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 379 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9568 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21178ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 21202ms
Finished structural reductions in LTL mode , in 1 iterations and 21551 ms. Remains : 97/97 places, 178/178 transitions.
Support contains 23 out of 97 places after structural reductions.
[2026-05-27 09:29:26] [INFO ] Flatten gal took : 111 ms
[2026-05-27 09:29:26] [INFO ] Flatten gal took : 34 ms
[2026-05-27 09:29:26] [INFO ] Input system was already deterministic with 178 transitions.
Support contains 21 out of 97 places (down from 23) after GAL structural reductions.
RANDOM walk for 4386 steps (0 resets) in 218 ms. (20 steps per ms) remains 0/14 properties
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 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' '!(F(G(p0)))'
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 120 edges and 97 vertex of which 81 / 97 are part of one of the 11 SCC in 3 ms
Free SCC test removed 70 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Graph (trivial) has 25 edges and 21 vertex of which 4 / 21 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 19 transition count 38
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 53 place count 17 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 15 transition count 31
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 13 transition count 27
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 13 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 63 place count 13 transition count 23
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 67 place count 11 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 69 place count 9 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 80 place count 9 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 82 place count 9 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 84 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 84 place count 7 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 86 place count 6 transition count 7
Applied a total of 86 rules in 29 ms. Remains 6 /97 variables (removed 91) and now considering 7/178 (removed 171) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9010498026831461951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1582200599863030142.kers'
[2026-05-27 09:29:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9010498026831461951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1582200599863030142.kers]
Normalized transition count is 6 out of 7 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 6 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-27 09:29:26] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1582200599863030142.kers
Total runtime 0 ms.
[2026-05-27 09:29:26] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-27 09:29:26] [INFO ] Invariant cache hit.
[2026-05-27 09:29:26] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2026-05-27 09:29:26] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-27 09:29:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 145ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 146ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/97 places, 7/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 6/97 places, 7/178 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 198 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-00 finished in 555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 115 edges and 97 vertex of which 72 / 97 are part of one of the 10 SCC in 2 ms
Free SCC test removed 62 places
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 35 transition count 82
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 29 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 27 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 27 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 21 place count 27 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 25 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 27 place count 23 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 67 place count 23 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 68 place count 23 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 22 transition count 31
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 71 place count 20 transition count 29
Iterating global reduction 6 with 2 rules applied. Total rules applied 73 place count 20 transition count 29
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 75 place count 20 transition count 29
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 77 place count 18 transition count 27
Iterating global reduction 6 with 2 rules applied. Total rules applied 79 place count 18 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 81 place count 18 transition count 25
Applied a total of 81 rules in 27 ms. Remains 18 /97 variables (removed 79) and now considering 25/178 (removed 153) transitions.
[2026-05-27 09:29:27] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3672128910117269134.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14536269312964091305.kers'
[2026-05-27 09:29:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3672128910117269134.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14536269312964091305.kers]
Normalized transition count is 19 out of 20 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 19 rows 17 cols 46 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-27 09:29:27] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14536269312964091305.kers
Total runtime 0 ms.
[2026-05-27 09:29:27] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-27 09:29:27] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
[2026-05-27 09:29:27] [INFO ] Invariant cache hit.
[2026-05-27 09:29:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-27 09:29:27] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2026-05-27 09:29:27] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2026-05-27 09:29:27] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
[2026-05-27 09:29:27] [INFO ] Invariant cache hit.
[2026-05-27 09:29:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 19/37 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 25 constraints, problems are : Problem set: 0 solved, 24 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 19/37 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 24/48 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 1/38 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 49 constraints, problems are : Problem set: 0 solved, 24 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1046ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 1046ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/97 places, 25/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1145 ms. Remains : 18/97 places, 25/178 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-03
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-03 finished in 1271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (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-6164095209111316111.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7602273917258460173.kers'
[2026-05-27 09:29:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6164095209111316111.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7602273917258460173.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 178 rows 97 cols 461 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-27 09:29:28] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7602273917258460173.kers
Total runtime 1 ms.
[2026-05-27 09:29:28] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-27 09:29:28] [INFO ] Invariant cache hit.
[2026-05-27 09:29:28] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2026-05-27 09:29:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/275 variables, 97/202 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 202 constraints, problems are : Problem set: 0 solved, 177 unsolved in 10619 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/275 variables, 97/202 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 177/379 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/275 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 379 constraints, problems are : Problem set: 0 solved, 177 unsolved in 11269 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21934ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 21936ms
Finished structural reductions in LTL mode , in 1 iterations and 22148 ms. Remains : 97/97 places, 178/178 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 686 ms.
Product exploration explored 100000 steps with 33333 reset in 283 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 19 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 28 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-04 finished in 23341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(((p1 U p2)&&X(X(X(F(p0)))))))))'
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2026-05-27 09:29:51] [INFO ] Invariant cache hit.
[2026-05-27 09:29:51] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-27 09:29:51] [INFO ] Invariant cache hit.
[2026-05-27 09:29:52] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 97/97 places, 178/178 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(((p1 U p2)&&X(X(X(F(p0)))))))))'
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-06 finished in 649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((!p0 U (p1||G(!p0)))))||(p0&&F(G(p2))))))'
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 6 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2026-05-27 09:29:52] [INFO ] Invariant cache hit.
[2026-05-27 09:29:52] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-27 09:29:52] [INFO ] Invariant cache hit.
[2026-05-27 09:29:52] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 97/97 places, 178/178 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((!p0 U (p1||G(!p0)))))||(F(G(p2))&&p0))))'
Stuttering acceptance computed with spot in 290 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 168 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 1 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-11 finished in 747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 125 edges and 97 vertex of which 92 / 97 are part of one of the 8 SCC in 0 ms
Free SCC test removed 84 places
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 5 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 4 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 44 place count 4 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 3 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 48 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 2 transition count 3
Applied a total of 50 rules in 4 ms. Remains 2 /97 variables (removed 95) and now considering 3/178 (removed 175) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1458753473610758455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2211533801662396705.kers'
[2026-05-27 09:29:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1458753473610758455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2211533801662396705.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 09:29:53] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2211533801662396705.kers
Total runtime 0 ms.
[2026-05-27 09:29:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-27 09:29:53] [INFO ] Invariant cache hit.
[2026-05-27 09:29:53] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-27 09:29:53] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-27 09:29:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 66ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/97 places, 3/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 2/97 places, 3/178 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-12 finished in 226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 123 edges and 97 vertex of which 90 / 97 are part of one of the 8 SCC in 1 ms
Free SCC test removed 82 places
Ensure Unique test removed 131 transitions
Reduce isomorphic transitions removed 131 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 7 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 6 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 6 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 50 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 4 transition count 5
Applied a total of 52 rules in 4 ms. Remains 4 /97 variables (removed 93) and now considering 5/178 (removed 173) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8752344557479109137.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1076764026390131637.kers'
[2026-05-27 09:29:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8752344557479109137.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1076764026390131637.kers]
Normalized transition count is 4 out of 5 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-27 09:29:53] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1076764026390131637.kers
Total runtime 0 ms.
[2026-05-27 09:29:53] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-27 09:29:53] [INFO ] Invariant cache hit.
[2026-05-27 09:29:53] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2026-05-27 09:29:53] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-27 09:29:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 10 constraints, problems are : Problem set: 0 solved, 2 unsolved in 50 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 12 constraints, problems are : Problem set: 0 solved, 2 unsolved in 40 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 93ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 93ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/97 places, 5/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 4/97 places, 5/178 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-13
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-13 finished in 268 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 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 123 edges and 97 vertex of which 88 / 97 are part of one of the 10 SCC in 0 ms
Free SCC test removed 78 places
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 12 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 10 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 9 transition count 16
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 9 transition count 16
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 2 with 2 rules applied. Total rules applied 47 place count 9 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 8 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 50 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 55 place count 7 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 57 place count 6 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 57 place count 6 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 61 place count 4 transition count 5
Applied a total of 61 rules in 5 ms. Remains 4 /97 variables (removed 93) and now considering 5/178 (removed 173) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17106244198043147410.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11110946488218855632.kers'
[2026-05-27 09:29:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17106244198043147410.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11110946488218855632.kers]
Normalized transition count is 4 out of 5 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-27 09:29:53] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11110946488218855632.kers
Total runtime 0 ms.
[2026-05-27 09:29:53] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-27 09:29:53] [INFO ] Invariant cache hit.
[2026-05-27 09:29:53] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2026-05-27 09:29:53] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/97 places, 5/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58 ms. Remains : 4/97 places, 5/178 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 43 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-14 finished in 125 ms.
All properties solved by simple procedures.
Total runtime 50963 ms.

BK_STOP 1779874193954

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ 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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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