Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r169-tall-167838855900468.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FlexibleBarrier-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855900468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 12:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 12:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 141K Mar 5 18:22 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-06b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678550951037

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 16:09:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 16:09:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 16:09:12] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-11 16:09:12] [INFO ] Transformed 542 places.
[2023-03-11 16:09:12] [INFO ] Transformed 621 transitions.
[2023-03-11 16:09:12] [INFO ] Found NUPN structural information;
[2023-03-11 16:09:12] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 621/621 transitions.
Discarding 173 places :
Symmetric choice reduction at 0 with 173 rule applications. Total rules 173 place count 369 transition count 448
Iterating global reduction 0 with 173 rules applied. Total rules applied 346 place count 369 transition count 448
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 414 place count 301 transition count 380
Iterating global reduction 0 with 68 rules applied. Total rules applied 482 place count 301 transition count 380
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 522 place count 261 transition count 340
Iterating global reduction 0 with 40 rules applied. Total rules applied 562 place count 261 transition count 340
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 577 place count 261 transition count 325
Applied a total of 577 rules in 90 ms. Remains 261 /542 variables (removed 281) and now considering 325/621 (removed 296) transitions.
// Phase 1: matrix 325 rows 261 cols
[2023-03-11 16:09:13] [INFO ] Computed 8 place invariants in 25 ms
[2023-03-11 16:09:13] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-11 16:09:13] [INFO ] Invariant cache hit.
[2023-03-11 16:09:13] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2023-03-11 16:09:13] [INFO ] Invariant cache hit.
[2023-03-11 16:09:13] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 261/542 places, 325/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 767 ms. Remains : 261/542 places, 325/621 transitions.
Support contains 35 out of 261 places after structural reductions.
[2023-03-11 16:09:14] [INFO ] Flatten gal took : 48 ms
[2023-03-11 16:09:14] [INFO ] Flatten gal took : 19 ms
[2023-03-11 16:09:14] [INFO ] Input system was already deterministic with 325 transitions.
Incomplete random walk after 10000 steps, including 190 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 32) seen :16
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-11 16:09:14] [INFO ] Invariant cache hit.
[2023-03-11 16:09:14] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 16:09:15] [INFO ] After 192ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:13
[2023-03-11 16:09:15] [INFO ] After 261ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-11 16:09:15] [INFO ] After 475ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-11 16:09:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-11 16:09:15] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-11 16:09:16] [INFO ] After 581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 189 ms.
[2023-03-11 16:09:16] [INFO ] After 985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 14 different solutions.
Finished Parikh walk after 50 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 15 properties in 30 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 10 stabilizing places and 10 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 325/325 transitions.
Graph (trivial) has 240 edges and 261 vertex of which 37 / 261 are part of one of the 6 SCC in 3 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 229 transition count 257
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 194 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 193 transition count 256
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 73 place count 193 transition count 240
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 105 place count 177 transition count 240
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 130 place count 152 transition count 215
Iterating global reduction 3 with 25 rules applied. Total rules applied 155 place count 152 transition count 215
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 155 place count 152 transition count 213
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 150 transition count 213
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 165 place count 144 transition count 207
Iterating global reduction 3 with 6 rules applied. Total rules applied 171 place count 144 transition count 207
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 176 place count 144 transition count 202
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 248 place count 108 transition count 166
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 252 place count 104 transition count 162
Iterating global reduction 4 with 4 rules applied. Total rules applied 256 place count 104 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 260 place count 104 transition count 158
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 266 place count 104 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 268 place count 102 transition count 150
Applied a total of 268 rules in 61 ms. Remains 102 /261 variables (removed 159) and now considering 150/325 (removed 175) transitions.
[2023-03-11 16:09:16] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
// Phase 1: matrix 139 rows 102 cols
[2023-03-11 16:09:16] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 16:09:16] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 16:09:16] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2023-03-11 16:09:16] [INFO ] Invariant cache hit.
[2023-03-11 16:09:16] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-11 16:09:16] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-11 16:09:16] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2023-03-11 16:09:16] [INFO ] Invariant cache hit.
[2023-03-11 16:09:17] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/261 places, 150/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 297 ms. Remains : 102/261 places, 150/325 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 42337 steps with 3260 reset in 248 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-00 finished in 784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(F(p1))) U X((G(F(p0)) U p1))))'
Support contains 1 out of 261 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 325/325 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 244 transition count 308
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 244 transition count 308
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 46 place count 232 transition count 296
Iterating global reduction 0 with 12 rules applied. Total rules applied 58 place count 232 transition count 296
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 64 place count 232 transition count 290
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 229 transition count 287
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 229 transition count 287
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 73 place count 229 transition count 284
Applied a total of 73 rules in 19 ms. Remains 229 /261 variables (removed 32) and now considering 284/325 (removed 41) transitions.
// Phase 1: matrix 284 rows 229 cols
[2023-03-11 16:09:17] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-11 16:09:17] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-11 16:09:17] [INFO ] Invariant cache hit.
[2023-03-11 16:09:17] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-11 16:09:17] [INFO ] Invariant cache hit.
[2023-03-11 16:09:17] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/261 places, 284/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 229/261 places, 284/325 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-01 finished in 438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 325/325 transitions.
Graph (trivial) has 241 edges and 261 vertex of which 37 / 261 are part of one of the 6 SCC in 0 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 230 transition count 257
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 194 transition count 257
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 73 place count 194 transition count 240
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 107 place count 177 transition count 240
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 133 place count 151 transition count 214
Iterating global reduction 2 with 26 rules applied. Total rules applied 159 place count 151 transition count 214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 159 place count 151 transition count 212
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 163 place count 149 transition count 212
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 169 place count 143 transition count 206
Iterating global reduction 2 with 6 rules applied. Total rules applied 175 place count 143 transition count 206
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 181 place count 143 transition count 200
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 255 place count 106 transition count 163
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 259 place count 102 transition count 159
Iterating global reduction 3 with 4 rules applied. Total rules applied 263 place count 102 transition count 159
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 267 place count 102 transition count 155
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 273 place count 102 transition count 149
Applied a total of 273 rules in 60 ms. Remains 102 /261 variables (removed 159) and now considering 149/325 (removed 176) transitions.
[2023-03-11 16:09:18] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
// Phase 1: matrix 138 rows 102 cols
[2023-03-11 16:09:18] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-11 16:09:18] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-11 16:09:18] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2023-03-11 16:09:18] [INFO ] Invariant cache hit.
[2023-03-11 16:09:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 16:09:18] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-11 16:09:18] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-11 16:09:18] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2023-03-11 16:09:18] [INFO ] Invariant cache hit.
[2023-03-11 16:09:18] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/261 places, 149/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 297 ms. Remains : 102/261 places, 149/325 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6686 reset in 231 ms.
Product exploration explored 100000 steps with 6700 reset in 309 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/102 stabilizing places and 2/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 149/149 transitions.
Applied a total of 0 rules in 12 ms. Remains 102 /102 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2023-03-11 16:09:19] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2023-03-11 16:09:19] [INFO ] Invariant cache hit.
[2023-03-11 16:09:19] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-11 16:09:19] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2023-03-11 16:09:19] [INFO ] Invariant cache hit.
[2023-03-11 16:09:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 16:09:19] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-11 16:09:19] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-11 16:09:19] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2023-03-11 16:09:19] [INFO ] Invariant cache hit.
[2023-03-11 16:09:19] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 301 ms. Remains : 102/102 places, 149/149 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/102 stabilizing places and 2/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 243 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6683 reset in 202 ms.
Product exploration explored 100000 steps with 6684 reset in 197 ms.
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 149/149 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2023-03-11 16:09:20] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2023-03-11 16:09:20] [INFO ] Invariant cache hit.
[2023-03-11 16:09:20] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-11 16:09:20] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2023-03-11 16:09:20] [INFO ] Invariant cache hit.
[2023-03-11 16:09:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 16:09:20] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-11 16:09:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 16:09:20] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2023-03-11 16:09:20] [INFO ] Invariant cache hit.
[2023-03-11 16:09:20] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 258 ms. Remains : 102/102 places, 149/149 transitions.
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-02 finished in 3103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 325/325 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 243 transition count 307
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 243 transition count 307
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 231 transition count 295
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 231 transition count 295
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 231 transition count 289
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 227 transition count 285
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 227 transition count 285
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 227 transition count 281
Applied a total of 78 rules in 10 ms. Remains 227 /261 variables (removed 34) and now considering 281/325 (removed 44) transitions.
// Phase 1: matrix 281 rows 227 cols
[2023-03-11 16:09:21] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 16:09:21] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-11 16:09:21] [INFO ] Invariant cache hit.
[2023-03-11 16:09:21] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-11 16:09:21] [INFO ] Invariant cache hit.
[2023-03-11 16:09:21] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 227/261 places, 281/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 227/261 places, 281/325 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s219 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-03 finished in 437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F((p1 U (p2||G(p1))))))'
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 325/325 transitions.
Graph (trivial) has 229 edges and 261 vertex of which 31 / 261 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 234 transition count 261
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 198 transition count 261
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 73 place count 198 transition count 243
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 109 place count 180 transition count 243
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 132 place count 157 transition count 220
Iterating global reduction 2 with 23 rules applied. Total rules applied 155 place count 157 transition count 220
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 155 place count 157 transition count 218
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 159 place count 155 transition count 218
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 165 place count 149 transition count 212
Iterating global reduction 2 with 6 rules applied. Total rules applied 171 place count 149 transition count 212
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 177 place count 149 transition count 206
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 253 place count 111 transition count 168
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 255 place count 109 transition count 166
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 109 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 259 place count 109 transition count 164
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 263 place count 107 transition count 172
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 271 place count 107 transition count 164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 272 place count 106 transition count 163
Applied a total of 272 rules in 41 ms. Remains 106 /261 variables (removed 155) and now considering 163/325 (removed 162) transitions.
[2023-03-11 16:09:21] [INFO ] Flow matrix only has 153 transitions (discarded 10 similar events)
// Phase 1: matrix 153 rows 106 cols
[2023-03-11 16:09:21] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 16:09:21] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 16:09:21] [INFO ] Flow matrix only has 153 transitions (discarded 10 similar events)
[2023-03-11 16:09:21] [INFO ] Invariant cache hit.
[2023-03-11 16:09:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 16:09:21] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-11 16:09:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 16:09:21] [INFO ] Flow matrix only has 153 transitions (discarded 10 similar events)
[2023-03-11 16:09:21] [INFO ] Invariant cache hit.
[2023-03-11 16:09:21] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/261 places, 163/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 106/261 places, 163/325 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s44 1), p2:(AND (NOT (AND (EQ s3 1) (EQ s14 1))) (NEQ s14 1)), p1:(NEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-04 finished in 527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U ((X(p0)&&(p1 U (p2&&F(p1))))||X(G(p0))))))'
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 325/325 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 244 transition count 308
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 244 transition count 308
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 46 place count 232 transition count 296
Iterating global reduction 0 with 12 rules applied. Total rules applied 58 place count 232 transition count 296
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 64 place count 232 transition count 290
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 229 transition count 287
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 229 transition count 287
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 73 place count 229 transition count 284
Applied a total of 73 rules in 18 ms. Remains 229 /261 variables (removed 32) and now considering 284/325 (removed 41) transitions.
// Phase 1: matrix 284 rows 229 cols
[2023-03-11 16:09:22] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-11 16:09:22] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 16:09:22] [INFO ] Invariant cache hit.
[2023-03-11 16:09:22] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-11 16:09:22] [INFO ] Invariant cache hit.
[2023-03-11 16:09:22] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/261 places, 284/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 229/261 places, 284/325 transitions.
Stuttering acceptance computed with spot in 440 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p2:(EQ s57 1), p1:(EQ s116 1), p0:(NEQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25051 reset in 215 ms.
Product exploration explored 100000 steps with 24985 reset in 207 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) p0)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1060 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter sensitive) to 10 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 485 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 186 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 16:09:25] [INFO ] Invariant cache hit.
[2023-03-11 16:09:25] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 16:09:25] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 16:09:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 16:09:25] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 16:09:25] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-11 16:09:25] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 110 steps, including 1 resets, run visited all 5 properties in 3 ms. (steps per millisecond=36 )
Parikh walk visited 5 properties in 2 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) p0)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p1) p2 (NOT p0))), (F p1)]
Knowledge based reduction with 18 factoid took 1323 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter sensitive) to 10 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 443 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 438 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Applied a total of 0 rules in 7 ms. Remains 229 /229 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2023-03-11 16:09:27] [INFO ] Invariant cache hit.
[2023-03-11 16:09:27] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 16:09:27] [INFO ] Invariant cache hit.
[2023-03-11 16:09:28] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-11 16:09:28] [INFO ] Invariant cache hit.
[2023-03-11 16:09:28] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 229/229 places, 284/284 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2) p0)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1030 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter sensitive) to 10 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 525 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 182 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 16:09:30] [INFO ] Invariant cache hit.
[2023-03-11 16:09:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 16:09:30] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 16:09:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 16:09:30] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 16:09:30] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-11 16:09:30] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 4 properties in 10 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 284/284 transitions.
Graph (trivial) has 203 edges and 229 vertex of which 37 / 229 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 198 transition count 218
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 170 transition count 218
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 57 place count 170 transition count 205
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 83 place count 157 transition count 205
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 146 transition count 194
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 146 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 145 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 145 transition count 193
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 183 place count 107 transition count 155
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 195 place count 107 transition count 143
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 201 place count 101 transition count 137
Iterating global reduction 3 with 6 rules applied. Total rules applied 207 place count 101 transition count 137
Free-agglomeration rule applied 63 times.
Iterating global reduction 3 with 63 rules applied. Total rules applied 270 place count 101 transition count 74
Reduce places removed 63 places and 0 transitions.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 94 edges and 38 vertex of which 23 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 89 rules applied. Total rules applied 359 place count 23 transition count 49
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 380 place count 23 transition count 28
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 381 place count 23 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 382 place count 22 transition count 27
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t7.t110.t249 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 17 edges and 19 vertex of which 12 / 19 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 386 place count 10 transition count 24
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 16 rules applied. Total rules applied 402 place count 9 transition count 9
Reduce places removed 1 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 7 with 3 rules applied. Total rules applied 405 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 406 place count 7 transition count 7
Applied a total of 406 rules in 24 ms. Remains 7 /229 variables (removed 222) and now considering 7/284 (removed 277) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 7/229 places, 7/284 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2) p0)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2) p0)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p1) p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F p1)]
Knowledge based reduction with 18 factoid took 1389 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter sensitive) to 10 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 442 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 445 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 442 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 25045 reset in 153 ms.
Product exploration explored 100000 steps with 24952 reset in 151 ms.
Applying partial POR strategy [false, false, true, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 445 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Graph (trivial) has 203 edges and 229 vertex of which 37 / 229 are part of one of the 6 SCC in 0 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 198 transition count 252
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 25 place count 198 transition count 252
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 40 place count 198 transition count 252
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 65 place count 173 transition count 227
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 90 place count 173 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 172 transition count 226
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 172 transition count 226
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 127 place count 172 transition count 237
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 144 place count 155 transition count 220
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 161 place count 155 transition count 220
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 166 place count 155 transition count 230
Deduced a syphon composed of 48 places in 0 ms
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 177 place count 155 transition count 219
Deduced a syphon composed of 48 places in 0 ms
Applied a total of 177 rules in 50 ms. Remains 155 /229 variables (removed 74) and now considering 219/284 (removed 65) transitions.
[2023-03-11 16:09:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 16:09:34] [INFO ] Flow matrix only has 208 transitions (discarded 11 similar events)
// Phase 1: matrix 208 rows 155 cols
[2023-03-11 16:09:34] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 16:09:34] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/229 places, 219/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 155/229 places, 219/284 transitions.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 284/284 (removed 0) transitions.
// Phase 1: matrix 284 rows 229 cols
[2023-03-11 16:09:34] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-11 16:09:34] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-11 16:09:34] [INFO ] Invariant cache hit.
[2023-03-11 16:09:34] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-11 16:09:34] [INFO ] Invariant cache hit.
[2023-03-11 16:09:34] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 353 ms. Remains : 229/229 places, 284/284 transitions.
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-05 finished in 12851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(F(p1)))))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 325/325 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 244 transition count 308
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 244 transition count 308
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 45 place count 233 transition count 297
Iterating global reduction 0 with 11 rules applied. Total rules applied 56 place count 233 transition count 297
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 233 transition count 293
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 229 transition count 289
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 229 transition count 289
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 229 transition count 285
Applied a total of 72 rules in 22 ms. Remains 229 /261 variables (removed 32) and now considering 285/325 (removed 40) transitions.
// Phase 1: matrix 285 rows 229 cols
[2023-03-11 16:09:34] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-11 16:09:35] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-11 16:09:35] [INFO ] Invariant cache hit.
[2023-03-11 16:09:35] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2023-03-11 16:09:35] [INFO ] Invariant cache hit.
[2023-03-11 16:09:35] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/261 places, 285/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 702 ms. Remains : 229/261 places, 285/325 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s41 1), p1:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-06 finished in 816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)) U X(p2)))'
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 325/325 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 246 transition count 310
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 246 transition count 310
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 40 place count 236 transition count 300
Iterating global reduction 0 with 10 rules applied. Total rules applied 50 place count 236 transition count 300
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 236 transition count 295
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 234 transition count 293
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 234 transition count 293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 234 transition count 291
Applied a total of 61 rules in 17 ms. Remains 234 /261 variables (removed 27) and now considering 291/325 (removed 34) transitions.
// Phase 1: matrix 291 rows 234 cols
[2023-03-11 16:09:35] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 16:09:36] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-03-11 16:09:36] [INFO ] Invariant cache hit.
[2023-03-11 16:09:36] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2023-03-11 16:09:36] [INFO ] Invariant cache hit.
[2023-03-11 16:09:36] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/261 places, 291/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 686 ms. Remains : 234/261 places, 291/325 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s16 1), p1:(OR (NEQ s140 1) (EQ s16 1)), p2:(AND (EQ s75 1) (NEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2527 steps with 45 reset in 8 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-07 finished in 946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1) U p2)))'
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 325/325 transitions.
Graph (trivial) has 236 edges and 261 vertex of which 37 / 261 are part of one of the 6 SCC in 0 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 229 transition count 258
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 195 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 194 transition count 257
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 71 place count 194 transition count 241
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 103 place count 178 transition count 241
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 127 place count 154 transition count 217
Iterating global reduction 3 with 24 rules applied. Total rules applied 151 place count 154 transition count 217
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 151 place count 154 transition count 215
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 155 place count 152 transition count 215
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 161 place count 146 transition count 209
Iterating global reduction 3 with 6 rules applied. Total rules applied 167 place count 146 transition count 209
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 172 place count 146 transition count 204
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 242 place count 111 transition count 169
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 246 place count 107 transition count 165
Iterating global reduction 4 with 4 rules applied. Total rules applied 250 place count 107 transition count 165
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 254 place count 107 transition count 161
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 259 place count 107 transition count 156
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 261 place count 105 transition count 154
Applied a total of 261 rules in 39 ms. Remains 105 /261 variables (removed 156) and now considering 154/325 (removed 171) transitions.
[2023-03-11 16:09:36] [INFO ] Flow matrix only has 143 transitions (discarded 11 similar events)
// Phase 1: matrix 143 rows 105 cols
[2023-03-11 16:09:36] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 16:09:36] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 16:09:36] [INFO ] Flow matrix only has 143 transitions (discarded 11 similar events)
[2023-03-11 16:09:36] [INFO ] Invariant cache hit.
[2023-03-11 16:09:36] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-11 16:09:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 16:09:36] [INFO ] Flow matrix only has 143 transitions (discarded 11 similar events)
[2023-03-11 16:09:36] [INFO ] Invariant cache hit.
[2023-03-11 16:09:36] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/261 places, 154/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 265 ms. Remains : 105/261 places, 154/325 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s37 0), p2:(EQ s47 1), p1:(EQ s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 6601 steps with 516 reset in 34 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-10 finished in 495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((p1||(p2&&X(p2))))))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 325/325 transitions.
Graph (trivial) has 206 edges and 261 vertex of which 30 / 261 are part of one of the 5 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 235 transition count 263
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 199 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 198 transition count 261
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 76 place count 198 transition count 242
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 114 place count 179 transition count 242
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 139 place count 154 transition count 217
Iterating global reduction 3 with 25 rules applied. Total rules applied 164 place count 154 transition count 217
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 164 place count 154 transition count 216
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 153 transition count 216
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 172 place count 147 transition count 210
Iterating global reduction 3 with 6 rules applied. Total rules applied 178 place count 147 transition count 210
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 184 place count 147 transition count 204
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 260 place count 109 transition count 166
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 264 place count 105 transition count 162
Iterating global reduction 4 with 4 rules applied. Total rules applied 268 place count 105 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 272 place count 105 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 274 place count 104 transition count 158
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 276 place count 102 transition count 156
Applied a total of 276 rules in 37 ms. Remains 102 /261 variables (removed 159) and now considering 156/325 (removed 169) transitions.
[2023-03-11 16:09:37] [INFO ] Flow matrix only has 142 transitions (discarded 14 similar events)
// Phase 1: matrix 142 rows 102 cols
[2023-03-11 16:09:37] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 16:09:37] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 16:09:37] [INFO ] Flow matrix only has 142 transitions (discarded 14 similar events)
[2023-03-11 16:09:37] [INFO ] Invariant cache hit.
[2023-03-11 16:09:37] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-11 16:09:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 16:09:37] [INFO ] Flow matrix only has 142 transitions (discarded 14 similar events)
[2023-03-11 16:09:37] [INFO ] Invariant cache hit.
[2023-03-11 16:09:37] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/261 places, 156/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 278 ms. Remains : 102/261 places, 156/325 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s72 0), p2:(EQ s72 1), p0:(EQ s99 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-11 finished in 449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U ((!p0||G(p1)) U p2)))'
Support contains 2 out of 261 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 325/325 transitions.
Graph (trivial) has 229 edges and 261 vertex of which 31 / 261 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 234 transition count 262
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 199 transition count 262
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 71 place count 199 transition count 244
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 107 place count 181 transition count 244
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 130 place count 158 transition count 221
Iterating global reduction 2 with 23 rules applied. Total rules applied 153 place count 158 transition count 221
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 153 place count 158 transition count 219
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 157 place count 156 transition count 219
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 163 place count 150 transition count 213
Iterating global reduction 2 with 6 rules applied. Total rules applied 169 place count 150 transition count 213
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 175 place count 150 transition count 207
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 253 place count 111 transition count 168
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 256 place count 108 transition count 165
Iterating global reduction 3 with 3 rules applied. Total rules applied 259 place count 108 transition count 165
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 262 place count 108 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 264 place count 107 transition count 162
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 271 place count 107 transition count 155
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 273 place count 105 transition count 153
Applied a total of 273 rules in 32 ms. Remains 105 /261 variables (removed 156) and now considering 153/325 (removed 172) transitions.
[2023-03-11 16:09:37] [INFO ] Flow matrix only has 143 transitions (discarded 10 similar events)
// Phase 1: matrix 143 rows 105 cols
[2023-03-11 16:09:37] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 16:09:37] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-11 16:09:37] [INFO ] Flow matrix only has 143 transitions (discarded 10 similar events)
[2023-03-11 16:09:37] [INFO ] Invariant cache hit.
[2023-03-11 16:09:37] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-11 16:09:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 16:09:37] [INFO ] Flow matrix only has 143 transitions (discarded 10 similar events)
[2023-03-11 16:09:37] [INFO ] Invariant cache hit.
[2023-03-11 16:09:37] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/261 places, 153/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 105/261 places, 153/325 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(OR (EQ s63 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-12 finished in 311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(p0)) U !p1))))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 325/325 transitions.
Graph (trivial) has 231 edges and 261 vertex of which 30 / 261 are part of one of the 5 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 235 transition count 263
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 199 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 198 transition count 261
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 76 place count 198 transition count 244
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 110 place count 181 transition count 244
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 134 place count 157 transition count 220
Iterating global reduction 3 with 24 rules applied. Total rules applied 158 place count 157 transition count 220
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 158 place count 157 transition count 218
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 162 place count 155 transition count 218
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 168 place count 149 transition count 212
Iterating global reduction 3 with 6 rules applied. Total rules applied 174 place count 149 transition count 212
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 179 place count 149 transition count 207
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 255 place count 111 transition count 169
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 259 place count 107 transition count 165
Iterating global reduction 4 with 4 rules applied. Total rules applied 263 place count 107 transition count 165
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 267 place count 107 transition count 161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 269 place count 106 transition count 161
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 276 place count 106 transition count 154
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 278 place count 104 transition count 152
Applied a total of 278 rules in 34 ms. Remains 104 /261 variables (removed 157) and now considering 152/325 (removed 173) transitions.
[2023-03-11 16:09:37] [INFO ] Flow matrix only has 142 transitions (discarded 10 similar events)
// Phase 1: matrix 142 rows 104 cols
[2023-03-11 16:09:37] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 16:09:37] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 16:09:37] [INFO ] Flow matrix only has 142 transitions (discarded 10 similar events)
[2023-03-11 16:09:37] [INFO ] Invariant cache hit.
[2023-03-11 16:09:38] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-11 16:09:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 16:09:38] [INFO ] Flow matrix only has 142 transitions (discarded 10 similar events)
[2023-03-11 16:09:38] [INFO ] Invariant cache hit.
[2023-03-11 16:09:38] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/261 places, 152/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 279 ms. Remains : 104/261 places, 152/325 transitions.
Stuttering acceptance computed with spot in 118 ms :[p1, (AND p1 (NOT p0)), p1]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s75 1), p0:(NEQ s13 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 1 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-13 finished in 420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 325/325 transitions.
Graph (trivial) has 237 edges and 261 vertex of which 37 / 261 are part of one of the 6 SCC in 0 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 229 transition count 260
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 197 transition count 260
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 65 place count 197 transition count 242
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 101 place count 179 transition count 242
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 126 place count 154 transition count 217
Iterating global reduction 2 with 25 rules applied. Total rules applied 151 place count 154 transition count 217
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 151 place count 154 transition count 216
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 153 place count 153 transition count 216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 159 place count 147 transition count 210
Iterating global reduction 2 with 6 rules applied. Total rules applied 165 place count 147 transition count 210
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 171 place count 147 transition count 204
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 245 place count 110 transition count 167
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 249 place count 106 transition count 163
Iterating global reduction 3 with 4 rules applied. Total rules applied 253 place count 106 transition count 163
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 257 place count 106 transition count 159
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 263 place count 106 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 265 place count 104 transition count 151
Applied a total of 265 rules in 34 ms. Remains 104 /261 variables (removed 157) and now considering 151/325 (removed 174) transitions.
[2023-03-11 16:09:38] [INFO ] Flow matrix only has 140 transitions (discarded 11 similar events)
// Phase 1: matrix 140 rows 104 cols
[2023-03-11 16:09:38] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 16:09:38] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-11 16:09:38] [INFO ] Flow matrix only has 140 transitions (discarded 11 similar events)
[2023-03-11 16:09:38] [INFO ] Invariant cache hit.
[2023-03-11 16:09:38] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-11 16:09:38] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-11 16:09:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 16:09:38] [INFO ] Flow matrix only has 140 transitions (discarded 11 similar events)
[2023-03-11 16:09:38] [INFO ] Invariant cache hit.
[2023-03-11 16:09:38] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/261 places, 151/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 104/261 places, 151/325 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s103 1), p0:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-14 finished in 347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U ((X(p0)&&(p1 U (p2&&F(p1))))||X(G(p0))))))'
[2023-03-11 16:09:38] [INFO ] Flatten gal took : 19 ms
[2023-03-11 16:09:38] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 16:09:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 261 places, 325 transitions and 881 arcs took 3 ms.
Total runtime 26261 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1589/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1589/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FlexibleBarrier-PT-06b-LTLFireability-02
Could not compute solution for formula : FlexibleBarrier-PT-06b-LTLFireability-05

