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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 07:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 13 07:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 07:58 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 374K 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-10b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716495845034

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-10b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 20:24:06] [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:24:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:24:06] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-23 20:24:06] [INFO ] Transformed 1402 places.
[2024-05-23 20:24:06] [INFO ] Transformed 1613 transitions.
[2024-05-23 20:24:06] [INFO ] Found NUPN structural information;
[2024-05-23 20:24:06] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 1402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Discarding 530 places :
Symmetric choice reduction at 0 with 530 rule applications. Total rules 530 place count 872 transition count 1083
Iterating global reduction 0 with 530 rules applied. Total rules applied 1060 place count 872 transition count 1083
Discarding 236 places :
Symmetric choice reduction at 0 with 236 rule applications. Total rules 1296 place count 636 transition count 847
Iterating global reduction 0 with 236 rules applied. Total rules applied 1532 place count 636 transition count 847
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 1678 place count 490 transition count 701
Iterating global reduction 0 with 146 rules applied. Total rules applied 1824 place count 490 transition count 701
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 1890 place count 490 transition count 635
Applied a total of 1890 rules in 219 ms. Remains 490 /1402 variables (removed 912) and now considering 635/1613 (removed 978) transitions.
// Phase 1: matrix 635 rows 490 cols
[2024-05-23 20:24:07] [INFO ] Computed 12 invariants in 34 ms
[2024-05-23 20:24:07] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-23 20:24:07] [INFO ] Invariant cache hit.
[2024-05-23 20:24:07] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2024-05-23 20:24:07] [INFO ] Invariant cache hit.
[2024-05-23 20:24:07] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 490/1402 places, 635/1613 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1193 ms. Remains : 490/1402 places, 635/1613 transitions.
Support contains 36 out of 490 places after structural reductions.
[2024-05-23 20:24:08] [INFO ] Flatten gal took : 60 ms
[2024-05-23 20:24:08] [INFO ] Flatten gal took : 36 ms
[2024-05-23 20:24:08] [INFO ] Input system was already deterministic with 635 transitions.
Support contains 34 out of 490 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 29) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-23 20:24:08] [INFO ] Invariant cache hit.
[2024-05-23 20:24:09] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-23 20:24:09] [INFO ] After 414ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:12
[2024-05-23 20:24:09] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 5 ms to minimize.
[2024-05-23 20:24:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-05-23 20:24:09] [INFO ] After 771ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-23 20:24:09] [INFO ] After 1184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-23 20:24:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-23 20:24:10] [INFO ] After 518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-05-23 20:24:10] [INFO ] Deduced a trap composed of 79 places in 59 ms of which 1 ms to minimize.
[2024-05-23 20:24:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2024-05-23 20:24:11] [INFO ] Deduced a trap composed of 124 places in 124 ms of which 1 ms to minimize.
[2024-05-23 20:24:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2024-05-23 20:24:11] [INFO ] After 1359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 351 ms.
[2024-05-23 20:24:12] [INFO ] After 2055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 12 properties in 93 ms.
Support contains 8 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 447 edges and 490 vertex of which 61 / 490 are part of one of the 10 SCC in 3 ms
Free SCC test removed 51 places
Drop transitions removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 439 transition count 523
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 389 transition count 523
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 101 place count 389 transition count 500
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 147 place count 366 transition count 500
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 180 place count 333 transition count 467
Iterating global reduction 2 with 33 rules applied. Total rules applied 213 place count 333 transition count 467
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 213 place count 333 transition count 466
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 215 place count 332 transition count 466
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 226 place count 321 transition count 455
Iterating global reduction 2 with 11 rules applied. Total rules applied 237 place count 321 transition count 455
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 246 place count 321 transition count 446
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 372 place count 258 transition count 383
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 392 place count 258 transition count 363
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 403 place count 247 transition count 352
Iterating global reduction 4 with 11 rules applied. Total rules applied 414 place count 247 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 415 place count 247 transition count 351
Free-agglomeration rule applied 184 times.
Iterating global reduction 5 with 184 rules applied. Total rules applied 599 place count 247 transition count 167
Reduce places removed 184 places and 0 transitions.
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 5 with 256 rules applied. Total rules applied 855 place count 63 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 856 place count 62 transition count 94
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 50 edges and 61 vertex of which 20 / 61 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 859 place count 51 transition count 93
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 880 place count 50 transition count 73
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 880 place count 50 transition count 63
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 900 place count 40 transition count 63
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 909 place count 40 transition count 54
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 927 place count 31 transition count 45
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 928 place count 31 transition count 44
Free-agglomeration rule applied 10 times.
Iterating global reduction 9 with 10 rules applied. Total rules applied 938 place count 31 transition count 34
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 28 rules applied. Total rules applied 966 place count 16 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 969 place count 16 transition count 18
Applied a total of 969 rules in 143 ms. Remains 16 /490 variables (removed 474) and now considering 18/635 (removed 617) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 16/490 places, 18/635 transitions.
Finished random walk after 22 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 13 stabilizing places and 13 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' '!(((p0 U X(p1))||X((X(F(p3))||p2))))'
Support contains 4 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 471 transition count 616
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 471 transition count 616
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 471 transition count 615
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 53 place count 457 transition count 601
Iterating global reduction 1 with 14 rules applied. Total rules applied 67 place count 457 transition count 601
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 76 place count 457 transition count 592
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 452 transition count 587
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 452 transition count 587
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 90 place count 452 transition count 583
Applied a total of 90 rules in 55 ms. Remains 452 /490 variables (removed 38) and now considering 583/635 (removed 52) transitions.
// Phase 1: matrix 583 rows 452 cols
[2024-05-23 20:24:12] [INFO ] Computed 12 invariants in 11 ms
[2024-05-23 20:24:12] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-23 20:24:12] [INFO ] Invariant cache hit.
[2024-05-23 20:24:13] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-05-23 20:24:13] [INFO ] Invariant cache hit.
[2024-05-23 20:24:13] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 452/490 places, 583/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 657 ms. Remains : 452/490 places, 583/635 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 376 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}]], initial=0, aps=[p0:(EQ s245 1), p3:(EQ s258 1), p1:(NEQ s97 1), p2:(OR (EQ s245 1) (EQ s446 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, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 347 ms.
Product exploration explored 100000 steps with 50000 reset in 305 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 23 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-10b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-00 finished in 1771 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)&&F(G(p1)))))'
Support contains 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 373 edges and 490 vertex of which 61 / 490 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 438 transition count 532
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 388 transition count 532
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 101 place count 388 transition count 506
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 153 place count 362 transition count 506
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 190 place count 325 transition count 469
Iterating global reduction 2 with 37 rules applied. Total rules applied 227 place count 325 transition count 469
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 228 place count 325 transition count 468
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 240 place count 313 transition count 456
Iterating global reduction 3 with 12 rules applied. Total rules applied 252 place count 313 transition count 456
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 264 place count 313 transition count 444
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 2 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 388 place count 251 transition count 382
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 389 place count 250 transition count 381
Iterating global reduction 4 with 1 rules applied. Total rules applied 390 place count 250 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 391 place count 250 transition count 380
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 393 place count 248 transition count 378
Applied a total of 393 rules in 98 ms. Remains 248 /490 variables (removed 242) and now considering 378/635 (removed 257) transitions.
[2024-05-23 20:24:14] [INFO ] Flow matrix only has 350 transitions (discarded 28 similar events)
// Phase 1: matrix 350 rows 248 cols
[2024-05-23 20:24:14] [INFO ] Computed 12 invariants in 3 ms
[2024-05-23 20:24:14] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-23 20:24:14] [INFO ] Flow matrix only has 350 transitions (discarded 28 similar events)
[2024-05-23 20:24:14] [INFO ] Invariant cache hit.
[2024-05-23 20:24:14] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-23 20:24:14] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-23 20:24:14] [INFO ] Flow matrix only has 350 transitions (discarded 28 similar events)
[2024-05-23 20:24:14] [INFO ] Invariant cache hit.
[2024-05-23 20:24:14] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 248/490 places, 378/635 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 577 ms. Remains : 248/490 places, 378/635 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s64 1), p1:(EQ s245 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-01 finished in 711 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 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 456 edges and 490 vertex of which 61 / 490 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 438 transition count 530
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 386 transition count 530
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 105 place count 386 transition count 504
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 157 place count 360 transition count 504
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 195 place count 322 transition count 466
Iterating global reduction 2 with 38 rules applied. Total rules applied 233 place count 322 transition count 466
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 234 place count 322 transition count 465
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 234 place count 322 transition count 464
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 321 transition count 464
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 249 place count 308 transition count 451
Iterating global reduction 3 with 13 rules applied. Total rules applied 262 place count 308 transition count 451
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 275 place count 308 transition count 438
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 395 place count 248 transition count 378
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 396 place count 247 transition count 377
Iterating global reduction 4 with 1 rules applied. Total rules applied 397 place count 247 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 398 place count 247 transition count 376
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 408 place count 247 transition count 366
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 410 place count 245 transition count 364
Applied a total of 410 rules in 99 ms. Remains 245 /490 variables (removed 245) and now considering 364/635 (removed 271) transitions.
[2024-05-23 20:24:15] [INFO ] Flow matrix only has 345 transitions (discarded 19 similar events)
// Phase 1: matrix 345 rows 245 cols
[2024-05-23 20:24:15] [INFO ] Computed 12 invariants in 4 ms
[2024-05-23 20:24:15] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-23 20:24:15] [INFO ] Flow matrix only has 345 transitions (discarded 19 similar events)
[2024-05-23 20:24:15] [INFO ] Invariant cache hit.
[2024-05-23 20:24:15] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-05-23 20:24:15] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-23 20:24:15] [INFO ] Flow matrix only has 345 transitions (discarded 19 similar events)
[2024-05-23 20:24:15] [INFO ] Invariant cache hit.
[2024-05-23 20:24:15] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/490 places, 364/635 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 555 ms. Remains : 245/490 places, 364/635 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s158 0)], 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 1045 steps with 63 reset in 23 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-02 finished in 626 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)))'
Support contains 1 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 470 transition count 615
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 470 transition count 615
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 470 transition count 614
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 56 place count 455 transition count 599
Iterating global reduction 1 with 15 rules applied. Total rules applied 71 place count 455 transition count 599
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 80 place count 455 transition count 590
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 86 place count 449 transition count 584
Iterating global reduction 2 with 6 rules applied. Total rules applied 92 place count 449 transition count 584
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 97 place count 449 transition count 579
Applied a total of 97 rules in 36 ms. Remains 449 /490 variables (removed 41) and now considering 579/635 (removed 56) transitions.
// Phase 1: matrix 579 rows 449 cols
[2024-05-23 20:24:15] [INFO ] Computed 12 invariants in 9 ms
[2024-05-23 20:24:15] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-23 20:24:15] [INFO ] Invariant cache hit.
[2024-05-23 20:24:16] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2024-05-23 20:24:16] [INFO ] Invariant cache hit.
[2024-05-23 20:24:16] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 449/490 places, 579/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 659 ms. Remains : 449/490 places, 579/635 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s38 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1725 steps with 22 reset in 8 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-04 finished in 763 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 U (G(p0)||(p0&&G(p1)))))'
Support contains 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 455 edges and 490 vertex of which 61 / 490 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 438 transition count 531
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 387 transition count 531
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 103 place count 387 transition count 506
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 153 place count 362 transition count 506
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 189 place count 326 transition count 470
Iterating global reduction 2 with 36 rules applied. Total rules applied 225 place count 326 transition count 470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 226 place count 326 transition count 469
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 226 place count 326 transition count 468
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 228 place count 325 transition count 468
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 240 place count 313 transition count 456
Iterating global reduction 3 with 12 rules applied. Total rules applied 252 place count 313 transition count 456
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 263 place count 313 transition count 445
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 385 place count 252 transition count 384
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 386 place count 251 transition count 383
Iterating global reduction 4 with 1 rules applied. Total rules applied 387 place count 251 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 388 place count 251 transition count 382
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 398 place count 251 transition count 372
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 400 place count 249 transition count 370
Applied a total of 400 rules in 87 ms. Remains 249 /490 variables (removed 241) and now considering 370/635 (removed 265) transitions.
[2024-05-23 20:24:16] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
// Phase 1: matrix 351 rows 249 cols
[2024-05-23 20:24:16] [INFO ] Computed 12 invariants in 4 ms
[2024-05-23 20:24:16] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-23 20:24:16] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
[2024-05-23 20:24:16] [INFO ] Invariant cache hit.
[2024-05-23 20:24:16] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-23 20:24:16] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-23 20:24:16] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
[2024-05-23 20:24:16] [INFO ] Invariant cache hit.
[2024-05-23 20:24:17] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 249/490 places, 370/635 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 535 ms. Remains : 249/490 places, 370/635 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(NEQ s130 1), p1:(NEQ s226 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 6016 reset in 422 ms.
Product exploration explored 100000 steps with 6021 reset in 512 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 p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 114 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 613 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 586470 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :{}
Probabilistic random walk after 586470 steps, saw 118278 distinct states, run finished after 3002 ms. (steps per millisecond=195 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-23 20:24:21] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
[2024-05-23 20:24:21] [INFO ] Invariant cache hit.
[2024-05-23 20:24:21] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-23 20:24:21] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 20:24:21] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-23 20:24:22] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 20:24:22] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-23 20:24:22] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 370/370 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 249 transition count 350
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 30 place count 239 transition count 340
Iterating global reduction 1 with 10 rules applied. Total rules applied 40 place count 239 transition count 340
Free-agglomeration rule applied 184 times.
Iterating global reduction 1 with 184 rules applied. Total rules applied 224 place count 239 transition count 156
Reduce places removed 185 places and 0 transitions.
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 99 edges and 54 vertex of which 24 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 30 output transitions
Drop transitions removed 30 transitions
Graph (trivial) has 32 edges and 24 vertex of which 8 / 24 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 268 rules applied. Total rules applied 492 place count 20 transition count 45
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 512 place count 20 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 512 place count 20 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 520 place count 16 transition count 21
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 524 place count 16 transition count 17
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 532 place count 12 transition count 13
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 536 place count 12 transition count 9
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 547 place count 5 transition count 5
Applied a total of 547 rules in 31 ms. Remains 5 /249 variables (removed 244) and now considering 5/370 (removed 365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 5/249 places, 5/370 transitions.
Finished random walk after 14 steps, including 0 resets, run visited all 6 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 13 factoid took 137 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-10b-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-05 finished in 5991 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(X(G(p0))))))'
Support contains 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 472 transition count 617
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 472 transition count 617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 472 transition count 616
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 50 place count 459 transition count 603
Iterating global reduction 1 with 13 rules applied. Total rules applied 63 place count 459 transition count 603
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 70 place count 459 transition count 596
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 76 place count 453 transition count 590
Iterating global reduction 2 with 6 rules applied. Total rules applied 82 place count 453 transition count 590
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 87 place count 453 transition count 585
Applied a total of 87 rules in 34 ms. Remains 453 /490 variables (removed 37) and now considering 585/635 (removed 50) transitions.
// Phase 1: matrix 585 rows 453 cols
[2024-05-23 20:24:22] [INFO ] Computed 12 invariants in 4 ms
[2024-05-23 20:24:22] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-23 20:24:22] [INFO ] Invariant cache hit.
[2024-05-23 20:24:22] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-05-23 20:24:22] [INFO ] Invariant cache hit.
[2024-05-23 20:24:23] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 453/490 places, 585/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 674 ms. Remains : 453/490 places, 585/635 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-06 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: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (EQ s226 0) (EQ s399 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-06 finished in 904 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((p0||G(p1)||G((p0||X(!p1))))))'
Support contains 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 455 edges and 490 vertex of which 61 / 490 are part of one of the 10 SCC in 0 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 438 transition count 530
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 386 transition count 530
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 105 place count 386 transition count 504
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 157 place count 360 transition count 504
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 194 place count 323 transition count 467
Iterating global reduction 2 with 37 rules applied. Total rules applied 231 place count 323 transition count 467
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 323 transition count 466
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 232 place count 323 transition count 465
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 234 place count 322 transition count 465
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 247 place count 309 transition count 452
Iterating global reduction 3 with 13 rules applied. Total rules applied 260 place count 309 transition count 452
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 273 place count 309 transition count 439
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 393 place count 249 transition count 379
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 403 place count 249 transition count 369
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 405 place count 247 transition count 367
Applied a total of 405 rules in 72 ms. Remains 247 /490 variables (removed 243) and now considering 367/635 (removed 268) transitions.
[2024-05-23 20:24:23] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
// Phase 1: matrix 348 rows 247 cols
[2024-05-23 20:24:23] [INFO ] Computed 12 invariants in 8 ms
[2024-05-23 20:24:23] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-23 20:24:23] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-23 20:24:23] [INFO ] Invariant cache hit.
[2024-05-23 20:24:23] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-05-23 20:24:23] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 20:24:23] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-23 20:24:23] [INFO ] Invariant cache hit.
[2024-05-23 20:24:23] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/490 places, 367/635 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 545 ms. Remains : 247/490 places, 367/635 transitions.
Stuttering acceptance computed with spot in 34 ms :[false]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}]], initial=0, aps=[p1:(NEQ s83 1), p0:(EQ s77 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6143 reset in 371 ms.
Product exploration explored 100000 steps with 6149 reset in 426 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 p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[false]
Finished random walk after 8937 steps, including 556 resets, run visited all 2 properties in 40 ms. (steps per millisecond=223 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[false]
Stuttering acceptance computed with spot in 32 ms :[false]
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 367/367 transitions.
Applied a total of 0 rules in 15 ms. Remains 247 /247 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2024-05-23 20:24:25] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-23 20:24:25] [INFO ] Invariant cache hit.
[2024-05-23 20:24:25] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-23 20:24:25] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-23 20:24:25] [INFO ] Invariant cache hit.
[2024-05-23 20:24:25] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2024-05-23 20:24:25] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 20:24:25] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-23 20:24:25] [INFO ] Invariant cache hit.
[2024-05-23 20:24:25] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 617 ms. Remains : 247/247 places, 367/367 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 p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[false]
Incomplete random walk after 10000 steps, including 620 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-23 20:24:26] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-23 20:24:26] [INFO ] Invariant cache hit.
[2024-05-23 20:24:26] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-23 20:24:26] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 20:24:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-23 20:24:26] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 20:24:26] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-23 20:24:26] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 367/367 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 247 transition count 347
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 30 place count 237 transition count 337
Iterating global reduction 1 with 10 rules applied. Total rules applied 40 place count 237 transition count 337
Free-agglomeration rule applied 183 times.
Iterating global reduction 1 with 183 rules applied. Total rules applied 223 place count 237 transition count 154
Discarding 35 places :
Also discarding 85 output transitions
Drop transitions removed 85 transitions
Remove reverse transitions (loop back) rule discarded transition t98.t513.t432 and 35 places that fell out of Prefix Of Interest.
Drop transitions removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Graph (trivial) has 19 edges and 17 vertex of which 12 / 17 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 271 place count 8 transition count 23
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 290 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 293 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 294 place count 4 transition count 4
Applied a total of 294 rules in 22 ms. Remains 4 /247 variables (removed 243) and now considering 4/367 (removed 363) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 4/247 places, 4/367 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[false]
Stuttering acceptance computed with spot in 29 ms :[false]
Stuttering acceptance computed with spot in 47 ms :[false]
Product exploration explored 100000 steps with 6162 reset in 386 ms.
Product exploration explored 100000 steps with 6149 reset in 396 ms.
Built C files in :
/tmp/ltsmin15349270874852586333
[2024-05-23 20:24:27] [INFO ] Computing symmetric may disable matrix : 367 transitions.
[2024-05-23 20:24:27] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:24:27] [INFO ] Computing symmetric may enable matrix : 367 transitions.
[2024-05-23 20:24:27] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:24:27] [INFO ] Computing Do-Not-Accords matrix : 367 transitions.
[2024-05-23 20:24:27] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:24:27] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15349270874852586333
Running compilation step : cd /tmp/ltsmin15349270874852586333;'/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 830 ms.
Running link step : cd /tmp/ltsmin15349270874852586333;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15349270874852586333;'/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/stateBased17579958159432851348.hoa' '--buchi-type=spotba'
LTSmin run took 11909 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-07 finished in 16882 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((p0&&F(p1))))'
Support contains 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 456 edges and 490 vertex of which 61 / 490 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 438 transition count 530
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 386 transition count 530
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 105 place count 386 transition count 505
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 155 place count 361 transition count 505
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 191 place count 325 transition count 469
Iterating global reduction 2 with 36 rules applied. Total rules applied 227 place count 325 transition count 469
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 228 place count 325 transition count 468
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 228 place count 325 transition count 467
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 230 place count 324 transition count 467
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 242 place count 312 transition count 455
Iterating global reduction 3 with 12 rules applied. Total rules applied 254 place count 312 transition count 455
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 265 place count 312 transition count 444
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 387 place count 251 transition count 383
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 388 place count 250 transition count 382
Iterating global reduction 4 with 1 rules applied. Total rules applied 389 place count 250 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 390 place count 250 transition count 381
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 400 place count 250 transition count 371
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 402 place count 248 transition count 369
Applied a total of 402 rules in 62 ms. Remains 248 /490 variables (removed 242) and now considering 369/635 (removed 266) transitions.
[2024-05-23 20:24:40] [INFO ] Flow matrix only has 350 transitions (discarded 19 similar events)
// Phase 1: matrix 350 rows 248 cols
[2024-05-23 20:24:40] [INFO ] Computed 12 invariants in 6 ms
[2024-05-23 20:24:40] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-23 20:24:40] [INFO ] Flow matrix only has 350 transitions (discarded 19 similar events)
[2024-05-23 20:24:40] [INFO ] Invariant cache hit.
[2024-05-23 20:24:40] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-23 20:24:40] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 20:24:40] [INFO ] Flow matrix only has 350 transitions (discarded 19 similar events)
[2024-05-23 20:24:40] [INFO ] Invariant cache hit.
[2024-05-23 20:24:40] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 248/490 places, 369/635 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 552 ms. Remains : 248/490 places, 369/635 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s236 1) (EQ s16 1)), p0:(EQ s236 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-08 finished in 654 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(p0))'
Support contains 1 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 447 edges and 490 vertex of which 55 / 490 are part of one of the 9 SCC in 1 ms
Free SCC test removed 46 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 443 transition count 535
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 391 transition count 535
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 105 place count 391 transition count 508
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 159 place count 364 transition count 508
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 195 place count 328 transition count 472
Iterating global reduction 2 with 36 rules applied. Total rules applied 231 place count 328 transition count 472
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 328 transition count 471
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 232 place count 328 transition count 470
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 234 place count 327 transition count 470
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 247 place count 314 transition count 457
Iterating global reduction 3 with 13 rules applied. Total rules applied 260 place count 314 transition count 457
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 273 place count 314 transition count 444
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 401 place count 250 transition count 380
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 402 place count 249 transition count 379
Iterating global reduction 4 with 1 rules applied. Total rules applied 403 place count 249 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 404 place count 249 transition count 378
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 408 place count 247 transition count 389
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 420 place count 247 transition count 377
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 421 place count 246 transition count 376
Applied a total of 421 rules in 67 ms. Remains 246 /490 variables (removed 244) and now considering 376/635 (removed 259) transitions.
[2024-05-23 20:24:40] [INFO ] Flow matrix only has 358 transitions (discarded 18 similar events)
// Phase 1: matrix 358 rows 246 cols
[2024-05-23 20:24:40] [INFO ] Computed 12 invariants in 3 ms
[2024-05-23 20:24:41] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-23 20:24:41] [INFO ] Flow matrix only has 358 transitions (discarded 18 similar events)
[2024-05-23 20:24:41] [INFO ] Invariant cache hit.
[2024-05-23 20:24:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:24:41] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-23 20:24:41] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 20:24:41] [INFO ] Flow matrix only has 358 transitions (discarded 18 similar events)
[2024-05-23 20:24:41] [INFO ] Invariant cache hit.
[2024-05-23 20:24:41] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 246/490 places, 376/635 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 547 ms. Remains : 246/490 places, 376/635 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-09 finished in 592 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)&&F(G(p1)))))'
Support contains 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 455 edges and 490 vertex of which 61 / 490 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 438 transition count 530
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 386 transition count 530
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 105 place count 386 transition count 505
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 155 place count 361 transition count 505
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 192 place count 324 transition count 468
Iterating global reduction 2 with 37 rules applied. Total rules applied 229 place count 324 transition count 468
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 230 place count 324 transition count 467
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 230 place count 324 transition count 466
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 232 place count 323 transition count 466
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 244 place count 311 transition count 454
Iterating global reduction 3 with 12 rules applied. Total rules applied 256 place count 311 transition count 454
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 267 place count 311 transition count 443
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 387 place count 251 transition count 383
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 389 place count 249 transition count 381
Iterating global reduction 4 with 2 rules applied. Total rules applied 391 place count 249 transition count 381
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 393 place count 249 transition count 379
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 403 place count 249 transition count 369
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 405 place count 247 transition count 367
Applied a total of 405 rules in 59 ms. Remains 247 /490 variables (removed 243) and now considering 367/635 (removed 268) transitions.
[2024-05-23 20:24:41] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
// Phase 1: matrix 348 rows 247 cols
[2024-05-23 20:24:41] [INFO ] Computed 12 invariants in 7 ms
[2024-05-23 20:24:41] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-23 20:24:41] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-23 20:24:41] [INFO ] Invariant cache hit.
[2024-05-23 20:24:41] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-23 20:24:41] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 20:24:41] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-23 20:24:41] [INFO ] Invariant cache hit.
[2024-05-23 20:24:42] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/490 places, 367/635 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 537 ms. Remains : 247/490 places, 367/635 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s60 1), p1:(EQ s113 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-10 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' '!(F(G(p0)))'
Support contains 1 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 456 edges and 490 vertex of which 61 / 490 are part of one of the 10 SCC in 0 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 438 transition count 531
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 387 transition count 531
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 103 place count 387 transition count 505
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 155 place count 361 transition count 505
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 193 place count 323 transition count 467
Iterating global reduction 2 with 38 rules applied. Total rules applied 231 place count 323 transition count 467
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 323 transition count 466
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 232 place count 323 transition count 465
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 234 place count 322 transition count 465
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 247 place count 309 transition count 452
Iterating global reduction 3 with 13 rules applied. Total rules applied 260 place count 309 transition count 452
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 273 place count 309 transition count 439
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 393 place count 249 transition count 379
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 394 place count 248 transition count 378
Iterating global reduction 4 with 1 rules applied. Total rules applied 395 place count 248 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 396 place count 248 transition count 377
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 406 place count 248 transition count 367
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 407 place count 248 transition count 367
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 409 place count 246 transition count 365
Applied a total of 409 rules in 64 ms. Remains 246 /490 variables (removed 244) and now considering 365/635 (removed 270) transitions.
[2024-05-23 20:24:42] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2024-05-23 20:24:42] [INFO ] Computed 12 invariants in 6 ms
[2024-05-23 20:24:42] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-23 20:24:42] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
[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 194 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-23 20:24:42] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 20:24:42] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
[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 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 246/490 places, 365/635 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 529 ms. Remains : 246/490 places, 365/635 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s88 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 18682 steps with 1116 reset in 69 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-11 finished in 653 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(G(p0))&&(p1||F(G(p2))))))'
Support contains 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 472 transition count 617
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 472 transition count 617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 472 transition count 616
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 458 transition count 602
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 458 transition count 602
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 73 place count 458 transition count 594
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 78 place count 453 transition count 589
Iterating global reduction 2 with 5 rules applied. Total rules applied 83 place count 453 transition count 589
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 87 place count 453 transition count 585
Applied a total of 87 rules in 30 ms. Remains 453 /490 variables (removed 37) and now considering 585/635 (removed 50) transitions.
// Phase 1: matrix 585 rows 453 cols
[2024-05-23 20:24:42] [INFO ] Computed 12 invariants in 11 ms
[2024-05-23 20:24:43] [INFO ] Implicit Places using invariants in 193 ms returned []
[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 266 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-23 20:24:43] [INFO ] Invariant cache hit.
[2024-05-23 20:24:43] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 453/490 places, 585/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 714 ms. Remains : 453/490 places, 585/635 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s392 1), p0:(EQ s365 0), p2:(EQ s365 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-12 finished in 914 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(F(p0))||G(p1))))'
Support contains 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 471 transition count 616
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 471 transition count 616
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 471 transition count 615
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 53 place count 457 transition count 601
Iterating global reduction 1 with 14 rules applied. Total rules applied 67 place count 457 transition count 601
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 76 place count 457 transition count 592
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 452 transition count 587
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 452 transition count 587
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 90 place count 452 transition count 583
Applied a total of 90 rules in 32 ms. Remains 452 /490 variables (removed 38) and now considering 583/635 (removed 52) transitions.
// Phase 1: matrix 583 rows 452 cols
[2024-05-23 20:24:43] [INFO ] Computed 12 invariants in 6 ms
[2024-05-23 20:24:43] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-23 20:24:43] [INFO ] Invariant cache hit.
[2024-05-23 20:24:44] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 419 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 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 452/490 places, 583/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 656 ms. Remains : 452/490 places, 583/635 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s153 0), p0:(EQ s219 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-10b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-13 finished in 1393 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((F(p1)&&p0))))'
Support contains 6 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 471 transition count 616
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 471 transition count 616
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 471 transition count 615
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 458 transition count 602
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 458 transition count 602
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 72 place count 458 transition count 595
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 452 transition count 589
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 452 transition count 589
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 89 place count 452 transition count 584
Applied a total of 89 rules in 34 ms. Remains 452 /490 variables (removed 38) and now considering 584/635 (removed 51) transitions.
// Phase 1: matrix 584 rows 452 cols
[2024-05-23 20:24:45] [INFO ] Computed 12 invariants in 6 ms
[2024-05-23 20:24:45] [INFO ] Implicit Places using invariants in 134 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 258 ms returned []
Implicit Place search using SMT with State Equation took 394 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 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 452/490 places, 584/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 636 ms. Remains : 452/490 places, 584/635 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s63 1) (EQ s451 1) (OR (EQ s290 0) (EQ s304 0) (EQ s436 0))), p1:(EQ s49 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-14 finished in 787 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(p0)||X(G(p1))) U X(X(p2))))'
Support contains 5 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 473 transition count 618
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 473 transition count 618
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 47 place count 460 transition count 605
Iterating global reduction 0 with 13 rules applied. Total rules applied 60 place count 460 transition count 605
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 68 place count 460 transition count 597
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 455 transition count 592
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 455 transition count 592
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 455 transition count 588
Applied a total of 82 rules in 37 ms. Remains 455 /490 variables (removed 35) and now considering 588/635 (removed 47) transitions.
// Phase 1: matrix 588 rows 455 cols
[2024-05-23 20:24:45] [INFO ] Computed 12 invariants in 8 ms
[2024-05-23 20:24:46] [INFO ] Implicit Places using invariants in 149 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 300 ms returned []
Implicit Place search using SMT with State Equation took 451 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 216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/490 places, 588/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 706 ms. Remains : 455/490 places, 588/635 transitions.
Stuttering acceptance computed with spot in 596 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p1), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 10}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 11}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 12}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=0 dest: 13}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 12}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 13}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 11}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 10}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 11}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}, { cond=p0, acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 8}, { cond=p1, acceptance={} source=6 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND p0 p1), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 9}], [{ cond=(NOT p2), acceptance={} source=8 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=(NOT p1), acceptance={0} source=10 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=10 dest: 10}, { cond=(AND p1 p2), acceptance={0} source=10 dest: 12}], [{ cond=(NOT p0), acceptance={0} source=11 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=11 dest: 11}, { cond=(AND p0 p2), acceptance={0} source=11 dest: 13}], [{ cond=(NOT p1), acceptance={} source=12 dest: 5}, { cond=p1, acceptance={} source=12 dest: 12}], [{ cond=(NOT p0), acceptance={} source=13 dest: 5}, { cond=p0, acceptance={} source=13 dest: 13}]], initial=4, aps=[p0:(AND (EQ s129 1) (EQ s328 1) (EQ s399 1)), p1:(EQ s390 1), p2:(EQ s157 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, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-15 finished in 1327 ms.
All properties solved by simple procedures.
Total runtime 40813 ms.

BK_STOP 1716495888190

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

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