fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r496-tall-171640602700115
Last Updated
July 7, 2024

About the Execution of LTSMin+red for FlexibleBarrier-PT-18a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
594.371 108184.00 133680.00 359.80 FFTFTFTFFFFFTTTF normal

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-171640602700115.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-18a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602700115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 12:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 12:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 13 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 13 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 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 265K 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-18a-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-18a-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-18a-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-18a-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-18a-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-18a-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-18a-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-18a-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-18a-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-18a-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-18a-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-18a-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-18a-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-18a-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-18a-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-18a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717183392251

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-18a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:23:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:23:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:23:13] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-31 19:23:13] [INFO ] Transformed 219 places.
[2024-05-31 19:23:13] [INFO ] Transformed 886 transitions.
[2024-05-31 19:23:13] [INFO ] Found NUPN structural information;
[2024-05-31 19:23:13] [INFO ] Parsed PT model containing 219 places and 886 transitions and 4355 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 290 transitions
Reduce redundant transitions removed 290 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-18a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 596/596 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 219 transition count 578
Applied a total of 18 rules in 45 ms. Remains 219 /219 variables (removed 0) and now considering 578/596 (removed 18) transitions.
// Phase 1: matrix 578 rows 219 cols
[2024-05-31 19:23:13] [INFO ] Computed 20 invariants in 19 ms
[2024-05-31 19:23:14] [INFO ] Implicit Places using invariants in 430 ms returned [217, 218]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 464 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 217/219 places, 578/596 transitions.
Applied a total of 0 rules in 18 ms. Remains 217 /217 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 546 ms. Remains : 217/219 places, 578/596 transitions.
Support contains 22 out of 217 places after structural reductions.
[2024-05-31 19:23:14] [INFO ] Flatten gal took : 54 ms
[2024-05-31 19:23:14] [INFO ] Flatten gal took : 26 ms
[2024-05-31 19:23:14] [INFO ] Input system was already deterministic with 578 transitions.
RANDOM walk for 5790 steps (0 resets) in 235 ms. (24 steps per ms) remains 0/13 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 3 out of 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 578/578 transitions.
Graph (trivial) has 279 edges and 217 vertex of which 208 / 217 are part of one of the 20 SCC in 2 ms
Free SCC test removed 188 places
Ensure Unique test removed 388 transitions
Reduce isomorphic transitions removed 388 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 180 rules applied. Total rules applied 181 place count 13 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 182 place count 12 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 11 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 11 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 186 place count 11 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 187 place count 10 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 196 place count 10 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 198 place count 9 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 198 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 204 place count 6 transition count 7
Applied a total of 204 rules in 29 ms. Remains 6 /217 variables (removed 211) and now considering 7/578 (removed 571) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-31 19:23:14] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 19:23:14] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-31 19:23:14] [INFO ] Invariant cache hit.
[2024-05-31 19:23:14] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-31 19:23:14] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-31 19:23:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 114ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/217 places, 7/578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 6/217 places, 7/578 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-18a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLCardinality-00 finished in 522 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||X(p0)))))'
Support contains 1 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 578/578 transitions.
Applied a total of 0 rules in 10 ms. Remains 217 /217 variables (removed 0) and now considering 578/578 (removed 0) transitions.
// Phase 1: matrix 578 rows 217 cols
[2024-05-31 19:23:15] [INFO ] Computed 18 invariants in 3 ms
[2024-05-31 19:23:15] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 19:23:15] [INFO ] Invariant cache hit.
[2024-05-31 19:23:15] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 577 sub problems to find dead transitions.
[2024-05-31 19:23:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 216/216 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 18/234 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/795 variables, 217/452 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/795 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (OVERLAPS) 0/795 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 577 unsolved
No progress, stopping.
After SMT solving in domain Real declared 795/795 variables, and 452 constraints, problems are : Problem set: 0 solved, 577 unsolved in 22300 ms.
Refiners :[Domain max(s): 217/217 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 216/216 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 18/234 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/795 variables, 217/452 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/795 variables, 577/1029 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/795 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 8 (OVERLAPS) 0/795 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 577 unsolved
No progress, stopping.
After SMT solving in domain Int declared 795/795 variables, and 1029 constraints, problems are : Problem set: 0 solved, 577 unsolved in 29063 ms.
Refiners :[Domain max(s): 217/217 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints]
After SMT, in 51897ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 51908ms
Finished structural reductions in LTL mode , in 1 iterations and 52136 ms. Remains : 217/217 places, 578/578 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 4 ms.
FORMULA FlexibleBarrier-PT-18a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLCardinality-01 finished in 52284 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))'
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 578/578 transitions.
Graph (trivial) has 283 edges and 217 vertex of which 208 / 217 are part of one of the 22 SCC in 0 ms
Free SCC test removed 186 places
Ensure Unique test removed 386 transitions
Reduce isomorphic transitions removed 386 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 185 rules applied. Total rules applied 186 place count 14 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 188 place count 12 transition count 22
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 190 place count 10 transition count 18
Iterating global reduction 2 with 2 rules applied. Total rules applied 192 place count 10 transition count 18
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 196 place count 10 transition count 14
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 199 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 200 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 205 place count 7 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 207 place count 7 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 209 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 209 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 211 place count 4 transition count 5
Applied a total of 211 rules in 16 ms. Remains 4 /217 variables (removed 213) and now considering 5/578 (removed 573) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-05-31 19:24:07] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 19:24:07] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-31 19:24:07] [INFO ] Invariant cache hit.
[2024-05-31 19:24:07] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-31 19:24:07] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-31 19:24:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 59ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/217 places, 5/578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 4/217 places, 5/578 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLCardinality-05 finished in 168 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 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 578/578 transitions.
Graph (trivial) has 283 edges and 217 vertex of which 202 / 217 are part of one of the 20 SCC in 1 ms
Free SCC test removed 182 places
Ensure Unique test removed 351 transitions
Reduce isomorphic transitions removed 351 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Graph (trivial) has 22 edges and 18 vertex of which 2 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 215 rules applied. Total rules applied 216 place count 17 transition count 28
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 221 place count 14 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 222 place count 13 transition count 26
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 224 place count 11 transition count 22
Iterating global reduction 3 with 2 rules applied. Total rules applied 226 place count 11 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 231 place count 11 transition count 17
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 235 place count 8 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 7 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 238 place count 6 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 239 place count 6 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 246 place count 6 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 248 place count 6 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 250 place count 4 transition count 5
Applied a total of 250 rules in 12 ms. Remains 4 /217 variables (removed 213) and now considering 5/578 (removed 573) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-05-31 19:24:07] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 19:24:07] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-31 19:24:07] [INFO ] Invariant cache hit.
[2024-05-31 19:24:07] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-31 19:24:07] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-31 19:24:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 49ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 49ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/217 places, 5/578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 4/217 places, 5/578 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLCardinality-08
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLCardinality-08 finished in 141 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 p1)))'
Support contains 3 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 578/578 transitions.
Applied a total of 0 rules in 8 ms. Remains 217 /217 variables (removed 0) and now considering 578/578 (removed 0) transitions.
// Phase 1: matrix 578 rows 217 cols
[2024-05-31 19:24:07] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 19:24:07] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 19:24:07] [INFO ] Invariant cache hit.
[2024-05-31 19:24:08] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 577 sub problems to find dead transitions.
[2024-05-31 19:24:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 216/216 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 18/234 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/795 variables, 217/452 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/795 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (OVERLAPS) 0/795 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 577 unsolved
No progress, stopping.
After SMT solving in domain Real declared 795/795 variables, and 452 constraints, problems are : Problem set: 0 solved, 577 unsolved in 21690 ms.
Refiners :[Domain max(s): 217/217 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 216/216 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 18/234 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/795 variables, 217/452 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/795 variables, 577/1029 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/795 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 8 (OVERLAPS) 0/795 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 577 unsolved
No progress, stopping.
After SMT solving in domain Int declared 795/795 variables, and 1029 constraints, problems are : Problem set: 0 solved, 577 unsolved in 28845 ms.
Refiners :[Domain max(s): 217/217 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints]
After SMT, in 50889ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 50895ms
Finished structural reductions in LTL mode , in 1 iterations and 51104 ms. Remains : 217/217 places, 578/578 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLCardinality-09 finished in 51235 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)&&(p1||F(p2)))))'
Support contains 3 out of 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 578/578 transitions.
Graph (trivial) has 279 edges and 217 vertex of which 206 / 217 are part of one of the 22 SCC in 1 ms
Free SCC test removed 184 places
Ensure Unique test removed 382 transitions
Reduce isomorphic transitions removed 382 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 181 rules applied. Total rules applied 182 place count 17 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 184 place count 15 transition count 29
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 186 place count 13 transition count 25
Iterating global reduction 2 with 2 rules applied. Total rules applied 188 place count 13 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 192 place count 13 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 194 place count 11 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 203 place count 11 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 205 place count 11 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 207 place count 9 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 207 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 213 place count 6 transition count 7
Applied a total of 213 rules in 10 ms. Remains 6 /217 variables (removed 211) and now considering 7/578 (removed 571) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-31 19:24:59] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 19:24:59] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-31 19:24:59] [INFO ] Invariant cache hit.
[2024-05-31 19:24:59] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-31 19:24:59] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-31 19:24:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 60ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/217 places, 7/578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 6/217 places, 7/578 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLCardinality-11 finished in 239 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||G((p1&&F(G(p2)))))))'
Support contains 8 out of 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 578/578 transitions.
Graph (trivial) has 268 edges and 217 vertex of which 181 / 217 are part of one of the 25 SCC in 1 ms
Free SCC test removed 156 places
Ensure Unique test removed 309 transitions
Reduce isomorphic transitions removed 309 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 61 transition count 260
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 52 transition count 260
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 23 place count 48 transition count 252
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 48 transition count 252
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 9 rules applied. Total rules applied 36 place count 48 transition count 243
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 41 place count 43 transition count 243
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 47 place count 40 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 183 transitions
Redundant transition composition rules discarded 183 transitions
Iterating global reduction 4 with 183 rules applied. Total rules applied 230 place count 40 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 231 place count 40 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 232 place count 39 transition count 56
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 242 place count 29 transition count 46
Iterating global reduction 6 with 10 rules applied. Total rules applied 252 place count 29 transition count 46
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 254 place count 29 transition count 46
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 256 place count 27 transition count 44
Iterating global reduction 6 with 2 rules applied. Total rules applied 258 place count 27 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 260 place count 27 transition count 42
Applied a total of 260 rules in 25 ms. Remains 27 /217 variables (removed 190) and now considering 42/578 (removed 536) transitions.
[2024-05-31 19:24:59] [INFO ] Flow matrix only has 32 transitions (discarded 10 similar events)
// Phase 1: matrix 32 rows 27 cols
[2024-05-31 19:24:59] [INFO ] Computed 8 invariants in 0 ms
[2024-05-31 19:24:59] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 19:24:59] [INFO ] Flow matrix only has 32 transitions (discarded 10 similar events)
[2024-05-31 19:24:59] [INFO ] Invariant cache hit.
[2024-05-31 19:24:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:24:59] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-31 19:24:59] [INFO ] Redundant transitions in 0 ms returned []
Running 41 sub problems to find dead transitions.
[2024-05-31 19:24:59] [INFO ] Flow matrix only has 32 transitions (discarded 10 similar events)
[2024-05-31 19:24:59] [INFO ] Invariant cache hit.
[2024-05-31 19:24:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 31/58 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 1/59 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/59 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 36 constraints, problems are : Problem set: 0 solved, 41 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 31/58 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 41/76 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 1/59 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/59 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 77 constraints, problems are : Problem set: 0 solved, 41 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 816ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 817ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/217 places, 42/578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 893 ms. Remains : 27/217 places, 42/578 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLCardinality-15
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLCardinality-15 finished in 1063 ms.
All properties solved by simple procedures.
Total runtime 107094 ms.
ITS solved all properties within timeout

BK_STOP 1717183500435

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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-18a"
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-18a, 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-171640602700115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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