Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102400403.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is FlexibleBarrier-PT-04a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102400403
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 23K May 29 14:32 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-04a-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748917197002

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-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-03 02:19:59] [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]
[2025-06-03 02:19:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 02:19:59] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2025-06-03 02:19:59] [INFO ] Transformed 51 places.
[2025-06-03 02:19:59] [INFO ] Transformed 88 transitions.
[2025-06-03 02:19:59] [INFO ] Found NUPN structural information;
[2025-06-03 02:19:59] [INFO ] Parsed PT model containing 51 places and 88 transitions and 309 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 78/78 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 74
Applied a total of 4 rules in 23 ms. Remains 51 /51 variables (removed 0) and now considering 74/78 (removed 4) transitions.
// Phase 1: matrix 74 rows 51 cols
[2025-06-03 02:19:59] [INFO ] Computed 6 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:00] [INFO ] Implicit Places using invariants in 273 ms returned []
[2025-06-03 02:20:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:00] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-03 02:20:00] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2025-06-03 02:20:00] [INFO ] Invariant cache hit.
[2025-06-03 02:20:00] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/125 variables, 51/108 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 33/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 141 constraints, problems are : Problem set: 0 solved, 73 unsolved in 3263 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/125 variables, 51/108 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 33/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 214 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2750 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6073ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 6087ms
Starting structural reductions in LTL mode, iteration 1 : 51/51 places, 74/78 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6670 ms. Remains : 51/51 places, 74/78 transitions.
Support contains 26 out of 51 places after structural reductions.
[2025-06-03 02:20:06] [INFO ] Flatten gal took : 34 ms
[2025-06-03 02:20:06] [INFO ] Flatten gal took : 16 ms
[2025-06-03 02:20:06] [INFO ] Input system was already deterministic with 74 transitions.
RANDOM walk for 1822 steps (0 resets) in 205 ms. (8 steps per ms) remains 0/19 properties
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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 34 edges and 51 vertex of which 6 / 51 are part of one of the 2 SCC in 3 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 54 edges and 44 vertex of which 30 / 44 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 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 5 rules applied. Total rules applied 6 place count 20 transition count 66
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Graph (trivial) has 20 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 51 place count 14 transition count 26
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 55 place count 12 transition count 24
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 10 transition count 20
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 10 transition count 20
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 10 transition count 16
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 8 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 69 place count 6 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 76 place count 6 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 78 place count 6 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 80 place count 4 transition count 5
Applied a total of 80 rules in 27 ms. Remains 4 /51 variables (removed 47) and now considering 5/74 (removed 69) transitions.
// Phase 1: matrix 5 rows 4 cols
[2025-06-03 02:20:07] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:07] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-03 02:20:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:07] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:20:07] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2025-06-03 02:20:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 40 ms.
Refiners :[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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 61 ms.
Refiners :[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 105ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/51 places, 5/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 4/51 places, 5/74 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-00 finished in 604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 35 edges and 51 vertex of which 9 / 51 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 35 transition count 57
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 29 place count 35 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 35 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 34 transition count 48
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 34 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 33 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 33 transition count 47
Applied a total of 35 rules in 26 ms. Remains 33 /51 variables (removed 18) and now considering 47/74 (removed 27) transitions.
[2025-06-03 02:20:07] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 33 cols
[2025-06-03 02:20:07] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:07] [INFO ] Implicit Places using invariants in 81 ms returned [31, 32]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 83 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/51 places, 47/74 transitions.
Graph (trivial) has 40 edges and 31 vertex of which 20 / 31 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 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 2 rules applied. Total rules applied 3 place count 15 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 12 transition count 18
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 9 place count 10 transition count 15
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 10 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 13 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 14 place count 9 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 15 place count 9 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 16 place count 9 transition count 12
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 17 place count 8 transition count 11
Iterating global reduction 5 with 1 rules applied. Total rules applied 18 place count 8 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 19 place count 8 transition count 10
Applied a total of 19 rules in 6 ms. Remains 8 /31 variables (removed 23) and now considering 10/47 (removed 37) transitions.
[2025-06-03 02:20:07] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 8 cols
[2025-06-03 02:20:07] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:07] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-03 02:20:07] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2025-06-03 02:20:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 02:20:07] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/51 places, 10/74 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 170 ms. Remains : 8/51 places, 10/74 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-01
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-01 finished in 234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2025-06-03 02:20:07] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:07] [INFO ] Implicit Places using invariants in 87 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-02 finished in 240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2025-06-03 02:20:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:08] [INFO ] Implicit Places using invariants in 73 ms returned [49, 50]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 75 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 49/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 393 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-04a-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-05 finished in 671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(p1))))'
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2025-06-03 02:20:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:08] [INFO ] Implicit Places using invariants in 74 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-06
Product exploration explored 100000 steps with 33333 reset in 424 ms.
Product exploration explored 100000 steps with 33333 reset in 274 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 28 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-06 finished in 1002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((G(F(p0)) U p1)&&F(p2))) U p3))'
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 31 edges and 51 vertex of which 6 / 51 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 38 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 26 place count 38 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 26 place count 38 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 37 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 37 transition count 52
Applied a total of 29 rules in 16 ms. Remains 37 /51 variables (removed 14) and now considering 52/74 (removed 22) transitions.
[2025-06-03 02:20:09] [INFO ] Flow matrix only has 47 transitions (discarded 5 similar events)
// Phase 1: matrix 47 rows 37 cols
[2025-06-03 02:20:09] [INFO ] Computed 6 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:09] [INFO ] Implicit Places using invariants in 78 ms returned [35, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/51 places, 52/74 transitions.
Graph (trivial) has 36 edges and 35 vertex of which 16 / 35 are part of one of the 4 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 23 transition count 33
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 22 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 21 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 21 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 20 transition count 31
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 9 place count 18 transition count 28
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 18 transition count 28
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 13 place count 18 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 14 place count 17 transition count 26
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 15 place count 16 transition count 24
Iterating global reduction 5 with 1 rules applied. Total rules applied 16 place count 16 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 17 place count 16 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 18 place count 16 transition count 22
Applied a total of 18 rules in 10 ms. Remains 16 /35 variables (removed 19) and now considering 22/52 (removed 30) transitions.
[2025-06-03 02:20:09] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 16 cols
[2025-06-03 02:20:09] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:09] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-03 02:20:09] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2025-06-03 02:20:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 02:20:10] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/51 places, 22/74 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 16/51 places, 22/74 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p3), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-07 finished in 454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1)))&&X(p2)))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2025-06-03 02:20:10] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:10] [INFO ] Implicit Places using invariants in 105 ms returned [49, 50]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 107 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 49/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-08
Product exploration explored 100000 steps with 1676 reset in 181 ms.
Stack based approach found an accepted trace after 65 steps with 7 reset with depth 18 and stack size 18 in 1 ms.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-08 finished in 492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 37 edges and 51 vertex of which 9 / 51 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 55 edges and 42 vertex of which 35 / 42 are part of one of the 5 SCC in 1 ms
Free SCC test removed 30 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 12 transition count 65
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 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 57 rules applied. Total rules applied 62 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 64 place count 6 transition count 12
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 5 transition count 10
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 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 68 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 70 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 71 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 74 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 75 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 76 place count 2 transition count 3
Applied a total of 76 rules in 4 ms. Remains 2 /51 variables (removed 49) and now considering 3/74 (removed 71) transitions.
// Phase 1: matrix 3 rows 2 cols
[2025-06-03 02:20:10] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:10] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-03 02:20:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:10] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:20:10] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2025-06-03 02:20:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 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]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 49 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 81ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/51 places, 3/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 2/51 places, 3/74 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-09 finished in 219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G((p0&&X(p1))) U (p2&&X(p3)))))))'
Support contains 7 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2025-06-03 02:20:10] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:11] [INFO ] Implicit Places using invariants in 68 ms returned [49, 50]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 49/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-12
Product exploration explored 100000 steps with 20000 reset in 114 ms.
Product exploration explored 100000 steps with 20000 reset in 126 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 p1 p3)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (8 resets) in 476 ms. (83 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
// Phase 1: matrix 74 rows 49 cols
[2025-06-03 02:20:12] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 42/49 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 74/123 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 82 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 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
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf9 is UNSAT
After SMT solving in domain Int declared 49/123 variables, and 11 constraints, problems are : Problem set: 1 solved, 0 unsolved in 45 ms.
Refiners :[Domain max(s): 7/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/49 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1 p3), (G (OR (NOT p0) (NOT p1) p2 p3))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p2))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (AND (OR p0 p3) (OR p1 p3)))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p3)))]
Knowledge based reduction with 2 factoid took 431 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Support contains 7 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2025-06-03 02:20:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:13] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-03 02:20:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:13] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2025-06-03 02:20:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/123 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 102 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2349 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/123 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 73/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 175 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2115 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4488ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 4496ms
Finished structural reductions in LTL mode , in 1 iterations and 4616 ms. Remains : 49/49 places, 74/74 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2 p1 p3)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 2532 steps (0 resets) in 21 ms. (115 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 p2 p1 p3)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT p3)), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT (AND (OR p0 p3) (OR p1 p3)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND p0 p1))), (F (NOT p2)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p2))), (F (NOT p1)), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 1 factoid took 456 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 20000 reset in 179 ms.
Product exploration explored 100000 steps with 20000 reset in 197 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Support contains 7 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 74/74 transitions.
Graph (trivial) has 46 edges and 49 vertex of which 29 / 49 are part of one of the 5 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 25 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 25 transition count 43
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 25 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 24 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 24 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 24 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 24 transition count 41
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 23 transition count 40
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 23 transition count 40
Deduced a syphon composed of 6 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 22 place count 23 transition count 31
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 22 rules in 7 ms. Remains 23 /49 variables (removed 26) and now considering 31/74 (removed 43) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:20:21] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2025-06-03 02:20:21] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
// Phase 1: matrix 28 rows 23 cols
[2025-06-03 02:20:21] [INFO ] Computed 4 invariants in 1 ms
[2025-06-03 02:20:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:21] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 12 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:21] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:21] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:21] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 4/8 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 27/50 variables, 23/31 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/31 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 1/51 variables, 1/32 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/32 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/32 constraints. Problems are: Problem set: 7 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 32 constraints, problems are : Problem set: 7 solved, 23 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 7/23 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 4/8 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 27/50 variables, 23/31 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 23/54 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/54 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 1/51 variables, 1/55 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/55 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/51 variables, 0/55 constraints. Problems are: Problem set: 7 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 55 constraints, problems are : Problem set: 7 solved, 23 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/30 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1406ms problems are : Problem set: 7 solved, 23 unsolved
Search for dead transitions found 7 dead transitions in 1407ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 23/49 places, 24/74 transitions.
Graph (complete) has 27 edges and 23 vertex of which 17 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 17 /23 variables (removed 6) and now considering 24/24 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/49 places, 24/74 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1423 ms. Remains : 17/49 places, 24/74 transitions.
Built C files in :
/tmp/ltsmin5114027766844368622
[2025-06-03 02:20:22] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5114027766844368622
Running compilation step : cd /tmp/ltsmin5114027766844368622;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 433 ms.
Running link step : cd /tmp/ltsmin5114027766844368622;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin5114027766844368622;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1314420407867276808.hoa' '--buchi-type=spotba'
LTSmin run took 2134 ms.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-12 finished in 14460 ms.
All properties solved by simple procedures.
Total runtime 26315 ms.

BK_STOP 1748917225488

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-04a"
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-5832"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-04a, 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 r086-smll-174860102400403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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