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-171640624700028.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-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640624700028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 241K 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-08b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716495774153

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-08b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 20:22:55] [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:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:22:55] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-23 20:22:55] [INFO ] Transformed 920 places.
[2024-05-23 20:22:55] [INFO ] Transformed 1057 transitions.
[2024-05-23 20:22:55] [INFO ] Found NUPN structural information;
[2024-05-23 20:22:55] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 153 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 4 formulas.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Discarding 332 places :
Symmetric choice reduction at 0 with 332 rule applications. Total rules 332 place count 588 transition count 725
Iterating global reduction 0 with 332 rules applied. Total rules applied 664 place count 588 transition count 725
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 810 place count 442 transition count 579
Iterating global reduction 0 with 146 rules applied. Total rules applied 956 place count 442 transition count 579
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 1038 place count 360 transition count 497
Iterating global reduction 0 with 82 rules applied. Total rules applied 1120 place count 360 transition count 497
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 1154 place count 360 transition count 463
Applied a total of 1154 rules in 242 ms. Remains 360 /920 variables (removed 560) and now considering 463/1057 (removed 594) transitions.
// Phase 1: matrix 463 rows 360 cols
[2024-05-23 20:22:56] [INFO ] Computed 10 invariants in 25 ms
[2024-05-23 20:22:56] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-23 20:22:56] [INFO ] Invariant cache hit.
[2024-05-23 20:22:56] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-05-23 20:22:56] [INFO ] Invariant cache hit.
[2024-05-23 20:22:56] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 360/920 places, 463/1057 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 970 ms. Remains : 360/920 places, 463/1057 transitions.
Support contains 38 out of 360 places after structural reductions.
[2024-05-23 20:22:57] [INFO ] Flatten gal took : 52 ms
[2024-05-23 20:22:57] [INFO ] Flatten gal took : 24 ms
[2024-05-23 20:22:57] [INFO ] Input system was already deterministic with 463 transitions.
Incomplete random walk after 10000 steps, including 153 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 23) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :1
Running SMT prover for 13 properties.
[2024-05-23 20:22:57] [INFO ] Invariant cache hit.
[2024-05-23 20:22:57] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-23 20:22:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 20:22:58] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-23 20:22:58] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 4 ms to minimize.
[2024-05-23 20:22:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2024-05-23 20:22:58] [INFO ] After 800ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 192 ms.
[2024-05-23 20:22:59] [INFO ] After 1222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 6 properties in 53 ms.
Support contains 10 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 463/463 transitions.
Graph (trivial) has 322 edges and 360 vertex of which 49 / 360 are part of one of the 8 SCC in 4 ms
Free SCC test removed 41 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 319 transition count 372
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 278 transition count 372
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 83 place count 278 transition count 356
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 115 place count 262 transition count 356
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 142 place count 235 transition count 329
Iterating global reduction 2 with 27 rules applied. Total rules applied 169 place count 235 transition count 329
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 174 place count 235 transition count 324
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 178 place count 231 transition count 320
Iterating global reduction 3 with 4 rules applied. Total rules applied 182 place count 231 transition count 320
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 185 place count 231 transition count 317
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 287 place count 180 transition count 266
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 295 place count 180 transition count 258
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 298 place count 177 transition count 255
Iterating global reduction 5 with 3 rules applied. Total rules applied 301 place count 177 transition count 255
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 304 place count 177 transition count 252
Free-agglomeration rule applied 114 times.
Iterating global reduction 6 with 114 rules applied. Total rules applied 418 place count 177 transition count 138
Reduce places removed 114 places and 0 transitions.
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 6 with 155 rules applied. Total rules applied 573 place count 63 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 574 place count 62 transition count 96
Applied a total of 574 rules in 83 ms. Remains 62 /360 variables (removed 298) and now considering 96/463 (removed 367) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 62/360 places, 96/463 transitions.
Finished random walk after 1075 steps, including 3 resets, run visited all 7 properties in 9 ms. (steps per millisecond=119 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 11 stabilizing places and 11 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' '!(F((X(G(p0))&&G(p1))))'
Support contains 5 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Graph (trivial) has 328 edges and 360 vertex of which 49 / 360 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 318 transition count 377
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 275 transition count 377
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 87 place count 275 transition count 359
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 123 place count 257 transition count 359
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 154 place count 226 transition count 328
Iterating global reduction 2 with 31 rules applied. Total rules applied 185 place count 226 transition count 328
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 190 place count 226 transition count 323
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 196 place count 220 transition count 317
Iterating global reduction 3 with 6 rules applied. Total rules applied 202 place count 220 transition count 317
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 208 place count 220 transition count 311
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 304 place count 172 transition count 263
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 306 place count 170 transition count 261
Iterating global reduction 4 with 2 rules applied. Total rules applied 308 place count 170 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 310 place count 170 transition count 259
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 318 place count 170 transition count 251
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 320 place count 168 transition count 249
Applied a total of 320 rules in 79 ms. Remains 168 /360 variables (removed 192) and now considering 249/463 (removed 214) transitions.
[2024-05-23 20:22:59] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
// Phase 1: matrix 234 rows 168 cols
[2024-05-23 20:22:59] [INFO ] Computed 10 invariants in 2 ms
[2024-05-23 20:22:59] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-23 20:22:59] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-23 20:22:59] [INFO ] Invariant cache hit.
[2024-05-23 20:22:59] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-23 20:22:59] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-23 20:22:59] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-23 20:22:59] [INFO ] Invariant cache hit.
[2024-05-23 20:22:59] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/360 places, 249/463 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 407 ms. Remains : 168/360 places, 249/463 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 220 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s113 1), p0:(AND (EQ s76 0) (OR (EQ s54 0) (EQ s73 0) (EQ s150 0)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 315 steps with 21 reset in 8 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-00 finished in 681 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(((X(p0)&&G((X(p1)&&(p1||G(p2)))))||G(p0))))'
Support contains 5 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 343 transition count 446
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 343 transition count 446
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 343 transition count 441
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 334 transition count 432
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 334 transition count 432
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 65 place count 334 transition count 424
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 333 transition count 423
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 333 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 333 transition count 422
Applied a total of 68 rules in 21 ms. Remains 333 /360 variables (removed 27) and now considering 422/463 (removed 41) transitions.
// Phase 1: matrix 422 rows 333 cols
[2024-05-23 20:23:00] [INFO ] Computed 10 invariants in 2 ms
[2024-05-23 20:23:00] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-23 20:23:00] [INFO ] Invariant cache hit.
[2024-05-23 20:23:00] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-23 20:23:00] [INFO ] Invariant cache hit.
[2024-05-23 20:23:00] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 333/360 places, 422/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 333/360 places, 422/463 transitions.
Stuttering acceptance computed with spot in 308 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, (AND p1 (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=0 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=0 dest: 3}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0} source=0 dest: 4}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 2} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=2 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=3 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 2} source=3 dest: 4}, { cond=(AND p1 p2 p0), acceptance={1} source=3 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=3 dest: 5}, { cond=(AND p1 p2 p0), acceptance={1} source=3 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=3 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=3 dest: 7}], [{ cond=(AND p1 p0), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 2} source=5 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=5 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=5 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=6 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=6 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=7 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=7 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 2} source=7 dest: 4}, { cond=(AND p1 p2 p0), acceptance={1} source=7 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=7 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=7 dest: 7}]], initial=0, aps=[p1:(NEQ s24 1), p2:(AND (EQ s172 1) (EQ s248 1) (EQ s324 1)), p0:(NEQ s306 1)], nbAcceptance=3, 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 37476 reset in 360 ms.
Product exploration explored 100000 steps with 37585 reset in 334 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (OR (AND p1 p0) (AND p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (AND p1 p0)), (X (AND p1 (NOT p2) p0)), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 p0))), (X (X (AND p1 (NOT p2) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 288 ms. Reduced automaton from 8 states, 61 edges and 3 AP (stutter sensitive) to 8 states, 61 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 155 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-23 20:23:02] [INFO ] Invariant cache hit.
[2024-05-23 20:23:02] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-23 20:23:03] [INFO ] After 102ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:8
[2024-05-23 20:23:03] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 1 ms to minimize.
[2024-05-23 20:23:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-23 20:23:03] [INFO ] After 195ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:9
[2024-05-23 20:23:03] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2024-05-23 20:23:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-23 20:23:03] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2024-05-23 20:23:03] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 2 ms to minimize.
[2024-05-23 20:23:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-23 20:23:03] [INFO ] After 476ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 110 ms.
[2024-05-23 20:23:03] [INFO ] After 704ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 5 properties in 15 ms.
Support contains 5 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 422/422 transitions.
Graph (trivial) has 300 edges and 333 vertex of which 49 / 333 are part of one of the 8 SCC in 0 ms
Free SCC test removed 41 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 292 transition count 333
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 253 transition count 333
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 79 place count 253 transition count 316
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 113 place count 236 transition count 316
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 128 place count 221 transition count 301
Iterating global reduction 2 with 15 rules applied. Total rules applied 143 place count 221 transition count 301
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 245 place count 170 transition count 250
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 261 place count 170 transition count 234
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 269 place count 162 transition count 226
Iterating global reduction 3 with 8 rules applied. Total rules applied 277 place count 162 transition count 226
Free-agglomeration rule applied 113 times.
Iterating global reduction 3 with 113 rules applied. Total rules applied 390 place count 162 transition count 113
Reduce places removed 113 places and 0 transitions.
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 3 with 154 rules applied. Total rules applied 544 place count 49 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 545 place count 48 transition count 71
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 40 edges and 47 vertex of which 16 / 47 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 547 place count 39 transition count 71
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 563 place count 39 transition count 55
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 563 place count 39 transition count 47
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 579 place count 31 transition count 47
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 586 place count 31 transition count 40
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 600 place count 24 transition count 33
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 607 place count 24 transition count 26
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 630 place count 12 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 631 place count 12 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 633 place count 11 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 634 place count 11 transition count 12
Applied a total of 634 rules in 42 ms. Remains 11 /333 variables (removed 322) and now considering 12/422 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 11/333 places, 12/422 transitions.
Finished random walk after 37 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (OR (AND p1 p0) (AND p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (AND p1 p0)), (X (AND p1 (NOT p2) p0)), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 p0))), (X (X (AND p1 (NOT p2) p0))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2)), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 26 factoid took 1101 ms. Reduced automaton from 8 states, 61 edges and 3 AP (stutter sensitive) to 7 states, 50 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(NOT p0), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), false, (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2)), (AND (NOT p0) p1 p2)]
Stuttering acceptance computed with spot in 339 ms :[(NOT p0), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), false, (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2)), (AND (NOT p0) p1 p2)]
Support contains 5 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 422/422 transitions.
Applied a total of 0 rules in 10 ms. Remains 333 /333 variables (removed 0) and now considering 422/422 (removed 0) transitions.
[2024-05-23 20:23:05] [INFO ] Invariant cache hit.
[2024-05-23 20:23:05] [INFO ] Implicit Places using invariants in 94 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 179 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-23 20:23:05] [INFO ] Invariant cache hit.
[2024-05-23 20:23:06] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 427 ms. Remains : 333/333 places, 422/422 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (AND p0 p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND p0 p1) (AND p0 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 246 ms. Reduced automaton from 7 states, 50 edges and 3 AP (stutter sensitive) to 7 states, 50 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(NOT p0), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), false, (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2)), (AND (NOT p0) p1 p2)]
Incomplete random walk after 10000 steps, including 152 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-23 20:23:07] [INFO ] Invariant cache hit.
[2024-05-23 20:23:07] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-23 20:23:07] [INFO ] After 104ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:7
[2024-05-23 20:23:07] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-23 20:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-05-23 20:23:07] [INFO ] After 210ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:8
[2024-05-23 20:23:07] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2024-05-23 20:23:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-23 20:23:07] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2024-05-23 20:23:07] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-23 20:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-05-23 20:23:08] [INFO ] After 477ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 115 ms.
[2024-05-23 20:23:08] [INFO ] After 714ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 5 properties in 14 ms.
Support contains 5 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 422/422 transitions.
Graph (trivial) has 300 edges and 333 vertex of which 49 / 333 are part of one of the 8 SCC in 0 ms
Free SCC test removed 41 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 292 transition count 333
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 253 transition count 333
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 79 place count 253 transition count 316
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 113 place count 236 transition count 316
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 128 place count 221 transition count 301
Iterating global reduction 2 with 15 rules applied. Total rules applied 143 place count 221 transition count 301
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 245 place count 170 transition count 250
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 261 place count 170 transition count 234
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 269 place count 162 transition count 226
Iterating global reduction 3 with 8 rules applied. Total rules applied 277 place count 162 transition count 226
Free-agglomeration rule applied 113 times.
Iterating global reduction 3 with 113 rules applied. Total rules applied 390 place count 162 transition count 113
Reduce places removed 113 places and 0 transitions.
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 3 with 154 rules applied. Total rules applied 544 place count 49 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 545 place count 48 transition count 71
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 40 edges and 47 vertex of which 16 / 47 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 547 place count 39 transition count 71
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 563 place count 39 transition count 55
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 563 place count 39 transition count 47
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 579 place count 31 transition count 47
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 586 place count 31 transition count 40
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 600 place count 24 transition count 33
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 607 place count 24 transition count 26
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 630 place count 12 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 631 place count 12 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 633 place count 11 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 634 place count 11 transition count 12
Applied a total of 634 rules in 35 ms. Remains 11 /333 variables (removed 322) and now considering 12/422 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 11/333 places, 12/422 transitions.
Finished random walk after 20 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (AND p0 p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND p0 p1) (AND p0 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 23 factoid took 1074 ms. Reduced automaton from 7 states, 50 edges and 3 AP (stutter sensitive) to 7 states, 50 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(NOT p0), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), false, (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2)), (AND (NOT p0) p1 p2)]
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), false, (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2)), (AND (NOT p0) p1 p2)]
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), false, (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2)), (AND (NOT p0) p1 p2)]
Product exploration explored 100000 steps with 37435 reset in 310 ms.
Product exploration explored 100000 steps with 37470 reset in 282 ms.
Built C files in :
/tmp/ltsmin1156390356724178480
[2024-05-23 20:23:11] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1156390356724178480
Running compilation step : cd /tmp/ltsmin1156390356724178480;'/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 636 ms.
Running link step : cd /tmp/ltsmin1156390356724178480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1156390356724178480;'/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/stateBased13123505699527256147.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 422/422 transitions.
Applied a total of 0 rules in 10 ms. Remains 333 /333 variables (removed 0) and now considering 422/422 (removed 0) transitions.
[2024-05-23 20:23:26] [INFO ] Invariant cache hit.
[2024-05-23 20:23:26] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-23 20:23:26] [INFO ] Invariant cache hit.
[2024-05-23 20:23:26] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-23 20:23:26] [INFO ] Invariant cache hit.
[2024-05-23 20:23:26] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 459 ms. Remains : 333/333 places, 422/422 transitions.
Built C files in :
/tmp/ltsmin18361276612136647559
[2024-05-23 20:23:26] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18361276612136647559
Running compilation step : cd /tmp/ltsmin18361276612136647559;'/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 557 ms.
Running link step : cd /tmp/ltsmin18361276612136647559;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18361276612136647559;'/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/stateBased12156293876025934292.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 20:23:41] [INFO ] Flatten gal took : 17 ms
[2024-05-23 20:23:41] [INFO ] Flatten gal took : 17 ms
[2024-05-23 20:23:41] [INFO ] Time to serialize gal into /tmp/LTL3156966381453420043.gal : 5 ms
[2024-05-23 20:23:41] [INFO ] Time to serialize properties into /tmp/LTL13092509983844144687.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3156966381453420043.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16722946327775637637.hoa' '-atoms' '/tmp/LTL13092509983844144687.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13092509983844144687.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16722946327775637637.hoa
Detected timeout of ITS tools.
[2024-05-23 20:23:56] [INFO ] Flatten gal took : 16 ms
[2024-05-23 20:23:56] [INFO ] Flatten gal took : 15 ms
[2024-05-23 20:23:56] [INFO ] Time to serialize gal into /tmp/LTL18204806437685253075.gal : 3 ms
[2024-05-23 20:23:56] [INFO ] Time to serialize properties into /tmp/LTL8871807643188497677.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18204806437685253075.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8871807643188497677.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(p804!=1)"))||((X("(p804!=1)"))&&(G((X("(p66!=1)"))&&(("(p66!=1)")||(G("(((p424==1)&&(p617==1))&&(p891==1))")))))))))
Formula 0 simplified : G(F!"(p804!=1)" & (X!"(p804!=1)" | F(X!"(p66!=1)" | (!"(p66!=1)" & F!"(((p424==1)&&(p617==1))&&(p891==1))"))))
Detected timeout of ITS tools.
[2024-05-23 20:24:11] [INFO ] Flatten gal took : 15 ms
[2024-05-23 20:24:11] [INFO ] Applying decomposition
[2024-05-23 20:24:11] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13637618749567129797.txt' '-o' '/tmp/graph13637618749567129797.bin' '-w' '/tmp/graph13637618749567129797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13637618749567129797.bin' '-l' '-1' '-v' '-w' '/tmp/graph13637618749567129797.weights' '-q' '0' '-e' '0.001'
[2024-05-23 20:24:12] [INFO ] Decomposing Gal with order
[2024-05-23 20:24:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:24:12] [INFO ] Removed a total of 204 redundant transitions.
[2024-05-23 20:24:12] [INFO ] Flatten gal took : 62 ms
[2024-05-23 20:24:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 10 ms.
[2024-05-23 20:24:12] [INFO ] Time to serialize gal into /tmp/LTL4797642909652279118.gal : 6 ms
[2024-05-23 20:24:12] [INFO ] Time to serialize properties into /tmp/LTL8023273208751975313.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4797642909652279118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8023273208751975313.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G("(i15.u85.p804!=1)"))||((X("(i15.u85.p804!=1)"))&&(G((X("(i0.u8.p66!=1)"))&&(("(i0.u8.p66!=1)")||(G("(((i9.u45.p424==1)&&(i14....198
Formula 0 simplified : G(F!"(i15.u85.p804!=1)" & (X!"(i15.u85.p804!=1)" | F(X!"(i0.u8.p66!=1)" | (!"(i0.u8.p66!=1)" & F!"(((i9.u45.p424==1)&&(i14.u84.p617=...184
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3468743692776419701
[2024-05-23 20:24:27] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3468743692776419701
Running compilation step : cd /tmp/ltsmin3468743692776419701;'/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 553 ms.
Running link step : cd /tmp/ltsmin3468743692776419701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3468743692776419701;'/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' '--ltl' '<>(([]((LTLAPp0==true))||(X((LTLAPp0==true))&&[]((X((LTLAPp1==true))&&((LTLAPp1==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-01 finished in 102177 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' '!((((!p0||X(!p0)) U G(p0))||X(p1)))'
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 341 transition count 444
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 341 transition count 444
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 341 transition count 438
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 332 transition count 429
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 332 transition count 429
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 69 place count 332 transition count 422
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 331 transition count 421
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 331 transition count 421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 331 transition count 420
Applied a total of 72 rules in 17 ms. Remains 331 /360 variables (removed 29) and now considering 420/463 (removed 43) transitions.
// Phase 1: matrix 420 rows 331 cols
[2024-05-23 20:24:42] [INFO ] Computed 10 invariants in 8 ms
[2024-05-23 20:24:42] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-23 20:24:42] [INFO ] Invariant cache hit.
[2024-05-23 20:24:42] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-23 20:24:42] [INFO ] Invariant cache hit.
[2024-05-23 20:24:42] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 331/360 places, 420/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 499 ms. Remains : 331/360 places, 420/463 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}], [{ cond=p0, acceptance={0} source=6 dest: 3}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(NEQ s261 1), p1:(EQ s283 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 283 ms.
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-08b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-02 finished in 1361 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 1 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Graph (trivial) has 284 edges and 360 vertex of which 49 / 360 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 318 transition count 377
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 275 transition count 377
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 87 place count 275 transition count 360
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 121 place count 258 transition count 360
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 154 place count 225 transition count 327
Iterating global reduction 2 with 33 rules applied. Total rules applied 187 place count 225 transition count 327
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 193 place count 225 transition count 321
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 199 place count 219 transition count 315
Iterating global reduction 3 with 6 rules applied. Total rules applied 205 place count 219 transition count 315
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 211 place count 219 transition count 309
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 309 place count 170 transition count 260
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 312 place count 167 transition count 257
Iterating global reduction 4 with 3 rules applied. Total rules applied 315 place count 167 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 318 place count 167 transition count 254
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 320 place count 165 transition count 252
Applied a total of 320 rules in 57 ms. Remains 165 /360 variables (removed 195) and now considering 252/463 (removed 211) transitions.
[2024-05-23 20:24:43] [INFO ] Flow matrix only has 230 transitions (discarded 22 similar events)
// Phase 1: matrix 230 rows 165 cols
[2024-05-23 20:24:43] [INFO ] Computed 10 invariants in 1 ms
[2024-05-23 20:24:43] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-23 20:24:43] [INFO ] Flow matrix only has 230 transitions (discarded 22 similar events)
[2024-05-23 20:24:43] [INFO ] Invariant cache hit.
[2024-05-23 20:24:43] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-23 20:24:43] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 20:24:43] [INFO ] Flow matrix only has 230 transitions (discarded 22 similar events)
[2024-05-23 20:24:43] [INFO ] Invariant cache hit.
[2024-05-23 20:24:44] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/360 places, 252/463 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 356 ms. Remains : 165/360 places, 252/463 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s162 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 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-04 finished in 396 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(G((p0 U X((p1 U (p2||G(p1)))))))))'
Support contains 7 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 343 transition count 446
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 343 transition count 446
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 343 transition count 441
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 335 transition count 433
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 335 transition count 433
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 62 place count 335 transition count 426
Applied a total of 62 rules in 17 ms. Remains 335 /360 variables (removed 25) and now considering 426/463 (removed 37) transitions.
// Phase 1: matrix 426 rows 335 cols
[2024-05-23 20:24:44] [INFO ] Computed 10 invariants in 4 ms
[2024-05-23 20:24:44] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-23 20:24:44] [INFO ] Invariant cache hit.
[2024-05-23 20:24:44] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-23 20:24:44] [INFO ] Invariant cache hit.
[2024-05-23 20:24:44] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/360 places, 426/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 335/360 places, 426/463 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s111 1) (AND (EQ s121 1) (EQ s209 1) (EQ s302 1))), p2:(AND (EQ s133 1) (EQ s334 1) (NEQ s117 1)), p1:(NEQ s117 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 1530 reset in 178 ms.
Entered a terminal (fully accepting) state of product in 10482 steps with 162 reset in 25 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-06 finished in 899 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(X(G(p0)))))'
Support contains 1 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 341 transition count 444
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 341 transition count 444
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 341 transition count 438
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 332 transition count 429
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 332 transition count 429
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 69 place count 332 transition count 422
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 331 transition count 421
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 331 transition count 421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 331 transition count 420
Applied a total of 72 rules in 16 ms. Remains 331 /360 variables (removed 29) and now considering 420/463 (removed 43) transitions.
// Phase 1: matrix 420 rows 331 cols
[2024-05-23 20:24:45] [INFO ] Computed 10 invariants in 3 ms
[2024-05-23 20:24:45] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-23 20:24:45] [INFO ] Invariant cache hit.
[2024-05-23 20:24:45] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-05-23 20:24:45] [INFO ] Invariant cache hit.
[2024-05-23 20:24:45] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 331/360 places, 420/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 434 ms. Remains : 331/360 places, 420/463 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s144 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 35824 steps with 548 reset in 56 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-07 finished in 668 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(F(p0)))'
Support contains 1 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 340 transition count 443
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 340 transition count 443
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 340 transition count 437
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 56 place count 330 transition count 427
Iterating global reduction 1 with 10 rules applied. Total rules applied 66 place count 330 transition count 427
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 74 place count 330 transition count 419
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 329 transition count 418
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 329 transition count 418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 329 transition count 417
Applied a total of 77 rules in 24 ms. Remains 329 /360 variables (removed 31) and now considering 417/463 (removed 46) transitions.
// Phase 1: matrix 417 rows 329 cols
[2024-05-23 20:24:45] [INFO ] Computed 10 invariants in 5 ms
[2024-05-23 20:24:45] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-23 20:24:45] [INFO ] Invariant cache hit.
[2024-05-23 20:24:45] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-05-23 20:24:45] [INFO ] Invariant cache hit.
[2024-05-23 20:24:46] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 329/360 places, 417/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 329/360 places, 417/463 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s202 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-08 finished in 544 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&&X(p1)))))'
Support contains 4 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 342 transition count 445
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 342 transition count 445
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 342 transition count 440
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 333 transition count 431
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 333 transition count 431
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 66 place count 333 transition count 424
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 332 transition count 423
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 332 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 332 transition count 422
Applied a total of 69 rules in 20 ms. Remains 332 /360 variables (removed 28) and now considering 422/463 (removed 41) transitions.
// Phase 1: matrix 422 rows 332 cols
[2024-05-23 20:24:46] [INFO ] Computed 10 invariants in 5 ms
[2024-05-23 20:24:46] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-23 20:24:46] [INFO ] Invariant cache hit.
[2024-05-23 20:24:46] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-23 20:24:46] [INFO ] Invariant cache hit.
[2024-05-23 20:24:46] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 332/360 places, 422/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 441 ms. Remains : 332/360 places, 422/463 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s314 1), p1:(AND (EQ s72 1) (EQ s213 1) (EQ s313 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-10 finished in 594 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((G(p0)||(!p1 U (G(!p1)||(!p1&&G(p2))))))))'
Support contains 4 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Graph (trivial) has 329 edges and 360 vertex of which 49 / 360 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 318 transition count 378
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 276 transition count 378
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 85 place count 276 transition count 362
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 117 place count 260 transition count 362
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 148 place count 229 transition count 331
Iterating global reduction 2 with 31 rules applied. Total rules applied 179 place count 229 transition count 331
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 185 place count 229 transition count 325
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 192 place count 222 transition count 318
Iterating global reduction 3 with 7 rules applied. Total rules applied 199 place count 222 transition count 318
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 205 place count 222 transition count 312
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 303 place count 173 transition count 263
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 305 place count 171 transition count 261
Iterating global reduction 4 with 2 rules applied. Total rules applied 307 place count 171 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 309 place count 171 transition count 259
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 317 place count 171 transition count 251
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 319 place count 169 transition count 249
Applied a total of 319 rules in 47 ms. Remains 169 /360 variables (removed 191) and now considering 249/463 (removed 214) transitions.
[2024-05-23 20:24:46] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
// Phase 1: matrix 235 rows 169 cols
[2024-05-23 20:24:46] [INFO ] Computed 10 invariants in 4 ms
[2024-05-23 20:24:46] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-23 20:24:46] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-23 20:24:46] [INFO ] Invariant cache hit.
[2024-05-23 20:24:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:24:47] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-23 20:24:47] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 20:24:47] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-23 20:24:47] [INFO ] Invariant cache hit.
[2024-05-23 20:24:47] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/360 places, 249/463 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 ms. Remains : 169/360 places, 249/463 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 2} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={2} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 2} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={2} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={1, 2} source=2 dest: 2}]], initial=0, aps=[p2:(NEQ s24 1), p1:(AND (EQ s25 1) (EQ s168 1)), p0:(EQ s59 0)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5666 reset in 322 ms.
Product exploration explored 100000 steps with 5641 reset in 268 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 166 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter insensitive) to 3 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 571 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-23 20:24:48] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-23 20:24:48] [INFO ] Invariant cache hit.
[2024-05-23 20:24:48] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:24:48] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2024-05-23 20:24:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:24:48] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2024-05-23 20:24:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:24:48] [INFO ] After 55ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2024-05-23 20:24:48] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-23 20:24:48] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 249/249 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 169 transition count 241
Free-agglomeration rule applied 114 times.
Iterating global reduction 1 with 114 rules applied. Total rules applied 122 place count 169 transition count 127
Reduce places removed 115 places and 0 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 164 rules applied. Total rules applied 286 place count 54 transition count 78
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 302 place count 46 transition count 70
Applied a total of 302 rules in 9 ms. Remains 46 /169 variables (removed 123) and now considering 70/249 (removed 179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 46/169 places, 70/249 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :4
Finished Best-First random walk after 1878 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=469 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND p0 (NOT p1) p2))), (F (OR p1 (NOT p2))), (F (AND p0 p1)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND p0 p1 p2))]
Knowledge based reduction with 19 factoid took 591 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter insensitive) to 3 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2) (NOT p0))]
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 249/249 transitions.
Applied a total of 0 rules in 8 ms. Remains 169 /169 variables (removed 0) and now considering 249/249 (removed 0) transitions.
[2024-05-23 20:24:49] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-23 20:24:49] [INFO ] Invariant cache hit.
[2024-05-23 20:24:50] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-23 20:24:50] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-23 20:24:50] [INFO ] Invariant cache hit.
[2024-05-23 20:24:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:24:50] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-23 20:24:50] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 20:24:50] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-23 20:24:50] [INFO ] Invariant cache hit.
[2024-05-23 20:24:50] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 311 ms. Remains : 169/169 places, 249/249 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1) p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 147 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter insensitive) to 3 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 565 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-23 20:24:50] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-23 20:24:50] [INFO ] Invariant cache hit.
[2024-05-23 20:24:50] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-23 20:24:50] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2024-05-23 20:24:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:24:51] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2024-05-23 20:24:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:24:51] [INFO ] After 57ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2024-05-23 20:24:51] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-23 20:24:51] [INFO ] After 368ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 249/249 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 169 transition count 241
Free-agglomeration rule applied 114 times.
Iterating global reduction 1 with 114 rules applied. Total rules applied 122 place count 169 transition count 127
Reduce places removed 115 places and 0 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 164 rules applied. Total rules applied 286 place count 54 transition count 78
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 302 place count 46 transition count 70
Applied a total of 302 rules in 10 ms. Remains 46 /169 variables (removed 123) and now considering 70/249 (removed 179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 46/169 places, 70/249 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :4
Finished Best-First random walk after 1805 steps, including 1 resets, run visited all 2 properties in 4 ms. (steps per millisecond=451 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1) p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND p0 (NOT p1) p2))), (F (OR p1 (NOT p2))), (F (AND p0 p1)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND p0 p1 p2))]
Knowledge based reduction with 19 factoid took 606 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter insensitive) to 3 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 5599 reset in 244 ms.
Product exploration explored 100000 steps with 5607 reset in 246 ms.
Built C files in :
/tmp/ltsmin15401753131988764122
[2024-05-23 20:24:52] [INFO ] Computing symmetric may disable matrix : 249 transitions.
[2024-05-23 20:24:52] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:24:52] [INFO ] Computing symmetric may enable matrix : 249 transitions.
[2024-05-23 20:24:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:24:52] [INFO ] Computing Do-Not-Accords matrix : 249 transitions.
[2024-05-23 20:24:52] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:24:52] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15401753131988764122
Running compilation step : cd /tmp/ltsmin15401753131988764122;'/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 436 ms.
Running link step : cd /tmp/ltsmin15401753131988764122;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15401753131988764122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1903313401994865264.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 249/249 transitions.
Applied a total of 0 rules in 13 ms. Remains 169 /169 variables (removed 0) and now considering 249/249 (removed 0) transitions.
[2024-05-23 20:25:07] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-23 20:25:07] [INFO ] Invariant cache hit.
[2024-05-23 20:25:08] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-23 20:25:08] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-23 20:25:08] [INFO ] Invariant cache hit.
[2024-05-23 20:25:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:25:08] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-23 20:25:08] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 20:25:08] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-23 20:25:08] [INFO ] Invariant cache hit.
[2024-05-23 20:25:08] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 169/169 places, 249/249 transitions.
Built C files in :
/tmp/ltsmin6640651813263738067
[2024-05-23 20:25:08] [INFO ] Computing symmetric may disable matrix : 249 transitions.
[2024-05-23 20:25:08] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:25:08] [INFO ] Computing symmetric may enable matrix : 249 transitions.
[2024-05-23 20:25:08] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:25:08] [INFO ] Computing Do-Not-Accords matrix : 249 transitions.
[2024-05-23 20:25:08] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:25:08] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6640651813263738067
Running compilation step : cd /tmp/ltsmin6640651813263738067;'/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 452 ms.
Running link step : cd /tmp/ltsmin6640651813263738067;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6640651813263738067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14966027787304755193.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 20:25:23] [INFO ] Flatten gal took : 9 ms
[2024-05-23 20:25:23] [INFO ] Flatten gal took : 9 ms
[2024-05-23 20:25:23] [INFO ] Time to serialize gal into /tmp/LTL4033800910623833602.gal : 4 ms
[2024-05-23 20:25:23] [INFO ] Time to serialize properties into /tmp/LTL9838437077307009774.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4033800910623833602.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3142457172867415788.hoa' '-atoms' '/tmp/LTL9838437077307009774.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9838437077307009774.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3142457172867415788.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2.26666e+10 deadlock states
Detected timeout of ITS tools.
[2024-05-23 20:25:38] [INFO ] Flatten gal took : 9 ms
[2024-05-23 20:25:38] [INFO ] Flatten gal took : 9 ms
[2024-05-23 20:25:38] [INFO ] Time to serialize gal into /tmp/LTL539364413279819328.gal : 1 ms
[2024-05-23 20:25:38] [INFO ] Time to serialize properties into /tmp/LTL17218479759919906295.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL539364413279819328.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17218479759919906295.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(p351==0)"))||((!("((p154==1)&&(p917==1))"))U((G(!("((p154==1)&&(p917==1))")))||((!("((p154==1)&&(p917==1))"))&&(G("(p152!=...167
Formula 0 simplified : G(F!"(p351==0)" & FG(F!"(p152!=1)" U "((p154==1)&&(p917==1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2.26666e+10 deadlock states
Detected timeout of ITS tools.
[2024-05-23 20:25:53] [INFO ] Flatten gal took : 8 ms
[2024-05-23 20:25:53] [INFO ] Applying decomposition
[2024-05-23 20:25:53] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10495652118510991063.txt' '-o' '/tmp/graph10495652118510991063.bin' '-w' '/tmp/graph10495652118510991063.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10495652118510991063.bin' '-l' '-1' '-v' '-w' '/tmp/graph10495652118510991063.weights' '-q' '0' '-e' '0.001'
[2024-05-23 20:25:53] [INFO ] Decomposing Gal with order
[2024-05-23 20:25:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:25:53] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-23 20:25:53] [INFO ] Flatten gal took : 16 ms
[2024-05-23 20:25:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 3 ms.
[2024-05-23 20:25:53] [INFO ] Time to serialize gal into /tmp/LTL269478193644759136.gal : 2 ms
[2024-05-23 20:25:53] [INFO ] Time to serialize properties into /tmp/LTL14374817528583355507.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL269478193644759136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14374817528583355507.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(u10.p351==0)"))||((!("((i9.u18.p154==1)&&(i9.u18.p917==1))"))U((G(!("((i9.u18.p154==1)&&(i9.u18.p917==1))")))||((!("((i9.u...219
Formula 0 simplified : G(F!"(u10.p351==0)" & FG(F!"(i1.u2.p152!=1)" U "((i9.u18.p154==1)&&(i9.u18.p917==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3228969201521362018
[2024-05-23 20:26:08] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3228969201521362018
Running compilation step : cd /tmp/ltsmin3228969201521362018;'/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 356 ms.
Running link step : cd /tmp/ltsmin3228969201521362018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3228969201521362018;'/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' '--ltl' '[](<>(([]((LTLAPp0==true))||(!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-11 finished in 96950 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 p1))&&(G(p1)||G(p2))) U X(p3)))'
Support contains 5 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 344 transition count 447
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 344 transition count 447
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 344 transition count 441
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 337 transition count 434
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 337 transition count 434
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 57 place count 337 transition count 429
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 336 transition count 428
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 336 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 336 transition count 427
Applied a total of 60 rules in 18 ms. Remains 336 /360 variables (removed 24) and now considering 427/463 (removed 36) transitions.
// Phase 1: matrix 427 rows 336 cols
[2024-05-23 20:26:23] [INFO ] Computed 10 invariants in 4 ms
[2024-05-23 20:26:23] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-23 20:26:23] [INFO ] Invariant cache hit.
[2024-05-23 20:26:24] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-23 20:26:24] [INFO ] Invariant cache hit.
[2024-05-23 20:26:24] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/360 places, 427/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 336/360 places, 427/463 transitions.
Stuttering acceptance computed with spot in 432 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) p0), true, (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(OR p1 p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND p1 p2), acceptance={} source=0 dest: 6}], [{ cond=(NOT p3), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=2 dest: 8}], [{ cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) p0)), acceptance={} source=3 dest: 7}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 5}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 7}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=6 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 10}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=6 dest: 11}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={} source=9 dest: 7}, { cond=p2, acceptance={} source=9 dest: 9}], [{ cond=(NOT p1), acceptance={} source=10 dest: 7}, { cond=p1, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=11 dest: 9}, { cond=(AND p1 (NOT p2)), acceptance={} source=11 dest: 10}, { cond=(AND p1 p2), acceptance={} source=11 dest: 11}]], initial=0, aps=[p1:(EQ s306 1), p2:(EQ s50 1), p3:(OR (EQ s289 1) (EQ s93 1)), p0:(EQ s237 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, null, null, null, null, null, null][false, false, false, false, false, false, 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-08b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-12 finished in 920 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))||G(!p0)))'
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 341 transition count 444
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 341 transition count 444
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 341 transition count 439
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 331 transition count 429
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 331 transition count 429
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 71 place count 331 transition count 421
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 330 transition count 420
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 330 transition count 420
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 330 transition count 419
Applied a total of 74 rules in 21 ms. Remains 330 /360 variables (removed 30) and now considering 419/463 (removed 44) transitions.
// Phase 1: matrix 419 rows 330 cols
[2024-05-23 20:26:24] [INFO ] Computed 10 invariants in 3 ms
[2024-05-23 20:26:24] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-23 20:26:24] [INFO ] Invariant cache hit.
[2024-05-23 20:26:24] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-23 20:26:24] [INFO ] Invariant cache hit.
[2024-05-23 20:26:25] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 330/360 places, 419/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 330/360 places, 419/463 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), p0, false, false]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s52 1) (EQ s238 1) (EQ s286 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32879 steps with 502 reset in 45 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-13 finished in 664 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 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Graph (trivial) has 331 edges and 360 vertex of which 49 / 360 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 318 transition count 377
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 275 transition count 377
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 87 place count 275 transition count 359
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 123 place count 257 transition count 359
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 155 place count 225 transition count 327
Iterating global reduction 2 with 32 rules applied. Total rules applied 187 place count 225 transition count 327
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 192 place count 225 transition count 322
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 198 place count 219 transition count 316
Iterating global reduction 3 with 6 rules applied. Total rules applied 204 place count 219 transition count 316
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 210 place count 219 transition count 310
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 308 place count 170 transition count 261
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 311 place count 167 transition count 258
Iterating global reduction 4 with 3 rules applied. Total rules applied 314 place count 167 transition count 258
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 317 place count 167 transition count 255
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 325 place count 167 transition count 247
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 327 place count 165 transition count 245
Applied a total of 327 rules in 38 ms. Remains 165 /360 variables (removed 195) and now considering 245/463 (removed 218) transitions.
[2024-05-23 20:26:25] [INFO ] Flow matrix only has 230 transitions (discarded 15 similar events)
// Phase 1: matrix 230 rows 165 cols
[2024-05-23 20:26:25] [INFO ] Computed 10 invariants in 3 ms
[2024-05-23 20:26:25] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-23 20:26:25] [INFO ] Flow matrix only has 230 transitions (discarded 15 similar events)
[2024-05-23 20:26:25] [INFO ] Invariant cache hit.
[2024-05-23 20:26:25] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-23 20:26:25] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 20:26:25] [INFO ] Flow matrix only has 230 transitions (discarded 15 similar events)
[2024-05-23 20:26:25] [INFO ] Invariant cache hit.
[2024-05-23 20:26:25] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/360 places, 245/463 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 370 ms. Remains : 165/360 places, 245/463 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s26 1) (EQ s58 1) (EQ s139 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 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-15 finished in 419 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(((X(p0)&&G((X(p1)&&(p1||G(p2)))))||G(p0))))'
Found a Shortening insensitive property : FlexibleBarrier-PT-08b-LTLFireability-01
Stuttering acceptance computed with spot in 338 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, (AND p1 (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false]
Support contains 5 out of 360 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Graph (trivial) has 327 edges and 360 vertex of which 49 / 360 are part of one of the 8 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 318 transition count 379
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 277 transition count 379
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 83 place count 277 transition count 361
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 119 place count 259 transition count 361
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 150 place count 228 transition count 330
Iterating global reduction 2 with 31 rules applied. Total rules applied 181 place count 228 transition count 330
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 186 place count 228 transition count 325
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 192 place count 222 transition count 319
Iterating global reduction 3 with 6 rules applied. Total rules applied 198 place count 222 transition count 319
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 204 place count 222 transition count 313
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 300 place count 174 transition count 265
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 303 place count 171 transition count 262
Iterating global reduction 4 with 3 rules applied. Total rules applied 306 place count 171 transition count 262
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 309 place count 171 transition count 259
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 317 place count 171 transition count 251
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 171 transition count 251
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 320 place count 169 transition count 249
Applied a total of 320 rules in 37 ms. Remains 169 /360 variables (removed 191) and now considering 249/463 (removed 214) transitions.
[2024-05-23 20:26:26] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
// Phase 1: matrix 234 rows 169 cols
[2024-05-23 20:26:26] [INFO ] Computed 10 invariants in 3 ms
[2024-05-23 20:26:26] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-23 20:26:26] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-23 20:26:26] [INFO ] Invariant cache hit.
[2024-05-23 20:26:26] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-23 20:26:26] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-23 20:26:26] [INFO ] Invariant cache hit.
[2024-05-23 20:26:26] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 169/360 places, 249/463 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 328 ms. Remains : 169/360 places, 249/463 transitions.
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=0 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=0 dest: 3}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0} source=0 dest: 4}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 2} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=2 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=3 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 2} source=3 dest: 4}, { cond=(AND p1 p2 p0), acceptance={1} source=3 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=3 dest: 5}, { cond=(AND p1 p2 p0), acceptance={1} source=3 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=3 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=3 dest: 7}], [{ cond=(AND p1 p0), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 2} source=5 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=5 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=5 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=6 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=6 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=7 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=7 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 2} source=7 dest: 4}, { cond=(AND p1 p2 p0), acceptance={1} source=7 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=7 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=7 dest: 7}]], initial=0, aps=[p1:(NEQ s7 1), p2:(AND (EQ s70 1) (EQ s105 1) (EQ s164 1)), p0:(NEQ s146 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 37533 reset in 502 ms.
Product exploration explored 100000 steps with 37401 reset in 485 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (OR (AND p1 p0) (AND p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (AND p1 p0)), (X (AND p1 (NOT p2) p0)), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 p0))), (X (X (AND p1 (NOT p2) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 293 ms. Reduced automaton from 8 states, 61 edges and 3 AP (stutter sensitive) to 8 states, 61 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 720 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-23 20:26:28] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-23 20:26:28] [INFO ] Invariant cache hit.
[2024-05-23 20:26:28] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:26:28] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2024-05-23 20:26:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:26:28] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2024-05-23 20:26:28] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-23 20:26:29] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 249/249 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 169 transition count 233
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 24 place count 161 transition count 225
Iterating global reduction 1 with 8 rules applied. Total rules applied 32 place count 161 transition count 225
Free-agglomeration rule applied 112 times.
Iterating global reduction 1 with 112 rules applied. Total rules applied 144 place count 161 transition count 113
Reduce places removed 113 places and 0 transitions.
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Graph (trivial) has 40 edges and 48 vertex of which 16 / 48 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 155 rules applied. Total rules applied 299 place count 40 transition count 72
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 315 place count 40 transition count 56
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 315 place count 40 transition count 48
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 331 place count 32 transition count 48
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 338 place count 32 transition count 41
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 354 place count 24 transition count 33
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 361 place count 24 transition count 26
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 384 place count 12 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 12 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 387 place count 11 transition count 13
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 388 place count 11 transition count 12
Applied a total of 388 rules in 14 ms. Remains 11 /169 variables (removed 158) and now considering 12/249 (removed 237) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 11/169 places, 12/249 transitions.
Finished random walk after 66 steps, including 0 resets, run visited all 8 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (OR (AND p1 p0) (AND p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (AND p1 p0)), (X (AND p1 (NOT p2) p0)), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 p0))), (X (X (AND p1 (NOT p2) p0))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2)), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 27 factoid took 1107 ms. Reduced automaton from 8 states, 61 edges and 3 AP (stutter sensitive) to 4 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Support contains 2 out of 169 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 249/249 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 249/249 (removed 0) transitions.
[2024-05-23 20:26:30] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-23 20:26:30] [INFO ] Invariant cache hit.
[2024-05-23 20:26:30] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-23 20:26:30] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-23 20:26:30] [INFO ] Invariant cache hit.
[2024-05-23 20:26:30] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-23 20:26:30] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-23 20:26:30] [INFO ] Invariant cache hit.
[2024-05-23 20:26:30] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 169/169 places, 249/249 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 4 states, 17 edges and 2 AP (stutter sensitive) to 4 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Incomplete random walk after 10000 steps, including 712 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 865103 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :{}
Probabilistic random walk after 865103 steps, saw 170088 distinct states, run finished after 3002 ms. (steps per millisecond=288 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-23 20:26:34] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-23 20:26:34] [INFO ] Invariant cache hit.
[2024-05-23 20:26:34] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:26:34] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 20:26:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:26:34] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 20:26:34] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-23 20:26:34] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 249/249 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 169 transition count 233
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 25 place count 160 transition count 224
Iterating global reduction 1 with 9 rules applied. Total rules applied 34 place count 160 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 160 transition count 223
Free-agglomeration rule applied 114 times.
Iterating global reduction 2 with 114 rules applied. Total rules applied 149 place count 160 transition count 109
Reduce places removed 115 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 79 edges and 45 vertex of which 20 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 25 output transitions
Drop transitions removed 25 transitions
Graph (trivial) has 25 edges and 20 vertex of which 6 / 20 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 165 rules applied. Total rules applied 314 place count 17 transition count 36
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 330 place count 17 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 330 place count 17 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 336 place count 14 transition count 17
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 338 place count 14 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 344 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 346 place count 10 transition count 11
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 347 place count 10 transition count 10
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 349 place count 10 transition count 8
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 355 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 356 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 357 place count 5 transition count 5
Applied a total of 357 rules in 15 ms. Remains 5 /169 variables (removed 164) and now considering 5/249 (removed 244) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 5/169 places, 5/249 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 182 ms. Reduced automaton from 4 states, 17 edges and 2 AP (stutter sensitive) to 4 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 37465 reset in 433 ms.
Product exploration explored 100000 steps with 37536 reset in 439 ms.
Built C files in :
/tmp/ltsmin8633767597929268980
[2024-05-23 20:26:36] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8633767597929268980
Running compilation step : cd /tmp/ltsmin8633767597929268980;'/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 350 ms.
Running link step : cd /tmp/ltsmin8633767597929268980;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8633767597929268980;'/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/stateBased2841202526491589490.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 249/249 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 168 transition count 247
Applied a total of 3 rules in 5 ms. Remains 168 /169 variables (removed 1) and now considering 247/249 (removed 2) transitions.
[2024-05-23 20:26:51] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
// Phase 1: matrix 232 rows 168 cols
[2024-05-23 20:26:51] [INFO ] Computed 10 invariants in 3 ms
[2024-05-23 20:26:51] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-23 20:26:51] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
[2024-05-23 20:26:51] [INFO ] Invariant cache hit.
[2024-05-23 20:26:51] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-23 20:26:51] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
[2024-05-23 20:26:51] [INFO ] Invariant cache hit.
[2024-05-23 20:26:51] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/169 places, 247/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 168/169 places, 247/249 transitions.
Built C files in :
/tmp/ltsmin18038110533225746881
[2024-05-23 20:26:51] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18038110533225746881
Running compilation step : cd /tmp/ltsmin18038110533225746881;'/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 336 ms.
Running link step : cd /tmp/ltsmin18038110533225746881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18038110533225746881;'/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/stateBased14835314896561551400.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 20:27:06] [INFO ] Flatten gal took : 9 ms
[2024-05-23 20:27:06] [INFO ] Flatten gal took : 7 ms
[2024-05-23 20:27:06] [INFO ] Time to serialize gal into /tmp/LTL5398714975584891015.gal : 2 ms
[2024-05-23 20:27:06] [INFO ] Time to serialize properties into /tmp/LTL15714926186891563921.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5398714975584891015.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4679085460677869178.hoa' '-atoms' '/tmp/LTL15714926186891563921.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15714926186891563921.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4679085460677869178.hoa
Detected timeout of ITS tools.
[2024-05-23 20:27:21] [INFO ] Flatten gal took : 7 ms
[2024-05-23 20:27:21] [INFO ] Flatten gal took : 7 ms
[2024-05-23 20:27:21] [INFO ] Time to serialize gal into /tmp/LTL11226396528354658430.gal : 2 ms
[2024-05-23 20:27:21] [INFO ] Time to serialize properties into /tmp/LTL11973233785363435536.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11226396528354658430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11973233785363435536.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("(p804!=1)"))||((X("(p804!=1)"))&&(G((X("(p66!=1)"))&&(("(p66!=1)")||(G("(((p424==1)&&(p617==1))&&(p891==1))")))))))))
Formula 0 simplified : G(F!"(p804!=1)" & (X!"(p804!=1)" | F(X!"(p66!=1)" | (!"(p66!=1)" & F!"(((p424==1)&&(p617==1))&&(p891==1))"))))
Detected timeout of ITS tools.
[2024-05-23 20:27:36] [INFO ] Flatten gal took : 6 ms
[2024-05-23 20:27:36] [INFO ] Applying decomposition
[2024-05-23 20:27:36] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3509983109656188200.txt' '-o' '/tmp/graph3509983109656188200.bin' '-w' '/tmp/graph3509983109656188200.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3509983109656188200.bin' '-l' '-1' '-v' '-w' '/tmp/graph3509983109656188200.weights' '-q' '0' '-e' '0.001'
[2024-05-23 20:27:36] [INFO ] Decomposing Gal with order
[2024-05-23 20:27:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:27:36] [INFO ] Removed a total of 113 redundant transitions.
[2024-05-23 20:27:36] [INFO ] Flatten gal took : 12 ms
[2024-05-23 20:27:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 4 ms.
[2024-05-23 20:27:36] [INFO ] Time to serialize gal into /tmp/LTL537725840546730949.gal : 2 ms
[2024-05-23 20:27:36] [INFO ] Time to serialize properties into /tmp/LTL7833115130027274189.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL537725840546730949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7833115130027274189.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F((G("(i9.u25.p804!=1)"))||((X("(i9.u25.p804!=1)"))&&(G((X("(i0.u1.p66!=1)"))&&(("(i0.u1.p66!=1)")||(G("(((i5.u14.p424==1)&&(i8.u23...194
Formula 0 simplified : G(F!"(i9.u25.p804!=1)" & (X!"(i9.u25.p804!=1)" | F(X!"(i0.u1.p66!=1)" | (!"(i0.u1.p66!=1)" & F!"(((i5.u14.p424==1)&&(i8.u23.p617==1)...180
Reverse transition relation is NOT exact ! Due to transitions t5_t372_t178_t165, t5_t373_t109_t96, i9.t28, Intersection with reachable at each step enable...206
Computing Next relation with stutter on 2.26651e+10 deadlock states
7 unique states visited
4 strongly connected components in search stack
8 transitions explored
5 items max in DFS search stack
53 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.570649,44904,1,0,27147,52200,2854,70072,1595,148418,24835
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-01 finished in 71726 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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((G(p0)||(!p1 U (G(!p1)||(!p1&&G(p2))))))))'
[2024-05-23 20:27:37] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9630676164785284062
[2024-05-23 20:27:37] [INFO ] Applying decomposition
[2024-05-23 20:27:37] [INFO ] Computing symmetric may disable matrix : 463 transitions.
[2024-05-23 20:27:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:27:37] [INFO ] Computing symmetric may enable matrix : 463 transitions.
[2024-05-23 20:27:37] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:27:37] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2170695487755849966.txt' '-o' '/tmp/graph2170695487755849966.bin' '-w' '/tmp/graph2170695487755849966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2170695487755849966.bin' '-l' '-1' '-v' '-w' '/tmp/graph2170695487755849966.weights' '-q' '0' '-e' '0.001'
[2024-05-23 20:27:37] [INFO ] Decomposing Gal with order
[2024-05-23 20:27:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:27:37] [INFO ] Computing Do-Not-Accords matrix : 463 transitions.
[2024-05-23 20:27:37] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:27:37] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9630676164785284062
Running compilation step : cd /tmp/ltsmin9630676164785284062;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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'
[2024-05-23 20:27:37] [INFO ] Removed a total of 217 redundant transitions.
[2024-05-23 20:27:37] [INFO ] Flatten gal took : 22 ms
[2024-05-23 20:27:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 8 ms.
[2024-05-23 20:27:37] [INFO ] Time to serialize gal into /tmp/LTLFireability6737453506059075195.gal : 3 ms
[2024-05-23 20:27:37] [INFO ] Time to serialize properties into /tmp/LTLFireability206269268483680832.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6737453506059075195.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability206269268483680832.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 2 LTL properties
Checking formula 0 : !((F(((X("(i13.u88.p804!=1)"))&&(G((X("(i0.i0.u7.p66!=1)"))&&(("(i0.i0.u7.p66!=1)")||(G("(((i6.i0.u49.p424==1)&&(i12.u85.p617==1))&&(i...207
Formula 0 simplified : G(F!"(i13.u88.p804!=1)" & (X!"(i13.u88.p804!=1)" | F(X!"(i0.i0.u7.p66!=1)" | (!"(i0.i0.u7.p66!=1)" & F!"(((i6.i0.u49.p424==1)&&(i12....193
Compilation finished in 879 ms.
Running link step : cd /tmp/ltsmin9630676164785284062;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9630676164785284062;'/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' '--ltl' '<>(((X((LTLAPp0==true))&&[]((X((LTLAPp1==true))&&((LTLAPp1==true)||[]((LTLAPp2==true))))))||[]((LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t65, t95, t96, t130, t131, t165, t199, t235, t236, t267, t303, t366, t368, t369, t370, t3...1101
Computing Next relation with stutter on 6.40011e+10 deadlock states
7 unique states visited
4 strongly connected components in search stack
8 transitions explored
5 items max in DFS search stack
19538 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,195.448,4460304,1,0,7.22221e+06,627160,7077,1.4333e+07,1840,2.94942e+06,17271067
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F((G("(i6.i0.u49.p351==0)"))||((!("((i8.i2.u91.p154==1)&&(i8.i2.u91.p917==1))"))U((G(!("((i8.i2.u91.p154==1)&&(i8.i2.u91.p917==1)...247
Formula 1 simplified : G(F!"(i6.i0.u49.p351==0)" & FG(F!"(i2.i0.u19.p152!=1)" U "((i8.i2.u91.p154==1)&&(i8.i2.u91.p917==1))"))
Computing Next relation with stutter on 6.40011e+10 deadlock states
Detected timeout of ITS tools.
[2024-05-23 20:49:12] [INFO ] Applying decomposition
[2024-05-23 20:49:12] [INFO ] Flatten gal took : 10 ms
[2024-05-23 20:49:12] [INFO ] Decomposing Gal with order
[2024-05-23 20:49:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:49:12] [INFO ] Removed a total of 116 redundant transitions.
[2024-05-23 20:49:12] [INFO ] Flatten gal took : 60 ms
[2024-05-23 20:49:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 329 labels/synchronizations in 32 ms.
[2024-05-23 20:49:12] [INFO ] Time to serialize gal into /tmp/LTLFireability17446958696242868104.gal : 3 ms
[2024-05-23 20:49:12] [INFO ] Time to serialize properties into /tmp/LTLFireability8321321141405767879.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17446958696242868104.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8321321141405767879.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(i0.i0.i0.i0.u12.p351==0)"))||((!("((i0.i0.i0.i0.i0.i0.i0.u9.p154==1)&&(i1.u18.p917==1))"))U((G(!("((i0.i0.i0.i0.i0.i0.i0.u...300
Formula 0 simplified : G(F!"(i0.i0.i0.i0.u12.p351==0)" & FG(F!"(i0.i0.i0.i0.i0.i0.i0.u9.p152!=1)" U "((i0.i0.i0.i0.i0.i0.i0.u9.p154==1)&&(i1.u18.p917==1))"...157
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.026: LTL layer: formula: <>(((X((LTLAPp0==true))&&[]((X((LTLAPp1==true))&&((LTLAPp1==true)||[]((LTLAPp2==true))))))||[]((LTLAPp0==true))))
pins2lts-mc-linux64( 4/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.026: "<>(((X((LTLAPp0==true))&&[]((X((LTLAPp1==true))&&((LTLAPp1==true)||[]((LTLAPp2==true))))))||[]((LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.027: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.133: There are 470 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.133: State length is 361, there are 566 groups
pins2lts-mc-linux64( 0/ 8), 0.133: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.133: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.133: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.133: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.191: [Blue] ~83 levels ~960 states ~8328 transitions
pins2lts-mc-linux64( 2/ 8), 0.207: [Blue] ~85 levels ~1920 states ~10072 transitions
pins2lts-mc-linux64( 1/ 8), 0.235: [Blue] ~87 levels ~3840 states ~13352 transitions
pins2lts-mc-linux64( 1/ 8), 0.285: [Blue] ~103 levels ~7680 states ~20888 transitions
pins2lts-mc-linux64( 1/ 8), 0.407: [Blue] ~215 levels ~15360 states ~42408 transitions
pins2lts-mc-linux64( 1/ 8), 0.641: [Blue] ~343 levels ~30720 states ~84616 transitions
pins2lts-mc-linux64( 5/ 8), 1.042: [Blue] ~408 levels ~61440 states ~169560 transitions
pins2lts-mc-linux64( 1/ 8), 1.909: [Blue] ~349 levels ~122880 states ~334616 transitions
pins2lts-mc-linux64( 1/ 8), 3.448: [Blue] ~349 levels ~245760 states ~672408 transitions
pins2lts-mc-linux64( 1/ 8), 6.318: [Blue] ~458 levels ~491520 states ~1454344 transitions
pins2lts-mc-linux64( 3/ 8), 11.599: [Blue] ~4925 levels ~983040 states ~3548264 transitions
pins2lts-mc-linux64( 4/ 8), 21.569: [Blue] ~614 levels ~1966080 states ~5438408 transitions
pins2lts-mc-linux64( 3/ 8), 41.558: [Blue] ~5067 levels ~3932160 states ~14184792 transitions
pins2lts-mc-linux64( 3/ 8), 80.944: [Blue] ~5067 levels ~7864320 states ~25646232 transitions
pins2lts-mc-linux64( 3/ 8), 160.182: [Blue] ~7746 levels ~15728640 states ~54275208 transitions
pins2lts-mc-linux64( 1/ 8), 317.654: [Blue] ~7154 levels ~31457280 states ~105353040 transitions
pins2lts-mc-linux64( 1/ 8), 646.331: [Blue] ~10931 levels ~62914560 states ~207163240 transitions
pins2lts-mc-linux64( 1/ 8), 1326.549: [Blue] ~16935 levels ~125829120 states ~457824344 transitions
pins2lts-mc-linux64( 3/ 8), 1546.297: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1546.329:
pins2lts-mc-linux64( 0/ 8), 1546.329: Explored 134131334 states 590842567 transitions, fanout: 4.405
pins2lts-mc-linux64( 0/ 8), 1546.329: Total exploration time 1546.180 sec (1546.150 sec minimum, 1546.165 sec on average)
pins2lts-mc-linux64( 0/ 8), 1546.329: States per second: 86750, Transitions per second: 382130
pins2lts-mc-linux64( 0/ 8), 1546.329:
pins2lts-mc-linux64( 0/ 8), 1546.329: State space has 134216945 states, 231287 are accepting
pins2lts-mc-linux64( 0/ 8), 1546.329: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1546.329: blue states: 134131334 (99.94%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1546.329: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1546.329: all-red states: 65196876 (48.58%), bogus 3594 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1546.329:
pins2lts-mc-linux64( 0/ 8), 1546.329: Total memory used for local state coloring: 11.6MB
pins2lts-mc-linux64( 0/ 8), 1546.329:
pins2lts-mc-linux64( 0/ 8), 1546.329: Queue width: 8B, total height: 757942, memory: 5.78MB
pins2lts-mc-linux64( 0/ 8), 1546.329: Tree memory: 1086.2MB, 8.5 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1546.329: Tree fill ratio (roots/leafs): 99.0%/24.0%
pins2lts-mc-linux64( 0/ 8), 1546.329: Stored 466 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1546.329: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1546.329: Est. total memory use: 1091.9MB (~1029.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9630676164785284062;'/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' '--ltl' '<>(((X((LTLAPp0==true))&&[]((X((LTLAPp1==true))&&((LTLAPp1==true)||[]((LTLAPp2==true))))))||[]((LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9630676164785284062;'/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' '--ltl' '<>(((X((LTLAPp0==true))&&[]((X((LTLAPp1==true))&&((LTLAPp1==true)||[]((LTLAPp2==true))))))||[]((LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Reverse transition relation is NOT exact ! Due to transitions t346, t367, i0.u15.t65, i0.u15.t69, i0.u15.t74, i0.u15.t78, i0.u15.t79, i0.i0.t95, i0.i0.u14....1623
Computing Next relation with stutter on 6.40011e+10 deadlock states
Detected timeout of ITS tools.
[2024-05-23 21:10:47] [INFO ] Flatten gal took : 10 ms
[2024-05-23 21:10:47] [INFO ] Input system was already deterministic with 463 transitions.
[2024-05-23 21:10:47] [INFO ] Transformed 360 places.
[2024-05-23 21:10:47] [INFO ] Transformed 463 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 21:10:47] [INFO ] Time to serialize gal into /tmp/LTLFireability13197702817643847624.gal : 3 ms
[2024-05-23 21:10:47] [INFO ] Time to serialize properties into /tmp/LTLFireability10345397129160970449.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13197702817643847624.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10345397129160970449.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F((G("(p351==0)"))||((!("((p154==1)&&(p917==1))"))U((G(!("((p154==1)&&(p917==1))")))||((!("((p154==1)&&(p917==1))"))&&(G("(p152!=...167
Formula 0 simplified : G(F!"(p351==0)" & FG(F!"(p152!=1)" U "((p154==1)&&(p917==1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 1842116 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16036908 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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-08b"
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-08b, 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-171640624700028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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