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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
357.920 16564.00 27805.00 93.50 FFTFTFFFTFTFFFFF 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-171640602500019.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-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602500019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.4K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 13 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 08:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 08:37 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 41K 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-06a-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717181836122

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-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:57:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 18:57:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:57:17] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-31 18:57:17] [INFO ] Transformed 75 places.
[2024-05-31 18:57:17] [INFO ] Transformed 154 transitions.
[2024-05-31 18:57:17] [INFO ] Found NUPN structural information;
[2024-05-31 18:57:17] [INFO ] Parsed PT model containing 75 places and 154 transitions and 599 arcs in 166 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 5 formulas.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 128/128 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 75 transition count 122
Applied a total of 6 rules in 22 ms. Remains 75 /75 variables (removed 0) and now considering 122/128 (removed 6) transitions.
// Phase 1: matrix 122 rows 75 cols
[2024-05-31 18:57:17] [INFO ] Computed 8 invariants in 11 ms
[2024-05-31 18:57:17] [INFO ] Implicit Places using invariants in 241 ms returned [73, 74]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 272 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/75 places, 122/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 316 ms. Remains : 73/75 places, 122/128 transitions.
Support contains 17 out of 73 places after structural reductions.
[2024-05-31 18:57:18] [INFO ] Flatten gal took : 29 ms
[2024-05-31 18:57:18] [INFO ] Flatten gal took : 11 ms
[2024-05-31 18:57:18] [INFO ] Input system was already deterministic with 122 transitions.
RANDOM walk for 810 steps (0 resets) in 94 ms. (8 steps per ms) remains 0/10 properties
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 122/122 transitions.
Graph (trivial) has 90 edges and 73 vertex of which 66 / 73 are part of one of the 8 SCC in 2 ms
Free SCC test removed 58 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 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 22 rules applied. Total rules applied 23 place count 10 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 9 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 8 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 8 transition count 10
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 1 rules applied. Total rules applied 33 place count 8 transition count 9
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 36 place count 6 transition count 8
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 37 place count 5 transition count 7
Iterating global reduction 5 with 1 rules applied. Total rules applied 38 place count 5 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 39 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 39 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 6 with 2 rules applied. Total rules applied 41 place count 4 transition count 5
Applied a total of 41 rules in 27 ms. Remains 4 /73 variables (removed 69) and now considering 5/122 (removed 117) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-05-31 18:57:18] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 18:57:18] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 18:57:18] [INFO ] Invariant cache hit.
[2024-05-31 18:57:18] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-31 18:57:18] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-31 18:57:18] [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 51 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 37 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 110ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/73 places, 5/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 4/73 places, 5/122 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLCardinality-01 finished in 450 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)&&F(G(p1)))))'
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 122/122 transitions.
Graph (trivial) has 86 edges and 73 vertex of which 54 / 73 are part of one of the 10 SCC in 0 ms
Free SCC test removed 44 places
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 28 edges and 25 vertex of which 2 / 25 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 25 rules applied. Total rules applied 26 place count 24 transition count 41
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 31 place count 21 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 20 transition count 39
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 18 transition count 35
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 18 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 18 transition count 31
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 44 place count 16 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 46 place count 14 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 50 place count 12 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 51 place count 12 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 62 place count 12 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 7 with 3 rules applied. Total rules applied 65 place count 12 transition count 12
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 68 place count 9 transition count 12
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 69 place count 8 transition count 11
Iterating global reduction 9 with 1 rules applied. Total rules applied 70 place count 8 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 71 place count 8 transition count 10
Applied a total of 71 rules in 15 ms. Remains 8 /73 variables (removed 65) and now considering 10/122 (removed 112) transitions.
// Phase 1: matrix 10 rows 8 cols
[2024-05-31 18:57:19] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 18:57:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-31 18:57:19] [INFO ] Invariant cache hit.
[2024-05-31 18:57:19] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-31 18:57:19] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-31 18:57:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 9/17 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/17 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 11 constraints, problems are : Problem set: 0 solved, 6 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 9/17 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 17 constraints, problems are : Problem set: 0 solved, 6 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 168ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 168ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/73 places, 10/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 8/73 places, 10/122 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLCardinality-07 finished in 449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((!p0 U p1)&&X(!p1)) U X(p1)))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 122/122 transitions.
Applied a total of 0 rules in 5 ms. Remains 73 /73 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 73 cols
[2024-05-31 18:57:19] [INFO ] Computed 6 invariants in 4 ms
[2024-05-31 18:57:19] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 18:57:19] [INFO ] Invariant cache hit.
[2024-05-31 18:57:19] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-31 18:57:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/195 variables, 73/152 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 152 constraints, problems are : Problem set: 0 solved, 121 unsolved in 1840 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/195 variables, 73/152 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 121/273 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 273 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2060 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 3948ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 3951ms
Finished structural reductions in LTL mode , in 1 iterations and 4062 ms. Remains : 73/73 places, 122/122 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 287 ms.
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 102 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-06a-LTLCardinality-10 finished in 4795 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 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-05-31 18:57:24] [INFO ] Invariant cache hit.
[2024-05-31 18:57:24] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-31 18:57:24] [INFO ] Invariant cache hit.
[2024-05-31 18:57:24] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-31 18:57:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/195 variables, 73/152 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 152 constraints, problems are : Problem set: 0 solved, 121 unsolved in 1647 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/195 variables, 73/152 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 121/273 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 273 constraints, problems are : Problem set: 0 solved, 121 unsolved in 1950 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 3621ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 3623ms
Finished structural reductions in LTL mode , in 1 iterations and 3708 ms. Remains : 73/73 places, 122/122 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLCardinality-11
Product exploration explored 100000 steps with 603 reset in 132 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 0 ms.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLCardinality-11 finished in 3950 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&&X((X(p1)&&(F(p2)||G(!p0))))))))'
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 122/122 transitions.
Applied a total of 0 rules in 5 ms. Remains 73 /73 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-05-31 18:57:28] [INFO ] Invariant cache hit.
[2024-05-31 18:57:28] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-31 18:57:28] [INFO ] Invariant cache hit.
[2024-05-31 18:57:28] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-31 18:57:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/195 variables, 73/152 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 152 constraints, problems are : Problem set: 0 solved, 121 unsolved in 1624 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/195 variables, 73/152 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 121/273 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 273 constraints, problems are : Problem set: 0 solved, 121 unsolved in 1980 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 3643ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 3645ms
Finished structural reductions in LTL mode , in 1 iterations and 3731 ms. Remains : 73/73 places, 122/122 transitions.
Stuttering acceptance computed with spot in 449 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) (AND p0 (NOT p2))), (NOT p1), (AND p0 (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLCardinality-13
Product exploration explored 100000 steps with 250 reset in 118 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 1 ms.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLCardinality-13 finished in 4336 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 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 122/122 transitions.
Graph (trivial) has 90 edges and 73 vertex of which 66 / 73 are part of one of the 6 SCC in 1 ms
Free SCC test removed 60 places
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 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 22 rules applied. Total rules applied 23 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 7 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 6 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 31 place count 6 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 33 place count 6 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 35 place count 4 transition count 5
Applied a total of 35 rules in 12 ms. Remains 4 /73 variables (removed 69) and now considering 5/122 (removed 117) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-05-31 18:57:32] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 18:57:32] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-31 18:57:32] [INFO ] Invariant cache hit.
[2024-05-31 18:57:32] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-31 18:57:32] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-31 18:57:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 10 constraints, problems are : Problem set: 0 solved, 2 unsolved in 31 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 12 constraints, problems are : Problem set: 0 solved, 2 unsolved in 33 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 68ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/73 places, 5/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 4/73 places, 5/122 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLCardinality-15 finished in 192 ms.
All properties solved by simple procedures.
Total runtime 15269 ms.
ITS solved all properties within timeout

BK_STOP 1717181852686

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-06a"
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-06a, 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-171640602500019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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