BK_STOP 1678550980553

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name FlexibleBarrier-PT-06b-LTLFireability-02
ltl formula formula --ltl=/tmp/1589/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 261 places, 325 transitions and 881 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1589/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1589/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1589/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1589/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x56401272b3f4]
1: pnml2lts-mc(+0xa2496) [0x56401272b496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f8d92c36140]
3: pnml2lts-mc(+0x405be5) [0x564012a8ebe5]
4: pnml2lts-mc(+0x16b3f9) [0x5640127f43f9]
5: pnml2lts-mc(+0x164ac4) [0x5640127edac4]
6: pnml2lts-mc(+0x272e0a) [0x5640128fbe0a]
7: pnml2lts-mc(+0xb61f0) [0x56401273f1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f8d92a894d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f8d92a8967a]
10: pnml2lts-mc(+0xa1581) [0x56401272a581]
11: pnml2lts-mc(+0xa1910) [0x56401272a910]
12: pnml2lts-mc(+0xa32a2) [0x56401272c2a2]
13: pnml2lts-mc(+0xa50f4) [0x56401272e0f4]
14: pnml2lts-mc(+0xa516b) [0x56401272e16b]
15: pnml2lts-mc(+0x3f34b3) [0x564012a7c4b3]
16: pnml2lts-mc(+0x7c63d) [0x56401270563d]
17: pnml2lts-mc(+0x67d86) [0x5640126f0d86]
18: pnml2lts-mc(+0x60a8a) [0x5640126e9a8a]
19: pnml2lts-mc(+0x5eb15) [0x5640126e7b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f8d92a71d0a]
21: pnml2lts-mc(+0x6075e) [0x5640126e975e]
ltl formula name FlexibleBarrier-PT-06b-LTLFireability-05
ltl formula formula --ltl=/tmp/1589/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 261 places, 325 transitions and 881 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1589/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1589/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1589/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1589/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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-06b"
export BK_EXAMINATION="LTLFireability"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-06b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838855900468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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