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.r496-tall-171640602500011.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 ltsminxred
Input is FlexibleBarrier-PT-04b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602500011
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-04b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-04b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-04b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-04b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-04b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-04b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-04b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-04b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-04b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-04b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-04b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-04b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-04b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-04b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-04b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717181802159

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:56:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 18:56:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:56:43] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-31 18:56:43] [INFO ] Transformed 268 places.
[2024-05-31 18:56:43] [INFO ] Transformed 305 transitions.
[2024-05-31 18:56:43] [INFO ] Found NUPN structural information;
[2024-05-31 18:56:43] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-04b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 305/305 transitions.
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 76 place count 192 transition count 229
Iterating global reduction 0 with 76 rules applied. Total rules applied 152 place count 192 transition count 229
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 174 place count 170 transition count 207
Iterating global reduction 0 with 22 rules applied. Total rules applied 196 place count 170 transition count 207
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 205 place count 161 transition count 198
Iterating global reduction 0 with 9 rules applied. Total rules applied 214 place count 161 transition count 198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 217 place count 161 transition count 195
Applied a total of 217 rules in 66 ms. Remains 161 /268 variables (removed 107) and now considering 195/305 (removed 110) transitions.
// Phase 1: matrix 195 rows 161 cols
[2024-05-31 18:56:43] [INFO ] Computed 6 invariants in 17 ms
[2024-05-31 18:56:44] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-31 18:56:44] [INFO ] Invariant cache hit.
[2024-05-31 18:56:44] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-31 18:56:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-31 18:56:45] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 22 ms to minimize.
[2024-05-31 18:56:46] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-05-31 18:56:46] [INFO ] Deduced a trap composed of 113 places in 151 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/356 variables, 161/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 0/356 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 170 constraints, problems are : Problem set: 0 solved, 194 unsolved in 6616 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/356 variables, 161/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 194/364 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-31 18:56:52] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-31 18:56:52] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-31 18:56:53] [INFO ] Deduced a trap composed of 119 places in 64 ms of which 1 ms to minimize.
[2024-05-31 18:56:53] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 2 ms to minimize.
[2024-05-31 18:56:53] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 2 ms to minimize.
[2024-05-31 18:56:53] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2024-05-31 18:56:54] [INFO ] Deduced a trap composed of 92 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-31 18:56:55] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-31 18:56:55] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-31 18:56:55] [INFO ] Deduced a trap composed of 113 places in 62 ms of which 2 ms to minimize.
[2024-05-31 18:56:55] [INFO ] Deduced a trap composed of 115 places in 50 ms of which 1 ms to minimize.
[2024-05-31 18:56:55] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-05-31 18:56:56] [INFO ] Deduced a trap composed of 68 places in 47 ms of which 1 ms to minimize.
[2024-05-31 18:56:56] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-31 18:56:57] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/356 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 379 constraints, problems are : Problem set: 0 solved, 194 unsolved in 14142 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 18/18 constraints]
After SMT, in 20846ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 20867ms
Starting structural reductions in LTL mode, iteration 1 : 161/268 places, 195/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21352 ms. Remains : 161/268 places, 195/305 transitions.
Support contains 23 out of 161 places after structural reductions.
[2024-05-31 18:57:05] [INFO ] Flatten gal took : 41 ms
[2024-05-31 18:57:05] [INFO ] Flatten gal took : 15 ms
[2024-05-31 18:57:05] [INFO ] Input system was already deterministic with 195 transitions.
RANDOM walk for 40000 steps (935 resets) in 1304 ms. (30 steps per ms) remains 2/14 properties
BEST_FIRST walk for 40004 steps (174 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (200 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
[2024-05-31 18:57:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 120/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/161 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 195/356 variables, 161/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/356 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 167 constraints, problems are : Problem set: 0 solved, 2 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 120/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:57:06] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
Problem AtomicPropp10 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 35/161 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 18:57:06] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-05-31 18:57:06] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-31 18:57:06] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 2 ms to minimize.
[2024-05-31 18:57:06] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-05-31 18:57:06] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-31 18:57:06] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-31 18:57:06] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-31 18:57:06] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 195/356 variables, 161/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 1/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 18:57:06] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 1/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/356 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 178 constraints, problems are : Problem set: 1 solved, 1 unsolved in 622 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 767ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 10 ms.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA FlexibleBarrier-PT-04b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 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' '!(X((G(p0)&&F(p1))))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 195/195 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 149 transition count 183
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 149 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 149 transition count 181
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 143 transition count 175
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 143 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 143 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 142 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 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 42 place count 142 transition count 172
Applied a total of 42 rules in 21 ms. Remains 142 /161 variables (removed 19) and now considering 172/195 (removed 23) transitions.
// Phase 1: matrix 172 rows 142 cols
[2024-05-31 18:57:06] [INFO ] Computed 6 invariants in 2 ms
[2024-05-31 18:57:06] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 18:57:06] [INFO ] Invariant cache hit.
[2024-05-31 18:57:06] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-05-31 18:57:06] [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 3403 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-31 18:57:11] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 2 ms to minimize.
[2024-05-31 18:57:11] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-31 18:57:12] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-31 18:57:12] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-05-31 18:57:12] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 1 ms to minimize.
[2024-05-31 18:57:12] [INFO ] Deduced a trap composed of 89 places in 48 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 6/325 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/314 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 325 constraints, problems are : Problem set: 0 solved, 171 unsolved in 7041 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 6/6 constraints]
After SMT, in 10472ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 10475ms
Starting structural reductions in LTL mode, iteration 1 : 142/161 places, 172/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10661 ms. Remains : 142/161 places, 172/195 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLCardinality-02
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-04b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLCardinality-02 finished in 11026 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((F((p0&&X(p1)))&&(p2 U (p3||G(p2))))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 195/195 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 148 transition count 182
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 148 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 148 transition count 180
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 143 transition count 175
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 143 transition count 175
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 140 transition count 172
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 140 transition count 172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 47 place count 140 transition count 169
Applied a total of 47 rules in 14 ms. Remains 140 /161 variables (removed 21) and now considering 169/195 (removed 26) transitions.
// Phase 1: matrix 169 rows 140 cols
[2024-05-31 18:57:17] [INFO ] Computed 6 invariants in 5 ms
[2024-05-31 18:57:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 18:57:17] [INFO ] Invariant cache hit.
[2024-05-31 18:57:18] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-31 18:57:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/309 variables, 140/146 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 0/309 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 146 constraints, problems are : Problem set: 0 solved, 168 unsolved in 3375 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/309 variables, 140/146 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 168/314 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-31 18:57:22] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 5 ms to minimize.
[2024-05-31 18:57:22] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-31 18:57:22] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-31 18:57:22] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-31 18:57:23] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-31 18:57:23] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 2 ms to minimize.
[2024-05-31 18:57:23] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-05-31 18:57:23] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
[2024-05-31 18:57:23] [INFO ] Deduced a trap composed of 88 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 9/323 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-31 18:57:25] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 1 ms to minimize.
[2024-05-31 18:57:25] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
[2024-05-31 18:57:25] [INFO ] Deduced a trap composed of 100 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 326 constraints, problems are : Problem set: 0 solved, 168 unsolved in 8442 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 12/12 constraints]
After SMT, in 11863ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 11866ms
Starting structural reductions in LTL mode, iteration 1 : 140/161 places, 169/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12065 ms. Remains : 140/161 places, 169/195 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLCardinality-03
Stuttering criterion allowed to conclude after 116 steps with 1 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLCardinality-03 finished in 12308 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 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 195/195 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 149 transition count 183
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 149 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 149 transition count 181
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 142 transition count 174
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 142 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 142 transition count 173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 140 transition count 171
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 140 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 47 place count 140 transition count 169
Applied a total of 47 rules in 8 ms. Remains 140 /161 variables (removed 21) and now considering 169/195 (removed 26) transitions.
// Phase 1: matrix 169 rows 140 cols
[2024-05-31 18:57:30] [INFO ] Computed 6 invariants in 3 ms
[2024-05-31 18:57:30] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 18:57:30] [INFO ] Invariant cache hit.
[2024-05-31 18:57:30] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-31 18:57:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-31 18:57:31] [INFO ] Deduced a trap composed of 107 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/309 variables, 140/147 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/309 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 147 constraints, problems are : Problem set: 0 solved, 168 unsolved in 4167 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/309 variables, 140/147 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 168/315 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-31 18:57:35] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-31 18:57:35] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-31 18:57:36] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2024-05-31 18:57:36] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-31 18:57:36] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-31 18:57:36] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
[2024-05-31 18:57:36] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 1 ms to minimize.
[2024-05-31 18:57:36] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/323 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-31 18:57:38] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/309 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 324 constraints, problems are : Problem set: 0 solved, 168 unsolved in 8201 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 10/10 constraints]
After SMT, in 12397ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 12399ms
Starting structural reductions in LTL mode, iteration 1 : 140/161 places, 169/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12544 ms. Remains : 140/161 places, 169/195 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Product exploration explored 100000 steps with 50000 reset in 116 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 21 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-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-04b-LTLCardinality-04 finished in 12964 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(F(p0)))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 195/195 transitions.
Graph (trivial) has 143 edges and 161 vertex of which 24 / 161 are part of one of the 4 SCC in 2 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 140 transition count 153
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 119 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 118 transition count 152
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 45 place count 118 transition count 139
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 71 place count 105 transition count 139
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 91 place count 85 transition count 119
Iterating global reduction 3 with 20 rules applied. Total rules applied 111 place count 85 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 85 transition count 117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 113 place count 85 transition count 116
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 115 place count 84 transition count 116
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 119 place count 80 transition count 112
Iterating global reduction 4 with 4 rules applied. Total rules applied 123 place count 80 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 127 place count 80 transition count 108
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 175 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 179 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 181 place count 54 transition count 78
Applied a total of 181 rules in 40 ms. Remains 54 /161 variables (removed 107) and now considering 78/195 (removed 117) transitions.
[2024-05-31 18:57:43] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
// Phase 1: matrix 71 rows 54 cols
[2024-05-31 18:57:43] [INFO ] Computed 6 invariants in 0 ms
[2024-05-31 18:57:43] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-31 18:57:43] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
[2024-05-31 18:57:43] [INFO ] Invariant cache hit.
[2024-05-31 18:57:43] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-31 18:57:43] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-31 18:57:43] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
[2024-05-31 18:57:43] [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 548 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 579 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 1138ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1139ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/161 places, 78/195 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1282 ms. Remains : 54/161 places, 78/195 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLCardinality-06
Stuttering criterion allowed to conclude after 54 steps with 5 reset in 2 ms.
FORMULA FlexibleBarrier-PT-04b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLCardinality-06 finished in 1393 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 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 195/195 transitions.
Graph (trivial) has 143 edges and 161 vertex of which 25 / 161 are part of one of the 4 SCC in 1 ms
Free SCC test removed 21 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 139 transition count 151
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 118 transition count 151
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 43 place count 118 transition count 139
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 67 place count 106 transition count 139
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 85 place count 88 transition count 121
Iterating global reduction 2 with 18 rules applied. Total rules applied 103 place count 88 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 88 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 105 place count 88 transition count 118
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 107 place count 87 transition count 118
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 111 place count 83 transition count 114
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 83 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 119 place count 83 transition count 110
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 4 with 50 rules applied. Total rules applied 169 place count 58 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 173 place count 58 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 56 transition count 79
Applied a total of 175 rules in 33 ms. Remains 56 /161 variables (removed 105) and now considering 79/195 (removed 116) transitions.
[2024-05-31 18:57:44] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
// Phase 1: matrix 72 rows 56 cols
[2024-05-31 18:57:44] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 18:57:44] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-31 18:57:44] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
[2024-05-31 18:57:44] [INFO ] Invariant cache hit.
[2024-05-31 18:57:44] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-31 18:57:44] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2024-05-31 18:57:44] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
[2024-05-31 18:57:44] [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
[2024-05-31 18:57:44] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 71/127 variables, 56/63 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/127 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/128 variables, and 63 constraints, problems are : Problem set: 0 solved, 49 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 1/1 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, 1/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 71/127 variables, 56/63 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 49/112 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/128 variables, and 112 constraints, problems are : Problem set: 0 solved, 49 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 1/1 constraints]
After SMT, in 1279ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1280ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/161 places, 79/195 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1408 ms. Remains : 56/161 places, 79/195 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLCardinality-07 finished in 1465 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)||G(p1)))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 195/195 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 150 transition count 184
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 150 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 23 place count 150 transition count 183
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 145 transition count 178
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 145 transition count 178
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 143 transition count 176
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 143 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 143 transition count 174
Applied a total of 39 rules in 15 ms. Remains 143 /161 variables (removed 18) and now considering 174/195 (removed 21) transitions.
// Phase 1: matrix 174 rows 143 cols
[2024-05-31 18:57:45] [INFO ] Computed 6 invariants in 3 ms
[2024-05-31 18:57:46] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 18:57:46] [INFO ] Invariant cache hit.
[2024-05-31 18:57:46] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-31 18:57:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (OVERLAPS) 174/317 variables, 143/149 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 0/317 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 149 constraints, problems are : Problem set: 0 solved, 173 unsolved in 3479 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (OVERLAPS) 174/317 variables, 143/149 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 173/322 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-31 18:57:50] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-31 18:57:51] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 3 ms to minimize.
[2024-05-31 18:57:51] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-05-31 18:57:51] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2024-05-31 18:57:51] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 1 ms to minimize.
[2024-05-31 18:57:51] [INFO ] Deduced a trap composed of 90 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 6/328 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 328 constraints, problems are : Problem set: 0 solved, 173 unsolved in 7371 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 6/6 constraints]
After SMT, in 10875ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 10877ms
Starting structural reductions in LTL mode, iteration 1 : 143/161 places, 174/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11036 ms. Remains : 143/161 places, 174/195 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Product exploration explored 100000 steps with 50000 reset in 114 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 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 34 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-04b-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-04b-LTLCardinality-09 finished in 11474 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(G(p0)))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 195/195 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 149 transition count 183
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 149 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 25 place count 149 transition count 182
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 142 transition count 175
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 142 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 142 transition count 174
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 139 transition count 171
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 139 transition count 171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 139 transition count 168
Applied a total of 49 rules in 8 ms. Remains 139 /161 variables (removed 22) and now considering 168/195 (removed 27) transitions.
// Phase 1: matrix 168 rows 139 cols
[2024-05-31 18:57:57] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 18:57:57] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-31 18:57:57] [INFO ] Invariant cache hit.
[2024-05-31 18:57:57] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-31 18:57:57] [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 3365 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-31 18:58:02] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 2 ms to minimize.
[2024-05-31 18:58:02] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-31 18:58:02] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-05-31 18:58:03] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 0 ms to minimize.
[2024-05-31 18:58:03] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 0 ms to minimize.
[2024-05-31 18:58:03] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 6/318 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-31 18:58:05] [INFO ] Deduced a trap composed of 87 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-31 18:58:06] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-31 18:58:09] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/307 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 0/307 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 321 constraints, problems are : Problem set: 0 solved, 167 unsolved in 13578 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 9/9 constraints]
After SMT, in 16966ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 16969ms
Starting structural reductions in LTL mode, iteration 1 : 139/161 places, 168/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17334 ms. Remains : 139/161 places, 168/195 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLCardinality-14 finished in 17440 ms.
All properties solved by simple procedures.
Total runtime 91490 ms.
ITS solved all properties within timeout

BK_STOP 1717181894894

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FlexibleBarrier-PT-04b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640602500011"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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