Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640624700018.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r197-tall-171640624700018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 13 08:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 13 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-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 1716495732095

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 20:22:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 20:22:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:22:13] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-23 20:22:13] [INFO ] Transformed 542 places.
[2024-05-23 20:22:13] [INFO ] Transformed 621 transitions.
[2024-05-23 20:22:13] [INFO ] Found NUPN structural information;
[2024-05-23 20:22:13] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 144 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 5 formulas.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 621/621 transitions.
Discarding 179 places :
Symmetric choice reduction at 0 with 179 rule applications. Total rules 179 place count 363 transition count 442
Iterating global reduction 0 with 179 rules applied. Total rules applied 358 place count 363 transition count 442
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 430 place count 291 transition count 370
Iterating global reduction 0 with 72 rules applied. Total rules applied 502 place count 291 transition count 370
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 542 place count 251 transition count 330
Iterating global reduction 0 with 40 rules applied. Total rules applied 582 place count 251 transition count 330
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 599 place count 251 transition count 313
Applied a total of 599 rules in 81 ms. Remains 251 /542 variables (removed 291) and now considering 313/621 (removed 308) transitions.
// Phase 1: matrix 313 rows 251 cols
[2024-05-23 20:22:14] [INFO ] Computed 8 invariants in 23 ms
[2024-05-23 20:22:14] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-23 20:22:14] [INFO ] Invariant cache hit.
[2024-05-23 20:22:14] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2024-05-23 20:22:14] [INFO ] Invariant cache hit.
[2024-05-23 20:22:14] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 251/542 places, 313/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 740 ms. Remains : 251/542 places, 313/621 transitions.
Support contains 31 out of 251 places after structural reductions.
[2024-05-23 20:22:15] [INFO ] Flatten gal took : 45 ms
[2024-05-23 20:22:15] [INFO ] Flatten gal took : 19 ms
[2024-05-23 20:22:15] [INFO ] Input system was already deterministic with 313 transitions.
Support contains 30 out of 251 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 186 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 29) seen :21
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-23 20:22:15] [INFO ] Invariant cache hit.
[2024-05-23 20:22:15] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-23 20:22:16] [INFO ] After 133ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2024-05-23 20:22:16] [INFO ] After 211ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 20:22:16] [INFO ] After 427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 20:22:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-23 20:22:16] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 20:22:16] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 68 ms.
[2024-05-23 20:22:16] [INFO ] After 412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 72 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=24 )
Parikh walk visited 5 properties in 15 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Graph (trivial) has 230 edges and 251 vertex of which 37 / 251 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 219 transition count 249
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 188 transition count 249
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 63 place count 188 transition count 233
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 95 place count 172 transition count 233
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 117 place count 150 transition count 211
Iterating global reduction 2 with 22 rules applied. Total rules applied 139 place count 150 transition count 211
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 144 place count 145 transition count 206
Iterating global reduction 2 with 5 rules applied. Total rules applied 149 place count 145 transition count 206
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 153 place count 145 transition count 202
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 229 place count 107 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 232 place count 104 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 235 place count 104 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 238 place count 104 transition count 158
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 244 place count 104 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 246 place count 102 transition count 150
Applied a total of 246 rules in 57 ms. Remains 102 /251 variables (removed 149) and now considering 150/313 (removed 163) transitions.
[2024-05-23 20:22:17] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
// Phase 1: matrix 139 rows 102 cols
[2024-05-23 20:22:17] [INFO ] Computed 8 invariants in 2 ms
[2024-05-23 20:22:17] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-23 20:22:17] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2024-05-23 20:22:17] [INFO ] Invariant cache hit.
[2024-05-23 20:22:17] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-05-23 20:22:17] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 20:22:17] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2024-05-23 20:22:17] [INFO ] Invariant cache hit.
[2024-05-23 20:22:17] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/251 places, 150/313 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 102/251 places, 150/313 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 193 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 5847 steps with 449 reset in 71 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-00 finished in 742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p1)&&p0)) U p2))'
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Graph (trivial) has 226 edges and 251 vertex of which 37 / 251 are part of one of the 6 SCC in 1 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 219 transition count 250
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 189 transition count 250
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 61 place count 189 transition count 234
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 93 place count 173 transition count 234
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 114 place count 152 transition count 213
Iterating global reduction 2 with 21 rules applied. Total rules applied 135 place count 152 transition count 213
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 141 place count 146 transition count 207
Iterating global reduction 2 with 6 rules applied. Total rules applied 147 place count 146 transition count 207
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 152 place count 146 transition count 202
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 226 place count 109 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 227 place count 108 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 228 place count 108 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 229 place count 108 transition count 163
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 235 place count 108 transition count 157
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 237 place count 106 transition count 155
Applied a total of 237 rules in 49 ms. Remains 106 /251 variables (removed 145) and now considering 155/313 (removed 158) transitions.
[2024-05-23 20:22:17] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
// Phase 1: matrix 144 rows 106 cols
[2024-05-23 20:22:17] [INFO ] Computed 8 invariants in 4 ms
[2024-05-23 20:22:17] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-23 20:22:17] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
[2024-05-23 20:22:17] [INFO ] Invariant cache hit.
[2024-05-23 20:22:17] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-23 20:22:17] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 20:22:17] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
[2024-05-23 20:22:17] [INFO ] Invariant cache hit.
[2024-05-23 20:22:18] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/251 places, 155/313 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 545 ms. Remains : 106/251 places, 155/313 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s26 1) (EQ s8 1)), p0:(AND (EQ s26 1) (NEQ s8 1)), p1:(EQ s102 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 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 738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U p1)&&X((!p1 U G(p2)))))))'
Support contains 5 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 238 transition count 300
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 238 transition count 300
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 231 transition count 293
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 231 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 231 transition count 289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 229 transition count 287
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 229 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 229 transition count 285
Applied a total of 50 rules in 20 ms. Remains 229 /251 variables (removed 22) and now considering 285/313 (removed 28) transitions.
// Phase 1: matrix 285 rows 229 cols
[2024-05-23 20:22:18] [INFO ] Computed 8 invariants in 3 ms
[2024-05-23 20:22:18] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-23 20:22:18] [INFO ] Invariant cache hit.
[2024-05-23 20:22:18] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-23 20:22:18] [INFO ] Invariant cache hit.
[2024-05-23 20:22:18] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/251 places, 285/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 229/251 places, 285/313 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR p1 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s209 1), p0:(AND (EQ s98 1) (EQ s168 1) (EQ s220 1)), p2:(NEQ s69 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 105 steps with 1 reset in 3 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-04 finished in 734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 238 transition count 300
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 238 transition count 300
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 230 transition count 292
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 230 transition count 292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 230 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 229 transition count 285
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 229 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 229 transition count 284
Applied a total of 51 rules in 20 ms. Remains 229 /251 variables (removed 22) and now considering 284/313 (removed 29) transitions.
// Phase 1: matrix 284 rows 229 cols
[2024-05-23 20:22:19] [INFO ] Computed 8 invariants in 1 ms
[2024-05-23 20:22:19] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-23 20:22:19] [INFO ] Invariant cache hit.
[2024-05-23 20:22:19] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-23 20:22:19] [INFO ] Invariant cache hit.
[2024-05-23 20:22:19] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/251 places, 284/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 229/251 places, 284/313 transitions.
Stuttering acceptance computed with spot in 396 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 24974 reset in 238 ms.
Product exploration explored 100000 steps with 24938 reset in 236 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 (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1) p0)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 220 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 528 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 184 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 30 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 28 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 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 28 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-23 20:22:21] [INFO ] Invariant cache hit.
[2024-05-23 20:22:21] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 20:22:21] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 20:22:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-23 20:22:21] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 20:22:21] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 51 ms.
[2024-05-23 20:22:21] [INFO ] After 321ms 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 8 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 0 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 t5.t112.t239 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 31 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 31 ms. Remains : 7/229 places, 7/284 transitions.
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1) p0)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT 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 839 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 378 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 361 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 LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Applied a total of 0 rules in 6 ms. Remains 229 /229 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-05-23 20:22:23] [INFO ] Invariant cache hit.
[2024-05-23 20:22:23] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-23 20:22:23] [INFO ] Invariant cache hit.
[2024-05-23 20:22:23] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-23 20:22:23] [INFO ] Invariant cache hit.
[2024-05-23 20:22:23] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 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 p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 196 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 417 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 111 ms. (steps per millisecond=90 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-23 20:22:24] [INFO ] Invariant cache hit.
[2024-05-23 20:22:24] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-23 20:22:24] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 20:22:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-23 20:22:24] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 20:22:25] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-23 20:22:25] [INFO ] After 318ms 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 5 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.0 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 t5.t112.t239 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 31 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 31 ms. Remains : 7/229 places, 7/284 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2))))]
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 964 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 360 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 360 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 395 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 24989 reset in 146 ms.
Product exploration explored 100000 steps with 24894 reset in 148 ms.
Applying partial POR strategy [false, false, true, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 353 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 47 ms. Remains 155 /229 variables (removed 74) and now considering 219/284 (removed 65) transitions.
[2024-05-23 20:22:28] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-23 20:22:28] [INFO ] Flow matrix only has 208 transitions (discarded 11 similar events)
// Phase 1: matrix 208 rows 155 cols
[2024-05-23 20:22:28] [INFO ] Computed 8 invariants in 1 ms
[2024-05-23 20:22:28] [INFO ] Dead Transitions using invariants and state equation in 100 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 189 ms. Remains : 155/229 places, 219/284 transitions.
Built C files in :
/tmp/ltsmin7643459379871981454
[2024-05-23 20:22:28] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7643459379871981454
Running compilation step : cd /tmp/ltsmin7643459379871981454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 497 ms.
Running link step : cd /tmp/ltsmin7643459379871981454;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7643459379871981454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4206393590677034868.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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.
// Phase 1: matrix 284 rows 229 cols
[2024-05-23 20:22:43] [INFO ] Computed 8 invariants in 1 ms
[2024-05-23 20:22:43] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-23 20:22:43] [INFO ] Invariant cache hit.
[2024-05-23 20:22:43] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-23 20:22:43] [INFO ] Invariant cache hit.
[2024-05-23 20:22:43] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 397 ms. Remains : 229/229 places, 284/284 transitions.
Built C files in :
/tmp/ltsmin3391407184962156608
[2024-05-23 20:22:43] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3391407184962156608
Running compilation step : cd /tmp/ltsmin3391407184962156608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 393 ms.
Running link step : cd /tmp/ltsmin3391407184962156608;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3391407184962156608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3924069011182110356.hoa' '--buchi-type=spotba'
LTSmin run took 2706 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-05 finished in 27796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(X(p1)))||p0))))'
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 236 transition count 298
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 236 transition count 298
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 227 transition count 289
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 227 transition count 289
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 227 transition count 283
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 225 transition count 281
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 225 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 225 transition count 279
Applied a total of 60 rules in 12 ms. Remains 225 /251 variables (removed 26) and now considering 279/313 (removed 34) transitions.
// Phase 1: matrix 279 rows 225 cols
[2024-05-23 20:22:46] [INFO ] Computed 8 invariants in 1 ms
[2024-05-23 20:22:47] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-23 20:22:47] [INFO ] Invariant cache hit.
[2024-05-23 20:22:47] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-23 20:22:47] [INFO ] Invariant cache hit.
[2024-05-23 20:22:47] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/251 places, 279/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 225/251 places, 279/313 transitions.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (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: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}]], initial=0, aps=[p0:(OR (EQ s146 0) (EQ s224 0)), p1:(AND (EQ s146 1) (EQ s224 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1843 reset in 143 ms.
Product exploration explored 100000 steps with 1829 reset in 202 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 p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 184 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1019894 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :{}
Probabilistic random walk after 1019894 steps, saw 283903 distinct states, run finished after 3001 ms. (steps per millisecond=339 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-23 20:22:51] [INFO ] Invariant cache hit.
[2024-05-23 20:22:51] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 20:22:51] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-23 20:22:51] [INFO ] After 80ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-23 20:22:51] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2024-05-23 20:22:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 20:22:51] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 20:22:51] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-23 20:22:51] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 279/279 transitions.
Graph (trivial) has 202 edges and 225 vertex of which 37 / 225 are part of one of the 6 SCC in 0 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 194 transition count 213
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 166 transition count 213
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 166 transition count 200
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 153 transition count 200
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 142 transition count 189
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 142 transition count 189
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 2 with 78 rules applied. Total rules applied 183 place count 103 transition count 150
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 189 place count 103 transition count 144
Free-agglomeration rule applied 61 times.
Iterating global reduction 3 with 61 rules applied. Total rules applied 250 place count 103 transition count 83
Reduce places removed 61 places and 0 transitions.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 86 rules applied. Total rules applied 336 place count 42 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 337 place count 42 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 338 place count 41 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 339 place count 40 transition count 57
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 339 place count 40 transition count 56
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 341 place count 39 transition count 56
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 351 place count 34 transition count 51
Applied a total of 351 rules in 17 ms. Remains 34 /225 variables (removed 191) and now considering 51/279 (removed 228) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 34/225 places, 51/279 transitions.
Finished random walk after 58 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=58 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 279/279 transitions.
Applied a total of 0 rules in 3 ms. Remains 225 /225 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-05-23 20:22:51] [INFO ] Invariant cache hit.
[2024-05-23 20:22:51] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 20:22:51] [INFO ] Invariant cache hit.
[2024-05-23 20:22:52] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-23 20:22:52] [INFO ] Invariant cache hit.
[2024-05-23 20:22:52] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 308 ms. Remains : 225/225 places, 279/279 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 p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 184 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1011099 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1011099 steps, saw 281392 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-23 20:22:55] [INFO ] Invariant cache hit.
[2024-05-23 20:22:55] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 20:22:55] [INFO ] After 66ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-23 20:22:55] [INFO ] After 83ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-23 20:22:55] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2024-05-23 20:22:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 20:22:55] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 20:22:55] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-23 20:22:56] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 279/279 transitions.
Graph (trivial) has 202 edges and 225 vertex of which 37 / 225 are part of one of the 6 SCC in 0 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 194 transition count 213
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 166 transition count 213
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 166 transition count 200
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 153 transition count 200
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 142 transition count 189
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 142 transition count 189
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 2 with 78 rules applied. Total rules applied 183 place count 103 transition count 150
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 189 place count 103 transition count 144
Free-agglomeration rule applied 61 times.
Iterating global reduction 3 with 61 rules applied. Total rules applied 250 place count 103 transition count 83
Reduce places removed 61 places and 0 transitions.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 86 rules applied. Total rules applied 336 place count 42 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 337 place count 42 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 338 place count 41 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 339 place count 40 transition count 57
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 339 place count 40 transition count 56
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 341 place count 39 transition count 56
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 351 place count 34 transition count 51
Applied a total of 351 rules in 20 ms. Remains 34 /225 variables (removed 191) and now considering 51/279 (removed 228) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 34/225 places, 51/279 transitions.
Finished random walk after 47 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=47 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1840 reset in 111 ms.
Product exploration explored 100000 steps with 1830 reset in 117 ms.
Built C files in :
/tmp/ltsmin8181095842356768605
[2024-05-23 20:22:56] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8181095842356768605
Running compilation step : cd /tmp/ltsmin8181095842356768605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 368 ms.
Running link step : cd /tmp/ltsmin8181095842356768605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin8181095842356768605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased238340074395252890.hoa' '--buchi-type=spotba'
LTSmin run took 6020 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-06 finished in 16389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X(G((X(X(p1)) U (!p0||G(p1))))) U (p0&&X(G((X(X(p1)) U (!p0||G(p1)))))))))))'
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 238 transition count 300
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 238 transition count 300
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 231 transition count 293
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 231 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 231 transition count 289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 229 transition count 287
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 229 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 229 transition count 285
Applied a total of 50 rules in 12 ms. Remains 229 /251 variables (removed 22) and now considering 285/313 (removed 28) transitions.
// Phase 1: matrix 285 rows 229 cols
[2024-05-23 20:23:03] [INFO ] Computed 8 invariants in 3 ms
[2024-05-23 20:23:03] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-23 20:23:03] [INFO ] Invariant cache hit.
[2024-05-23 20:23:03] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-23 20:23:03] [INFO ] Invariant cache hit.
[2024-05-23 20:23:03] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/251 places, 285/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 229/251 places, 285/313 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(NEQ s10 1), p1:(EQ s138 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 160 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 p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-06b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-07 finished in 930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Graph (trivial) has 205 edges and 251 vertex of which 37 / 251 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 219 transition count 249
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 188 transition count 249
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 63 place count 188 transition count 233
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 95 place count 172 transition count 233
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 118 place count 149 transition count 210
Iterating global reduction 2 with 23 rules applied. Total rules applied 141 place count 149 transition count 210
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 147 place count 143 transition count 204
Iterating global reduction 2 with 6 rules applied. Total rules applied 153 place count 143 transition count 204
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 159 place count 143 transition count 198
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 235 place count 105 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 237 place count 103 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 103 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 241 place count 103 transition count 156
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 101 transition count 154
Applied a total of 243 rules in 25 ms. Remains 101 /251 variables (removed 150) and now considering 154/313 (removed 159) transitions.
[2024-05-23 20:23:04] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
// Phase 1: matrix 138 rows 101 cols
[2024-05-23 20:23:04] [INFO ] Computed 8 invariants in 1 ms
[2024-05-23 20:23:04] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 20:23:04] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-05-23 20:23:04] [INFO ] Invariant cache hit.
[2024-05-23 20:23:04] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-23 20:23:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 20:23:04] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-05-23 20:23:04] [INFO ] Invariant cache hit.
[2024-05-23 20:23:04] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/251 places, 154/313 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 276 ms. Remains : 101/251 places, 154/313 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s98 1), p1:(EQ s98 0)], nbAcceptance=2, 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 7134 reset in 223 ms.
Stack based approach found an accepted trace after 141 steps with 10 reset with depth 5 and stack size 5 in 1 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-08 finished in 540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Graph (trivial) has 222 edges and 251 vertex of which 31 / 251 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 224 transition count 254
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 193 transition count 254
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 63 place count 193 transition count 236
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 99 place count 175 transition count 236
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 119 place count 155 transition count 216
Iterating global reduction 2 with 20 rules applied. Total rules applied 139 place count 155 transition count 216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 145 place count 149 transition count 210
Iterating global reduction 2 with 6 rules applied. Total rules applied 151 place count 149 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 157 place count 149 transition count 204
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 239 place count 108 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 240 place count 107 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 241 place count 107 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 242 place count 107 transition count 161
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 246 place count 105 transition count 168
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 254 place count 105 transition count 160
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 255 place count 104 transition count 159
Applied a total of 255 rules in 31 ms. Remains 104 /251 variables (removed 147) and now considering 159/313 (removed 154) transitions.
[2024-05-23 20:23:04] [INFO ] Flow matrix only has 149 transitions (discarded 10 similar events)
// Phase 1: matrix 149 rows 104 cols
[2024-05-23 20:23:04] [INFO ] Computed 8 invariants in 2 ms
[2024-05-23 20:23:04] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-23 20:23:04] [INFO ] Flow matrix only has 149 transitions (discarded 10 similar events)
[2024-05-23 20:23:04] [INFO ] Invariant cache hit.
[2024-05-23 20:23:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:23:04] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-23 20:23:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 20:23:04] [INFO ] Flow matrix only has 149 transitions (discarded 10 similar events)
[2024-05-23 20:23:04] [INFO ] Invariant cache hit.
[2024-05-23 20:23:05] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/251 places, 159/313 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 299 ms. Remains : 104/251 places, 159/313 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s50 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-10 finished in 348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U (X(p1)&&(p2 U (p3||G(p2)))))))'
Support contains 4 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 238 transition count 300
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 238 transition count 300
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 231 transition count 293
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 231 transition count 293
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 45 place count 231 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 230 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 230 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 230 transition count 286
Applied a total of 48 rules in 13 ms. Remains 230 /251 variables (removed 21) and now considering 286/313 (removed 27) transitions.
// Phase 1: matrix 286 rows 230 cols
[2024-05-23 20:23:05] [INFO ] Computed 8 invariants in 18 ms
[2024-05-23 20:23:05] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-23 20:23:05] [INFO ] Invariant cache hit.
[2024-05-23 20:23:05] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-05-23 20:23:05] [INFO ] Invariant cache hit.
[2024-05-23 20:23:05] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/251 places, 286/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 230/251 places, 286/313 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=0 dest: 3}, { cond=(OR p3 p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 3}, { cond=(OR p3 p2), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND p3 (NOT p0) (NOT p1)) (AND p2 (NOT p0) (NOT p1))), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(OR (AND p3 (NOT p0) (NOT p1)) (AND p2 (NOT p0) (NOT p1))), acceptance={} source=4 dest: 3}, { cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (NEQ s192 1) (NEQ s75 1)), p2:(NEQ s192 1), p0:(NEQ s67 1), p1:(NEQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33375 reset in 197 ms.
Product exploration explored 100000 steps with 33358 reset in 187 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 p3 p2 p0 p1), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (OR (AND p3 (NOT p0)) (AND p2 (NOT p0))))), (X p0), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (OR (AND p3 (NOT p0) (NOT p1)) (AND p2 (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (OR p3 p2)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND p2 (NOT p0)))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (OR (AND p3 (NOT p0) (NOT p1)) (AND p2 (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (OR p3 p2))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1))))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 177 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter sensitive) to 6 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3)), (NOT p1), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 183 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-23 20:23:06] [INFO ] Invariant cache hit.
[2024-05-23 20:23:06] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 20:23:07] [INFO ] After 60ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:2
[2024-05-23 20:23:07] [INFO ] After 75ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-23 20:23:07] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :1 real:2
[2024-05-23 20:23:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 20:23:07] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-23 20:23:07] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-23 20:23:07] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 286/286 transitions.
Graph (trivial) has 200 edges and 230 vertex of which 30 / 230 are part of one of the 5 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 205 transition count 229
Reduce places removed 27 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 29 rules applied. Total rules applied 57 place count 178 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 177 transition count 227
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 58 place count 177 transition count 212
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 88 place count 162 transition count 212
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 98 place count 152 transition count 202
Iterating global reduction 3 with 10 rules applied. Total rules applied 108 place count 152 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 150 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 150 transition count 200
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 196 place count 108 transition count 158
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 207 place count 108 transition count 147
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 213 place count 102 transition count 141
Iterating global reduction 4 with 6 rules applied. Total rules applied 219 place count 102 transition count 141
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 221 place count 101 transition count 141
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 223 place count 101 transition count 139
Free-agglomeration rule applied 58 times.
Iterating global reduction 4 with 58 rules applied. Total rules applied 281 place count 101 transition count 81
Reduce places removed 58 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 78 rules applied. Total rules applied 359 place count 43 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 360 place count 42 transition count 60
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 42 edges and 40 vertex of which 27 / 40 are part of one of the 6 SCC in 0 ms
Free SCC test removed 21 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 364 place count 19 transition count 59
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 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 6 with 42 rules applied. Total rules applied 406 place count 15 transition count 21
Reduce places removed 1 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 7 with 3 rules applied. Total rules applied 409 place count 14 transition count 19
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 8 with 5 rules applied. Total rules applied 414 place count 13 transition count 15
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 422 place count 9 transition count 11
Applied a total of 422 rules in 23 ms. Remains 9 /230 variables (removed 221) and now considering 11/286 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 9/230 places, 11/286 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p3 p2 p0 p1), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (OR (AND p3 (NOT p0)) (AND p2 (NOT p0))))), (X p0), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (OR (AND p3 (NOT p0) (NOT p1)) (AND p2 (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (OR p3 p2)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND p2 (NOT p0)))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (OR (AND p3 (NOT p0) (NOT p1)) (AND p2 (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (OR p3 p2))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))))), (G (NOT (OR (AND p2 (NOT p1) (NOT p0)) (AND p3 (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p3))), (F (AND p2 (NOT p3))), (F (AND (NOT p2) (NOT p3) (NOT p0))), (F (OR (AND p2 (NOT p0)) (AND p3 (NOT p0)))), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p3) (NOT p1))), (F (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))), (F (AND p2 (NOT p3) (NOT p1))), (F (OR (AND p2 (NOT p1)) (AND p3 (NOT p1))))]
Knowledge based reduction with 24 factoid took 535 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter sensitive) to 5 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 286/286 transitions.
Applied a total of 0 rules in 5 ms. Remains 230 /230 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2024-05-23 20:23:08] [INFO ] Invariant cache hit.
[2024-05-23 20:23:08] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-23 20:23:08] [INFO ] Invariant cache hit.
[2024-05-23 20:23:08] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-23 20:23:08] [INFO ] Invariant cache hit.
[2024-05-23 20:23:08] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 230/230 places, 286/286 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 p0 p3 p2 p1), (X p0), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (OR p3 p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (OR p3 p2))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 114 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter sensitive) to 5 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 182 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-23 20:23:09] [INFO ] Invariant cache hit.
[2024-05-23 20:23:09] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-23 20:23:09] [INFO ] After 62ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:2
[2024-05-23 20:23:09] [INFO ] After 86ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-23 20:23:09] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:2
[2024-05-23 20:23:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 20:23:09] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-23 20:23:09] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-23 20:23:09] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 3 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 286/286 transitions.
Graph (trivial) has 200 edges and 230 vertex of which 30 / 230 are part of one of the 5 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 205 transition count 229
Reduce places removed 27 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 29 rules applied. Total rules applied 57 place count 178 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 177 transition count 227
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 58 place count 177 transition count 212
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 88 place count 162 transition count 212
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 98 place count 152 transition count 202
Iterating global reduction 3 with 10 rules applied. Total rules applied 108 place count 152 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 150 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 150 transition count 200
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 196 place count 108 transition count 158
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 207 place count 108 transition count 147
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 213 place count 102 transition count 141
Iterating global reduction 4 with 6 rules applied. Total rules applied 219 place count 102 transition count 141
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 221 place count 101 transition count 141
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 223 place count 101 transition count 139
Free-agglomeration rule applied 58 times.
Iterating global reduction 4 with 58 rules applied. Total rules applied 281 place count 101 transition count 81
Reduce places removed 58 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 78 rules applied. Total rules applied 359 place count 43 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 360 place count 42 transition count 60
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 42 edges and 40 vertex of which 27 / 40 are part of one of the 6 SCC in 0 ms
Free SCC test removed 21 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 364 place count 19 transition count 59
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 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 6 with 42 rules applied. Total rules applied 406 place count 15 transition count 21
Reduce places removed 1 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 7 with 3 rules applied. Total rules applied 409 place count 14 transition count 19
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 8 with 5 rules applied. Total rules applied 414 place count 13 transition count 15
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 422 place count 9 transition count 11
Applied a total of 422 rules in 20 ms. Remains 9 /230 variables (removed 221) and now considering 11/286 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 9/230 places, 11/286 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p3 p2 p1), (X p0), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (OR p3 p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (OR p3 p2))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(F (AND p2 (NOT p3))), (F (NOT p0)), (F (AND (NOT p2) (NOT p3) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p3) (NOT p0))), (F (NOT (OR p2 p3))), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3) (NOT p1))), (F (OR (AND p2 (NOT p1)) (AND p3 (NOT p1))))]
Knowledge based reduction with 19 factoid took 417 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter sensitive) to 5 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 33450 reset in 155 ms.
Product exploration explored 100000 steps with 33447 reset in 157 ms.
Applying partial POR strategy [false, true, false, false, false]
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 286/286 transitions.
Graph (trivial) has 193 edges and 230 vertex of which 24 / 230 are part of one of the 4 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 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 210 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 210 transition count 265
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 27 place count 210 transition count 266
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 44 place count 210 transition count 266
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 66 place count 188 transition count 244
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 88 place count 188 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 187 transition count 243
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 187 transition count 243
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 70 places in 1 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 132 place count 187 transition count 255
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 153 place count 166 transition count 234
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 174 place count 166 transition count 234
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 183 place count 166 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 187 place count 162 transition count 263
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 191 place count 162 transition count 263
Deduced a syphon composed of 54 places in 0 ms
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 207 place count 162 transition count 247
Deduced a syphon composed of 54 places in 0 ms
Applied a total of 207 rules in 26 ms. Remains 162 /230 variables (removed 68) and now considering 247/286 (removed 39) transitions.
[2024-05-23 20:23:11] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-23 20:23:11] [INFO ] Flow matrix only has 238 transitions (discarded 9 similar events)
// Phase 1: matrix 238 rows 162 cols
[2024-05-23 20:23:11] [INFO ] Computed 8 invariants in 2 ms
[2024-05-23 20:23:11] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/230 places, 247/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 162/230 places, 247/286 transitions.
Built C files in :
/tmp/ltsmin8599989956480475303
[2024-05-23 20:23:11] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8599989956480475303
Running compilation step : cd /tmp/ltsmin8599989956480475303;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 367 ms.
Running link step : cd /tmp/ltsmin8599989956480475303;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8599989956480475303;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15965374713050577479.hoa' '--buchi-type=spotba'
LTSmin run took 283 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-11 finished in 7055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G((F(p1) U p2))))))'
Support contains 4 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 237 transition count 299
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 237 transition count 299
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 228 transition count 290
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 228 transition count 290
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 228 transition count 284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 226 transition count 282
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 226 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 226 transition count 280
Applied a total of 58 rules in 10 ms. Remains 226 /251 variables (removed 25) and now considering 280/313 (removed 33) transitions.
// Phase 1: matrix 280 rows 226 cols
[2024-05-23 20:23:12] [INFO ] Computed 8 invariants in 3 ms
[2024-05-23 20:23:12] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-23 20:23:12] [INFO ] Invariant cache hit.
[2024-05-23 20:23:12] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-23 20:23:12] [INFO ] Invariant cache hit.
[2024-05-23 20:23:12] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/251 places, 280/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 226/251 places, 280/313 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s68 1), p1:(EQ s34 1), p0:(AND (EQ s25 1) (EQ s225 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 59 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 628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((X(G(p1))&&((p3 U p4)||p2))))))'
Support contains 5 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 239 transition count 301
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 239 transition count 301
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 232 transition count 294
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 232 transition count 294
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 232 transition count 289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 230 transition count 287
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 230 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 230 transition count 285
Applied a total of 49 rules in 9 ms. Remains 230 /251 variables (removed 21) and now considering 285/313 (removed 28) transitions.
// Phase 1: matrix 285 rows 230 cols
[2024-05-23 20:23:12] [INFO ] Computed 8 invariants in 3 ms
[2024-05-23 20:23:12] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-23 20:23:12] [INFO ] Invariant cache hit.
[2024-05-23 20:23:13] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-23 20:23:13] [INFO ] Invariant cache hit.
[2024-05-23 20:23:13] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/251 places, 285/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 298 ms. Remains : 230/251 places, 285/313 transitions.
Stuttering acceptance computed with spot in 367 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (NOT p4), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p1) p4) (AND (NOT p1) p2) (AND (NOT p1) p3))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p4) (AND (NOT p0) p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p4) p3), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p4) (AND (NOT p0) p3)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p3) p1), acceptance={} source=5 dest: 2}, { cond=(OR (AND p2 (NOT p1)) (AND p4 (NOT p1)) (AND p3 (NOT p1))), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p4) p3), acceptance={} source=5 dest: 4}, { cond=(OR p2 p4 p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s215 1), p2:(OR (EQ s41 1) (EQ s193 1)), p4:(EQ s55 1), p3:(EQ s62 1), p1:(EQ s41 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 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-13 finished in 691 ms.
All properties solved by simple procedures.
Total runtime 59919 ms.

BK_STOP 1716495794659

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
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 r197-tall-171640624700018"
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 ;