Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640602500012.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is FlexibleBarrier-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602500012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 08:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 13 08:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 69K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716415994107

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 22:13:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 22:13:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:13:15] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-22 22:13:15] [INFO ] Transformed 268 places.
[2024-05-22 22:13:15] [INFO ] Transformed 305 transitions.
[2024-05-22 22:13:15] [INFO ] Found NUPN structural information;
[2024-05-22 22:13:15] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 305/305 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 200 transition count 237
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 200 transition count 237
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 161 place count 175 transition count 212
Iterating global reduction 0 with 25 rules applied. Total rules applied 186 place count 175 transition count 212
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 196 place count 165 transition count 202
Iterating global reduction 0 with 10 rules applied. Total rules applied 206 place count 165 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 208 place count 165 transition count 200
Applied a total of 208 rules in 63 ms. Remains 165 /268 variables (removed 103) and now considering 200/305 (removed 105) transitions.
// Phase 1: matrix 200 rows 165 cols
[2024-05-22 22:13:15] [INFO ] Computed 6 invariants in 17 ms
[2024-05-22 22:13:15] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-22 22:13:15] [INFO ] Invariant cache hit.
[2024-05-22 22:13:16] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-05-22 22:13:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 22:13:17] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 12 ms to minimize.
[2024-05-22 22:13:17] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/365 variables, 165/173 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 173 constraints, problems are : Problem set: 0 solved, 199 unsolved in 6407 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/365 variables, 165/173 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 199/372 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 22:13:24] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 2 ms to minimize.
[2024-05-22 22:13:24] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 1 ms to minimize.
[2024-05-22 22:13:24] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-22 22:13:24] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2024-05-22 22:13:25] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-05-22 22:13:25] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 0 ms to minimize.
[2024-05-22 22:13:25] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-22 22:13:25] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 1 ms to minimize.
[2024-05-22 22:13:25] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-05-22 22:13:25] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-22 22:13:26] [INFO ] Deduced a trap composed of 93 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 11/383 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 22:13:27] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 2 ms to minimize.
[2024-05-22 22:13:28] [INFO ] Deduced a trap composed of 96 places in 52 ms of which 1 ms to minimize.
[2024-05-22 22:13:28] [INFO ] Deduced a trap composed of 94 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 3/386 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 22:13:31] [INFO ] Deduced a trap composed of 118 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/365 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 22:13:35] [INFO ] Deduced a trap composed of 94 places in 52 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 22:13:40] [INFO ] Deduced a trap composed of 93 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/365 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 14 (OVERLAPS) 0/365 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 389 constraints, problems are : Problem set: 0 solved, 199 unsolved in 24175 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 19/19 constraints]
After SMT, in 30659ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 30677ms
Starting structural reductions in LTL mode, iteration 1 : 165/268 places, 200/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31170 ms. Remains : 165/268 places, 200/305 transitions.
Support contains 31 out of 165 places after structural reductions.
[2024-05-22 22:13:46] [INFO ] Flatten gal took : 38 ms
[2024-05-22 22:13:47] [INFO ] Flatten gal took : 30 ms
[2024-05-22 22:13:47] [INFO ] Input system was already deterministic with 200 transitions.
RANDOM walk for 40000 steps (943 resets) in 1567 ms. (25 steps per ms) remains 5/30 properties
BEST_FIRST walk for 40004 steps (174 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (174 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (161 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (172 resets) in 121 ms. (327 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (174 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
[2024-05-22 22:13:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 85/165 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 22:13:47] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 200/365 variables, 165/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 172 constraints, problems are : Problem set: 0 solved, 4 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 85/165 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 200/365 variables, 165/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 22:13:48] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-22 22:13:48] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 178 constraints, problems are : Problem set: 0 solved, 4 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 533ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 194 steps, including 3 resets, run visited all 4 properties in 6 ms. (steps per millisecond=32 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 10 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 8 stabilizing places and 8 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Graph (trivial) has 145 edges and 165 vertex of which 20 / 165 are part of one of the 3 SCC in 2 ms
Free SCC test removed 17 places
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 147 transition count 161
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 127 transition count 161
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 41 place count 127 transition count 149
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 115 transition count 149
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 86 place count 94 transition count 128
Iterating global reduction 2 with 21 rules applied. Total rules applied 107 place count 94 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 94 transition count 127
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 108 place count 94 transition count 125
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 92 transition count 125
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 116 place count 88 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 120 place count 88 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 124 place count 88 transition count 117
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 182 place count 59 transition count 88
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 184 place count 57 transition count 86
Iterating global reduction 4 with 2 rules applied. Total rules applied 186 place count 57 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 188 place count 57 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 192 place count 55 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 198 place count 55 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 54 transition count 82
Applied a total of 199 rules in 54 ms. Remains 54 /165 variables (removed 111) and now considering 82/200 (removed 118) transitions.
[2024-05-22 22:13:48] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
// Phase 1: matrix 76 rows 54 cols
[2024-05-22 22:13:48] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 22:13:49] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 22:13:49] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
[2024-05-22 22:13:49] [INFO ] Invariant cache hit.
[2024-05-22 22:13:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 22:13:49] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-22 22:13:49] [INFO ] Redundant transitions in 2 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-22 22:13:49] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
[2024-05-22 22:13:49] [INFO ] Invariant cache hit.
[2024-05-22 22:13:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 75/129 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 1/130 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 61 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1153 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 75/129 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 70/130 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 1/130 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 131 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1154 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 2341ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2343ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/165 places, 82/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2599 ms. Remains : 54/165 places, 82/200 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-00 finished in 2822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 146 transition count 181
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 146 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 146 transition count 180
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 139 transition count 173
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 139 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 57 place count 139 transition count 169
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 137 transition count 167
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 137 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 137 transition count 165
Applied a total of 63 rules in 12 ms. Remains 137 /165 variables (removed 28) and now considering 165/200 (removed 35) transitions.
// Phase 1: matrix 165 rows 137 cols
[2024-05-22 22:13:51] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 22:13:51] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 22:13:51] [INFO ] Invariant cache hit.
[2024-05-22 22:13:51] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-22 22:13:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 165/302 variables, 137/143 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 0/302 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 143 constraints, problems are : Problem set: 0 solved, 164 unsolved in 3158 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 165/302 variables, 137/143 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 164/307 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-22 22:13:56] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-22 22:13:56] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-05-22 22:13:56] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-05-22 22:13:57] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-05-22 22:13:57] [INFO ] Deduced a trap composed of 84 places in 49 ms of which 1 ms to minimize.
[2024-05-22 22:13:57] [INFO ] Deduced a trap composed of 84 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 6/313 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-22 22:13:58] [INFO ] Deduced a trap composed of 87 places in 37 ms of which 1 ms to minimize.
[2024-05-22 22:13:58] [INFO ] Deduced a trap composed of 84 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 315 constraints, problems are : Problem set: 0 solved, 164 unsolved in 8294 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 8/8 constraints]
After SMT, in 11476ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 11478ms
Starting structural reductions in LTL mode, iteration 1 : 137/165 places, 165/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11643 ms. Remains : 137/165 places, 165/200 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 201 ms.
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-04b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-02 finished in 12088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 147 transition count 182
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 147 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 147 transition count 181
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 141 transition count 175
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 141 transition count 175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 52 place count 141 transition count 172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 139 transition count 170
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 139 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 139 transition count 168
Applied a total of 58 rules in 7 ms. Remains 139 /165 variables (removed 26) and now considering 168/200 (removed 32) transitions.
// Phase 1: matrix 168 rows 139 cols
[2024-05-22 22:14:03] [INFO ] Computed 6 invariants in 4 ms
[2024-05-22 22:14:03] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 22:14:03] [INFO ] Invariant cache hit.
[2024-05-22 22:14:03] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-22 22:14:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 168/307 variables, 139/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 0/307 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 145 constraints, problems are : Problem set: 0 solved, 167 unsolved in 3264 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 168/307 variables, 139/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 167/312 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-22 22:14:08] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-22 22:14:08] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-22 22:14:08] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-05-22 22:14:09] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-22 22:14:09] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 4 ms to minimize.
[2024-05-22 22:14:09] [INFO ] Deduced a trap composed of 88 places in 37 ms of which 1 ms to minimize.
[2024-05-22 22:14:09] [INFO ] Deduced a trap composed of 84 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 7/319 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/307 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 319 constraints, problems are : Problem set: 0 solved, 167 unsolved in 6347 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 7/7 constraints]
After SMT, in 9643ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 9645ms
Starting structural reductions in LTL mode, iteration 1 : 139/165 places, 168/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9793 ms. Remains : 139/165 places, 168/200 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-04b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-03 finished in 10109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U (G(p0)||(p0&&(p1 U (G(p1)||(p1&&G(p2)))))))&&(p1||G(p2))) U !p2))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Graph (trivial) has 147 edges and 165 vertex of which 26 / 165 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 142 transition count 158
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 124 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 123 transition count 157
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 39 place count 123 transition count 145
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 63 place count 111 transition count 145
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 85 place count 89 transition count 123
Iterating global reduction 3 with 22 rules applied. Total rules applied 107 place count 89 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 89 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 108 place count 89 transition count 121
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 110 place count 88 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 86 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 86 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 86 transition count 117
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 166 place count 61 transition count 92
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 169 place count 58 transition count 89
Iterating global reduction 5 with 3 rules applied. Total rules applied 172 place count 58 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 175 place count 58 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 179 place count 58 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 181 place count 56 transition count 80
Applied a total of 181 rules in 33 ms. Remains 56 /165 variables (removed 109) and now considering 80/200 (removed 120) transitions.
[2024-05-22 22:14:13] [INFO ] Flow matrix only has 73 transitions (discarded 7 similar events)
// Phase 1: matrix 73 rows 56 cols
[2024-05-22 22:14:13] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 22:14:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 22:14:13] [INFO ] Flow matrix only has 73 transitions (discarded 7 similar events)
[2024-05-22 22:14:13] [INFO ] Invariant cache hit.
[2024-05-22 22:14:14] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-22 22:14:14] [INFO ] Redundant transitions in 2 ms returned []
Running 49 sub problems to find dead transitions.
[2024-05-22 22:14:14] [INFO ] Flow matrix only has 73 transitions (discarded 7 similar events)
[2024-05-22 22:14:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 72/128 variables, 56/62 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/129 variables, and 62 constraints, problems are : Problem set: 0 solved, 49 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 72/128 variables, 56/62 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 49/111 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/129 variables, and 111 constraints, problems are : Problem set: 0 solved, 49 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 1137ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1138ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/165 places, 80/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1268 ms. Remains : 56/165 places, 80/200 transitions.
Stuttering acceptance computed with spot in 324 ms :[p2, true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-04 finished in 1619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Graph (trivial) has 148 edges and 165 vertex of which 26 / 165 are part of one of the 4 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 142 transition count 157
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 123 transition count 157
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 39 place count 123 transition count 146
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 61 place count 112 transition count 146
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 82 place count 91 transition count 125
Iterating global reduction 2 with 21 rules applied. Total rules applied 103 place count 91 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 91 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 104 place count 91 transition count 123
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 106 place count 90 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 109 place count 87 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 112 place count 87 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 114 place count 87 transition count 118
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 166 place count 61 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 168 place count 59 transition count 90
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 59 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 172 place count 59 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 176 place count 59 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 178 place count 57 transition count 82
Applied a total of 178 rules in 27 ms. Remains 57 /165 variables (removed 108) and now considering 82/200 (removed 118) transitions.
[2024-05-22 22:14:15] [INFO ] Flow matrix only has 75 transitions (discarded 7 similar events)
// Phase 1: matrix 75 rows 57 cols
[2024-05-22 22:14:15] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 22:14:15] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 22:14:15] [INFO ] Flow matrix only has 75 transitions (discarded 7 similar events)
[2024-05-22 22:14:15] [INFO ] Invariant cache hit.
[2024-05-22 22:14:15] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-22 22:14:15] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2024-05-22 22:14:15] [INFO ] Flow matrix only has 75 transitions (discarded 7 similar events)
[2024-05-22 22:14:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 4/57 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 74/131 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/132 variables, and 63 constraints, problems are : Problem set: 0 solved, 50 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 4/57 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 74/131 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 50/113 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/132 variables, and 113 constraints, problems are : Problem set: 0 solved, 50 unsolved in 565 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 1143ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1143ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/165 places, 82/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1266 ms. Remains : 57/165 places, 82/200 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-05 finished in 1382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F((p1&&X(p2)&&(p3 U (p4||G(p3))))))))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 148 transition count 183
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 148 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 148 transition count 182
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 143 transition count 177
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 143 transition count 177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 143 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 142 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 142 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 142 transition count 172
Applied a total of 51 rules in 9 ms. Remains 142 /165 variables (removed 23) and now considering 172/200 (removed 28) transitions.
// Phase 1: matrix 172 rows 142 cols
[2024-05-22 22:14:16] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 22:14:16] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 22:14:16] [INFO ] Invariant cache hit.
[2024-05-22 22:14:17] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-05-22 22:14:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 172/314 variables, 142/148 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 0/314 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 148 constraints, problems are : Problem set: 0 solved, 171 unsolved in 3391 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 172/314 variables, 142/148 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 171/319 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-22 22:14:21] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-22 22:14:22] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-05-22 22:14:22] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2024-05-22 22:14:22] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-05-22 22:14:22] [INFO ] Deduced a trap composed of 87 places in 47 ms of which 1 ms to minimize.
[2024-05-22 22:14:22] [INFO ] Deduced a trap composed of 86 places in 36 ms of which 0 ms to minimize.
[2024-05-22 22:14:22] [INFO ] Deduced a trap composed of 89 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 7/326 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-22 22:14:24] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 327 constraints, problems are : Problem set: 0 solved, 171 unsolved in 8131 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 8/8 constraints]
After SMT, in 11543ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 11546ms
Starting structural reductions in LTL mode, iteration 1 : 142/165 places, 172/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11692 ms. Remains : 142/165 places, 172/200 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (AND (NOT p3) (NOT p4))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-06
Product exploration explored 100000 steps with 2282 reset in 145 ms.
Product exploration explored 100000 steps with 2269 reset in 179 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1 p4 p3 p2), (X p2), (X p3), (X p4), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p3) (NOT p2))))), (X (NOT (OR (AND p1 p4 (NOT p2)) (AND p1 p3 (NOT p2))))), (X (NOT (AND p1 (NOT p4) p3 (NOT p2)))), (X (OR (AND p1 p4) (AND p1 p3))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (NOT (AND p1 (NOT p4) p3))), (X (NOT (AND (NOT p4) p3))), (X (NOT (OR (NOT p1) (AND (NOT p4) (NOT p3))))), (X p1), (X (X p2)), (X (X p3)), (X (X p4)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p3) (NOT p2)))))), (X (X (NOT (OR (AND p1 p4 (NOT p2)) (AND p1 p3 (NOT p2)))))), (X (X (NOT (AND p1 (NOT p4) p3 (NOT p2))))), (X (X (OR (AND p1 p4) (AND p1 p3)))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (NOT (AND p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (OR (NOT p1) (AND (NOT p4) (NOT p3)))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 142 ms. Reduced automaton from 4 states, 12 edges and 5 AP (stutter sensitive) to 4 states, 12 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (AND (NOT p3) (NOT p4))]
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (903 resets) in 486 ms. (82 steps per ms) remains 3/15 properties
BEST_FIRST walk for 40003 steps (168 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (158 resets) in 180 ms. (221 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (173 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
[2024-05-22 22:14:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 62/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 76/142 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 172/314 variables, 142/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/314 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 148 constraints, problems are : Problem set: 0 solved, 3 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf8 is UNSAT
Problem apf15 is UNSAT
After SMT solving in domain Int declared 66/314 variables, and 2 constraints, problems are : Problem set: 3 solved, 0 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 2/6 constraints, State Equation: 0/142 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 131ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p4 p3 p2), (X p2), (X p3), (X p4), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p3) (NOT p2))))), (X (NOT (OR (AND p1 p4 (NOT p2)) (AND p1 p3 (NOT p2))))), (X (NOT (AND p1 (NOT p4) p3 (NOT p2)))), (X (OR (AND p1 p4) (AND p1 p3))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (NOT (AND p1 (NOT p4) p3))), (X (NOT (AND (NOT p4) p3))), (X (NOT (OR (NOT p1) (AND (NOT p4) (NOT p3))))), (X p1), (X (X p2)), (X (X p3)), (X (X p4)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p3) (NOT p2)))))), (X (X (NOT (OR (AND p1 p4 (NOT p2)) (AND p1 p3 (NOT p2)))))), (X (X (NOT (AND p1 (NOT p4) p3 (NOT p2))))), (X (X (OR (AND p1 p4) (AND p1 p3)))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (NOT (AND p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (OR (NOT p1) (AND (NOT p4) (NOT p3)))))), (X (X p1)), (G (OR (NOT p1) p4 (NOT p3) p0)), (G (AND (OR (NOT p1) (NOT p4) p0) (OR (NOT p1) (NOT p3) p0))), (G (AND (OR p1 p2) (OR p4 p3 p2)))]
False Knowledge obtained : [(F (NOT (OR p4 (NOT p3)))), (F (NOT (AND (OR (NOT p1) (NOT p4) p2) (OR (NOT p1) (NOT p3) p2)))), (F (NOT (OR (NOT p1) p4 (NOT p3) p2))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p1) p4 (NOT p3)))), (F (NOT (AND p1 (OR p4 p3)))), (F (NOT (AND (OR p1 p0) (OR p4 p3 p0)))), (F (NOT p2)), (F (NOT p4)), (F (NOT p3)), (F (NOT (OR p4 p3))), (F (NOT (OR (AND p1 p4) (AND p1 p3))))]
Knowledge based reduction with 28 factoid took 768 ms. Reduced automaton from 4 states, 12 edges and 5 AP (stutter sensitive) to 4 states, 9 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (AND (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (AND (NOT p3) (NOT p4))]
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 172/172 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-05-22 22:14:31] [INFO ] Invariant cache hit.
[2024-05-22 22:14:31] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 22:14:31] [INFO ] Invariant cache hit.
[2024-05-22 22:14:31] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-05-22 22:14:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 172/314 variables, 142/148 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 0/314 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 148 constraints, problems are : Problem set: 0 solved, 171 unsolved in 3367 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 172/314 variables, 142/148 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 171/319 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-22 22:14:35] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-22 22:14:36] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-22 22:14:36] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2024-05-22 22:14:36] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-22 22:14:36] [INFO ] Deduced a trap composed of 87 places in 42 ms of which 1 ms to minimize.
[2024-05-22 22:14:36] [INFO ] Deduced a trap composed of 86 places in 37 ms of which 2 ms to minimize.
[2024-05-22 22:14:37] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 7/326 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-22 22:14:38] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 327 constraints, problems are : Problem set: 0 solved, 171 unsolved in 7947 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 8/8 constraints]
After SMT, in 11337ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 11340ms
Finished structural reductions in LTL mode , in 1 iterations and 11479 ms. Remains : 142/142 places, 172/172 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1 p3 p4 p2), (X (NOT (OR (NOT p1) (AND (NOT p3) (NOT p4))))), (X p3), (X (OR (AND p1 p3) (AND p1 p4))), (X p4), (X p1), (X (NOT (AND p1 p3 (NOT p4)))), (X (X (NOT (OR (NOT p1) (AND (NOT p3) (NOT p4)))))), (X (X p3)), (X (X (OR (AND p1 p3) (AND p1 p4)))), (X (X p2)), (X (X p4)), (X (X (NOT (AND (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X p1)), (X (X (NOT (AND p1 p3 (NOT p4)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 132 ms. Reduced automaton from 4 states, 9 edges and 5 AP (stutter sensitive) to 4 states, 9 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (AND (NOT p3) (NOT p4))]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 35612 steps (793 resets) in 100 ms. (352 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 p1 p3 p4 p2), (X (NOT (OR (NOT p1) (AND (NOT p3) (NOT p4))))), (X p3), (X (OR (AND p1 p3) (AND p1 p4))), (X p4), (X p1), (X (NOT (AND p1 p3 (NOT p4)))), (X (X (NOT (OR (NOT p1) (AND (NOT p3) (NOT p4)))))), (X (X p3)), (X (X (OR (AND p1 p3) (AND p1 p4)))), (X (X p2)), (X (X p4)), (X (X (NOT (AND (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X p1)), (X (X (NOT (AND p1 p3 (NOT p4)))))]
False Knowledge obtained : [(F (NOT p4)), (F (NOT p2)), (F (NOT (OR p3 p4))), (F (NOT (OR p4 p2))), (F (NOT (AND p1 (OR p3 p4)))), (F (NOT (OR (AND p1 p3) (AND p1 p4)))), (F (NOT p3)), (F (NOT (OR (NOT p3) p4))), (F (NOT (OR (NOT p1) (NOT p3) p4))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 438 ms. Reduced automaton from 4 states, 9 edges and 5 AP (stutter sensitive) to 4 states, 9 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (AND (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (AND (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (AND (NOT p3) (NOT p4))]
Product exploration explored 100000 steps with 2269 reset in 85 ms.
Product exploration explored 100000 steps with 2272 reset in 92 ms.
Built C files in :
/tmp/ltsmin2244069752663528081
[2024-05-22 22:14:44] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2244069752663528081
Running compilation step : cd /tmp/ltsmin2244069752663528081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 376 ms.
Running link step : cd /tmp/ltsmin2244069752663528081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2244069752663528081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13334227600718225577.hoa' '--buchi-type=spotba'
LTSmin run took 1945 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-06 finished in 29876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (F(p1)&&X(X(G(p2))))))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Graph (trivial) has 148 edges and 165 vertex of which 26 / 165 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 142 transition count 156
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 122 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 41 place count 122 transition count 144
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 110 transition count 144
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 85 place count 90 transition count 124
Iterating global reduction 2 with 20 rules applied. Total rules applied 105 place count 90 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 90 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 88 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 88 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 88 transition count 119
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 166 place count 61 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 168 place count 59 transition count 90
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 59 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 172 place count 59 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 176 place count 59 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 178 place count 57 transition count 82
Applied a total of 178 rules in 16 ms. Remains 57 /165 variables (removed 108) and now considering 82/200 (removed 118) transitions.
[2024-05-22 22:14:46] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
// Phase 1: matrix 76 rows 57 cols
[2024-05-22 22:14:46] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 22:14:46] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 22:14:46] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
[2024-05-22 22:14:46] [INFO ] Invariant cache hit.
[2024-05-22 22:14:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 22:14:46] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-22 22:14:46] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2024-05-22 22:14:46] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
[2024-05-22 22:14:46] [INFO ] Invariant cache hit.
[2024-05-22 22:14:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 4/57 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 75/132 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/133 variables, and 64 constraints, problems are : Problem set: 0 solved, 50 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 4/57 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 75/132 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 50/114 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/133 variables, and 114 constraints, problems are : Problem set: 0 solved, 50 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 1233ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1233ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/165 places, 82/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1339 ms. Remains : 57/165 places, 82/200 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-07 finished in 1660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Graph (trivial) has 148 edges and 165 vertex of which 26 / 165 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 142 transition count 156
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 122 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 41 place count 122 transition count 144
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 110 transition count 144
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 88 place count 87 transition count 121
Iterating global reduction 2 with 23 rules applied. Total rules applied 111 place count 87 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 87 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 115 place count 84 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 84 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 121 place count 84 transition count 114
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 173 place count 58 transition count 88
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 176 place count 55 transition count 85
Iterating global reduction 4 with 3 rules applied. Total rules applied 179 place count 55 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 182 place count 55 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 186 place count 55 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 188 place count 53 transition count 76
Applied a total of 188 rules in 18 ms. Remains 53 /165 variables (removed 112) and now considering 76/200 (removed 124) transitions.
[2024-05-22 22:14:48] [INFO ] Flow matrix only has 70 transitions (discarded 6 similar events)
// Phase 1: matrix 70 rows 53 cols
[2024-05-22 22:14:48] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 22:14:48] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 22:14:48] [INFO ] Flow matrix only has 70 transitions (discarded 6 similar events)
[2024-05-22 22:14:48] [INFO ] Invariant cache hit.
[2024-05-22 22:14:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 22:14:48] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-22 22:14:48] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-22 22:14:48] [INFO ] Flow matrix only has 70 transitions (discarded 6 similar events)
[2024-05-22 22:14:48] [INFO ] Invariant cache hit.
[2024-05-22 22:14:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 5/53 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 69/122 variables, 53/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/123 variables, and 60 constraints, problems are : Problem set: 0 solved, 46 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 5/53 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 69/122 variables, 53/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 46/106 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/123 variables, and 106 constraints, problems are : Problem set: 0 solved, 46 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 1133ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1133ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/165 places, 76/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1249 ms. Remains : 53/165 places, 76/200 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-08 finished in 1294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Graph (trivial) has 150 edges and 165 vertex of which 26 / 165 are part of one of the 4 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 142 transition count 156
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 122 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 41 place count 122 transition count 144
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 110 transition count 144
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 87 place count 88 transition count 122
Iterating global reduction 2 with 22 rules applied. Total rules applied 109 place count 88 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 88 transition count 121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 110 place count 88 transition count 120
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 112 place count 87 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 85 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 85 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 85 transition count 116
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 170 place count 59 transition count 90
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 173 place count 56 transition count 87
Iterating global reduction 4 with 3 rules applied. Total rules applied 176 place count 56 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 179 place count 56 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 183 place count 56 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 185 place count 54 transition count 78
Applied a total of 185 rules in 23 ms. Remains 54 /165 variables (removed 111) and now considering 78/200 (removed 122) transitions.
[2024-05-22 22:14:49] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
// Phase 1: matrix 71 rows 54 cols
[2024-05-22 22:14:49] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 22:14:49] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 22:14:49] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
[2024-05-22 22:14:49] [INFO ] Invariant cache hit.
[2024-05-22 22:14:49] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-22 22:14:49] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-22 22:14:49] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
[2024-05-22 22:14:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 4/54 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 70/124 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 0/124 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/125 variables, and 60 constraints, problems are : Problem set: 0 solved, 47 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 4/54 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 70/124 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 47/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/124 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/125 variables, and 107 constraints, problems are : Problem set: 0 solved, 47 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 1044ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1044ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/165 places, 78/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1173 ms. Remains : 54/165 places, 78/200 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-09
Stuttering criterion allowed to conclude after 2855 steps with 253 reset in 20 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-09 finished in 1244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))&&p0))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 149 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 149 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 149 transition count 183
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 143 transition count 177
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 143 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 143 transition count 173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 141 transition count 171
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 141 transition count 171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 141 transition count 169
Applied a total of 55 rules in 5 ms. Remains 141 /165 variables (removed 24) and now considering 169/200 (removed 31) transitions.
// Phase 1: matrix 169 rows 141 cols
[2024-05-22 22:14:50] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 22:14:51] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 22:14:51] [INFO ] Invariant cache hit.
[2024-05-22 22:14:51] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-22 22:14:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-22 22:14:52] [INFO ] Deduced a trap composed of 49 places in 33 ms of which 0 ms to minimize.
[2024-05-22 22:14:52] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/310 variables, 141/149 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/310 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 149 constraints, problems are : Problem set: 0 solved, 168 unsolved in 4195 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/310 variables, 141/149 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 168/317 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-22 22:14:56] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 6 ms to minimize.
[2024-05-22 22:14:56] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-22 22:14:57] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-05-22 22:14:57] [INFO ] Deduced a trap composed of 89 places in 40 ms of which 1 ms to minimize.
[2024-05-22 22:14:57] [INFO ] Deduced a trap composed of 86 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 5/322 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 322 constraints, problems are : Problem set: 0 solved, 168 unsolved in 6086 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 7/7 constraints]
After SMT, in 10301ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 10303ms
Starting structural reductions in LTL mode, iteration 1 : 141/165 places, 169/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10477 ms. Remains : 141/165 places, 169/200 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-10
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-10 finished in 10718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p1))&&G(p2))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 147 transition count 182
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 147 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 147 transition count 181
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 140 transition count 174
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 140 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 140 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 139 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 139 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 139 transition count 168
Applied a total of 58 rules in 4 ms. Remains 139 /165 variables (removed 26) and now considering 168/200 (removed 32) transitions.
// Phase 1: matrix 168 rows 139 cols
[2024-05-22 22:15:01] [INFO ] Computed 6 invariants in 7 ms
[2024-05-22 22:15:01] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 22:15:01] [INFO ] Invariant cache hit.
[2024-05-22 22:15:01] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-22 22:15:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 168/307 variables, 139/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 0/307 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 145 constraints, problems are : Problem set: 0 solved, 167 unsolved in 3167 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 168/307 variables, 139/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 167/312 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-22 22:15:06] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-22 22:15:06] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-22 22:15:06] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 0 ms to minimize.
[2024-05-22 22:15:07] [INFO ] Deduced a trap composed of 84 places in 45 ms of which 1 ms to minimize.
[2024-05-22 22:15:07] [INFO ] Deduced a trap composed of 85 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-22 22:15:08] [INFO ] Deduced a trap composed of 49 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-22 22:15:10] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/307 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (OVERLAPS) 0/307 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 319 constraints, problems are : Problem set: 0 solved, 167 unsolved in 10845 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 7/7 constraints]
After SMT, in 14033ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 14035ms
Starting structural reductions in LTL mode, iteration 1 : 139/165 places, 168/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14172 ms. Remains : 139/165 places, 168/200 transitions.
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-11 finished in 14562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||G(p1))))))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 147 transition count 182
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 147 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 147 transition count 181
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 140 transition count 174
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 140 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 140 transition count 170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 138 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 138 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 138 transition count 166
Applied a total of 61 rules in 10 ms. Remains 138 /165 variables (removed 27) and now considering 166/200 (removed 34) transitions.
// Phase 1: matrix 166 rows 138 cols
[2024-05-22 22:15:16] [INFO ] Computed 6 invariants in 4 ms
[2024-05-22 22:15:16] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 22:15:16] [INFO ] Invariant cache hit.
[2024-05-22 22:15:16] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-22 22:15:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 166/304 variables, 138/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 0/304 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 144 constraints, problems are : Problem set: 0 solved, 165 unsolved in 3360 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 166/304 variables, 138/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 165/309 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-22 22:15:21] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-22 22:15:21] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-05-22 22:15:21] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-22 22:15:21] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-05-22 22:15:21] [INFO ] Deduced a trap composed of 84 places in 46 ms of which 1 ms to minimize.
[2024-05-22 22:15:22] [INFO ] Deduced a trap composed of 87 places in 43 ms of which 1 ms to minimize.
[2024-05-22 22:15:22] [INFO ] Deduced a trap composed of 84 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 7/316 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 316 constraints, problems are : Problem set: 0 solved, 165 unsolved in 6460 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 7/7 constraints]
After SMT, in 9852ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 9853ms
Starting structural reductions in LTL mode, iteration 1 : 138/165 places, 166/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10043 ms. Remains : 138/165 places, 166/200 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-14 finished in 10305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||(p1&&G((G(F(p2)) U p2))))))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 148 transition count 183
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 148 transition count 183
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 142 transition count 177
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 142 transition count 177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 142 transition count 174
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 140 transition count 172
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 140 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 140 transition count 170
Applied a total of 55 rules in 4 ms. Remains 140 /165 variables (removed 25) and now considering 170/200 (removed 30) transitions.
// Phase 1: matrix 170 rows 140 cols
[2024-05-22 22:15:26] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 22:15:26] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 22:15:26] [INFO ] Invariant cache hit.
[2024-05-22 22:15:26] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-22 22:15:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (OVERLAPS) 170/310 variables, 140/146 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 0/310 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 146 constraints, problems are : Problem set: 0 solved, 169 unsolved in 3338 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (OVERLAPS) 170/310 variables, 140/146 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 169/315 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-22 22:15:31] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2024-05-22 22:15:31] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-22 22:15:31] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-22 22:15:31] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-22 22:15:32] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-05-22 22:15:32] [INFO ] Deduced a trap composed of 86 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 6/321 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-22 22:15:33] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-22 22:15:33] [INFO ] Deduced a trap composed of 89 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-22 22:15:35] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 324 constraints, problems are : Problem set: 0 solved, 169 unsolved in 9923 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 9/9 constraints]
After SMT, in 13280ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 13281ms
Starting structural reductions in LTL mode, iteration 1 : 140/165 places, 170/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13408 ms. Remains : 140/165 places, 170/200 transitions.
Stuttering acceptance computed with spot in 359 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-15
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-15 finished in 13792 ms.
All properties solved by simple procedures.
Total runtime 145039 ms.

BK_STOP 1716416140381

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-04b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640602500012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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