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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 13 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 08:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 08:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 1.5M 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-20b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716499843931

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-20b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 21:30:45] [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 21:30:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 21:30:45] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2024-05-23 21:30:45] [INFO ] Transformed 5372 places.
[2024-05-23 21:30:45] [INFO ] Transformed 6193 transitions.
[2024-05-23 21:30:45] [INFO ] Found NUPN structural information;
[2024-05-23 21:30:45] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 5372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Discarding 2256 places :
Symmetric choice reduction at 0 with 2256 rule applications. Total rules 2256 place count 3116 transition count 3937
Iterating global reduction 0 with 2256 rules applied. Total rules applied 4512 place count 3116 transition count 3937
Discarding 1077 places :
Symmetric choice reduction at 0 with 1077 rule applications. Total rules 5589 place count 2039 transition count 2860
Iterating global reduction 0 with 1077 rules applied. Total rules applied 6666 place count 2039 transition count 2860
Discarding 700 places :
Symmetric choice reduction at 0 with 700 rule applications. Total rules 7366 place count 1339 transition count 2160
Iterating global reduction 0 with 700 rules applied. Total rules applied 8066 place count 1339 transition count 2160
Ensure Unique test removed 341 transitions
Reduce isomorphic transitions removed 341 transitions.
Iterating post reduction 0 with 341 rules applied. Total rules applied 8407 place count 1339 transition count 1819
Applied a total of 8407 rules in 1212 ms. Remains 1339 /5372 variables (removed 4033) and now considering 1819/6193 (removed 4374) transitions.
// Phase 1: matrix 1819 rows 1339 cols
[2024-05-23 21:30:47] [INFO ] Computed 22 invariants in 75 ms
[2024-05-23 21:30:48] [INFO ] Implicit Places using invariants in 928 ms returned []
[2024-05-23 21:30:48] [INFO ] Invariant cache hit.
[2024-05-23 21:30:49] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned []
Implicit Place search using SMT with State Equation took 2195 ms to find 0 implicit places.
[2024-05-23 21:30:49] [INFO ] Invariant cache hit.
[2024-05-23 21:30:50] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1339/5372 places, 1819/6193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4136 ms. Remains : 1339/5372 places, 1819/6193 transitions.
Support contains 40 out of 1339 places after structural reductions.
[2024-05-23 21:30:50] [INFO ] Flatten gal took : 130 ms
[2024-05-23 21:30:50] [INFO ] Flatten gal took : 79 ms
[2024-05-23 21:30:50] [INFO ] Input system was already deterministic with 1819 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 33) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) 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 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) seen :0
Running SMT prover for 27 properties.
[2024-05-23 21:30:51] [INFO ] Invariant cache hit.
[2024-05-23 21:30:52] [INFO ] [Real]Absence check using 22 positive place invariants in 18 ms returned sat
[2024-05-23 21:30:52] [INFO ] After 1130ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:26
[2024-05-23 21:30:53] [INFO ] [Nat]Absence check using 22 positive place invariants in 20 ms returned sat
[2024-05-23 21:30:56] [INFO ] After 2450ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :26
[2024-05-23 21:30:56] [INFO ] Deduced a trap composed of 165 places in 129 ms of which 4 ms to minimize.
[2024-05-23 21:30:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2024-05-23 21:30:57] [INFO ] Deduced a trap composed of 456 places in 481 ms of which 1 ms to minimize.
[2024-05-23 21:30:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 579 ms
[2024-05-23 21:30:59] [INFO ] After 6100ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :26
Attempting to minimize the solution found.
Minimization took 1648 ms.
[2024-05-23 21:31:01] [INFO ] After 9051ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :26
Fused 27 Parikh solutions to 24 different solutions.
Parikh walk visited 19 properties in 278 ms.
Support contains 10 out of 1339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Graph (trivial) has 1265 edges and 1339 vertex of which 121 / 1339 are part of one of the 20 SCC in 5 ms
Free SCC test removed 101 places
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 1238 transition count 1597
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 201 place count 1138 transition count 1597
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 201 place count 1138 transition count 1551
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 293 place count 1092 transition count 1551
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 347 place count 1038 transition count 1497
Iterating global reduction 2 with 54 rules applied. Total rules applied 401 place count 1038 transition count 1497
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 404 place count 1038 transition count 1494
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 414 place count 1028 transition count 1484
Iterating global reduction 3 with 10 rules applied. Total rules applied 424 place count 1028 transition count 1484
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 432 place count 1028 transition count 1476
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 682 place count 903 transition count 1351
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 722 place count 903 transition count 1311
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 744 place count 881 transition count 1289
Iterating global reduction 5 with 22 rules applied. Total rules applied 766 place count 881 transition count 1289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 768 place count 881 transition count 1287
Free-agglomeration rule applied 766 times.
Iterating global reduction 6 with 766 rules applied. Total rules applied 1534 place count 881 transition count 521
Reduce places removed 766 places and 0 transitions.
Drop transitions removed 341 transitions
Reduce isomorphic transitions removed 341 transitions.
Iterating post reduction 6 with 1107 rules applied. Total rules applied 2641 place count 115 transition count 180
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2642 place count 115 transition count 179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2643 place count 114 transition count 178
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 100 edges and 113 vertex of which 40 / 113 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 2645 place count 93 transition count 178
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 8 with 40 rules applied. Total rules applied 2685 place count 93 transition count 138
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 20 Pre rules applied. Total rules applied 2685 place count 93 transition count 118
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 2725 place count 73 transition count 118
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 2745 place count 73 transition count 98
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 10 with 40 rules applied. Total rules applied 2785 place count 53 transition count 78
Free-agglomeration rule applied 20 times.
Iterating global reduction 10 with 20 rules applied. Total rules applied 2805 place count 53 transition count 58
Reduce places removed 36 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 10 with 70 rules applied. Total rules applied 2875 place count 17 transition count 24
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 2878 place count 17 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2879 place count 17 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2880 place count 16 transition count 20
Applied a total of 2880 rules in 707 ms. Remains 16 /1339 variables (removed 1323) and now considering 20/1819 (removed 1799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 707 ms. Remains : 16/1339 places, 20/1819 transitions.
Finished random walk after 37 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 22 stabilizing places and 22 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' '!(X((X(p0) U (p1&&F(p2)&&G(p0)&&X(p3)))))'
Support contains 4 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1317 transition count 1797
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1317 transition count 1797
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 1317 transition count 1793
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 1302 transition count 1778
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 1302 transition count 1778
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 88 place count 1302 transition count 1768
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 1299 transition count 1765
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 1299 transition count 1765
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 1299 transition count 1763
Applied a total of 96 rules in 175 ms. Remains 1299 /1339 variables (removed 40) and now considering 1763/1819 (removed 56) transitions.
// Phase 1: matrix 1763 rows 1299 cols
[2024-05-23 21:31:03] [INFO ] Computed 22 invariants in 48 ms
[2024-05-23 21:31:03] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-05-23 21:31:03] [INFO ] Invariant cache hit.
[2024-05-23 21:31:05] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1867 ms to find 0 implicit places.
[2024-05-23 21:31:05] [INFO ] Invariant cache hit.
[2024-05-23 21:31:05] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1299/1339 places, 1763/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2709 ms. Remains : 1299/1339 places, 1763/1819 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 457 ms :[(OR (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (NOT p0), (NOT p2), (NOT p0), (NOT p3), true]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 1}, { cond=true, acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), acceptance={0} source=5 dest: 1}, { cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2) p0 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s805 1), p0:(EQ s250 1), p2:(EQ s342 1), p3:(EQ s1248 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-00 finished in 3245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((!(p0 U p1)||X(X(p2))||G(X(p0)))))))'
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1315 transition count 1795
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1315 transition count 1795
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 1315 transition count 1791
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 69 place count 1298 transition count 1774
Iterating global reduction 1 with 17 rules applied. Total rules applied 86 place count 1298 transition count 1774
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 96 place count 1298 transition count 1764
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 102 place count 1292 transition count 1758
Iterating global reduction 2 with 6 rules applied. Total rules applied 108 place count 1292 transition count 1758
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 113 place count 1292 transition count 1753
Applied a total of 113 rules in 192 ms. Remains 1292 /1339 variables (removed 47) and now considering 1753/1819 (removed 66) transitions.
// Phase 1: matrix 1753 rows 1292 cols
[2024-05-23 21:31:06] [INFO ] Computed 22 invariants in 32 ms
[2024-05-23 21:31:07] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-05-23 21:31:07] [INFO ] Invariant cache hit.
[2024-05-23 21:31:08] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 1777 ms to find 0 implicit places.
[2024-05-23 21:31:08] [INFO ] Invariant cache hit.
[2024-05-23 21:31:09] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1292/1339 places, 1753/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2657 ms. Remains : 1292/1339 places, 1753/1819 transitions.
Stuttering acceptance computed with spot in 371 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), false]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=7 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s222 1), p0:(EQ s461 1), p2:(EQ s222 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 733 reset in 454 ms.
Product exploration explored 100000 steps with 734 reset in 317 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 159 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 74 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 168634 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{1=1, 2=1, 13=1}
Probabilistic random walk after 168634 steps, saw 82093 distinct states, run finished after 3002 ms. (steps per millisecond=56 ) properties seen :3
Running SMT prover for 11 properties.
[2024-05-23 21:31:14] [INFO ] Invariant cache hit.
[2024-05-23 21:31:14] [INFO ] [Real]Absence check using 22 positive place invariants in 16 ms returned sat
[2024-05-23 21:31:15] [INFO ] After 683ms SMT Verify possible using state equation in real domain returned unsat :2 sat :4 real:5
[2024-05-23 21:31:16] [INFO ] After 1033ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :4 real:5
Attempting to minimize the solution found.
Minimization took 217 ms.
[2024-05-23 21:31:16] [INFO ] After 1733ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :3 real:6
[2024-05-23 21:31:16] [INFO ] [Nat]Absence check using 22 positive place invariants in 15 ms returned sat
[2024-05-23 21:31:17] [INFO ] After 836ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2024-05-23 21:31:18] [INFO ] After 1510ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 389 ms.
[2024-05-23 21:31:18] [INFO ] After 2350ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
Fused 11 Parikh solutions to 5 different solutions.
Finished Parikh walk after 136 steps, including 0 resets, run visited all 8 properties in 4 ms. (steps per millisecond=34 )
Parikh walk visited 8 properties in 3 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (G (NOT (AND p1 p0 p2))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND (NOT p1) p0 (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND p1 p0 (NOT p2))), (F (AND p1 p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p0 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F p1), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 14 factoid took 791 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 313 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Support contains 2 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 1753/1753 transitions.
Applied a total of 0 rules in 52 ms. Remains 1292 /1292 variables (removed 0) and now considering 1753/1753 (removed 0) transitions.
[2024-05-23 21:31:20] [INFO ] Invariant cache hit.
[2024-05-23 21:31:20] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-23 21:31:20] [INFO ] Invariant cache hit.
[2024-05-23 21:31:21] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
[2024-05-23 21:31:21] [INFO ] Invariant cache hit.
[2024-05-23 21:31:22] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2429 ms. Remains : 1292/1292 places, 1753/1753 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND p1 (NOT p0)))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 134 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-23 21:31:23] [INFO ] Invariant cache hit.
[2024-05-23 21:31:23] [INFO ] [Real]Absence check using 22 positive place invariants in 13 ms returned sat
[2024-05-23 21:31:24] [INFO ] After 627ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2024-05-23 21:31:24] [INFO ] After 892ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:2
Attempting to minimize the solution found.
Minimization took 156 ms.
[2024-05-23 21:31:24] [INFO ] After 1378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:2
[2024-05-23 21:31:24] [INFO ] [Nat]Absence check using 22 positive place invariants in 17 ms returned sat
[2024-05-23 21:31:25] [INFO ] After 708ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 21:31:26] [INFO ] After 1147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 236 ms.
[2024-05-23 21:31:26] [INFO ] After 1702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 4 properties in 6 ms.
Support contains 2 out of 1292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1292/1292 places, 1753/1753 transitions.
Graph (trivial) has 1227 edges and 1292 vertex of which 121 / 1292 are part of one of the 20 SCC in 2 ms
Free SCC test removed 101 places
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 1191 transition count 1532
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 199 place count 1092 transition count 1532
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 199 place count 1092 transition count 1491
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 281 place count 1051 transition count 1491
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 320 place count 1012 transition count 1452
Iterating global reduction 2 with 39 rules applied. Total rules applied 359 place count 1012 transition count 1452
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 605 place count 889 transition count 1329
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 645 place count 889 transition count 1289
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 665 place count 869 transition count 1269
Iterating global reduction 3 with 20 rules applied. Total rules applied 685 place count 869 transition count 1269
Free-agglomeration rule applied 763 times.
Iterating global reduction 3 with 763 rules applied. Total rules applied 1448 place count 869 transition count 506
Reduce places removed 763 places and 0 transitions.
Drop transitions removed 361 transitions
Reduce isomorphic transitions removed 361 transitions.
Graph (complete) has 288 edges and 106 vertex of which 21 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.1 ms
Discarding 85 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1125 rules applied. Total rules applied 2573 place count 21 transition count 145
Drop transitions removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Iterating post reduction 4 with 119 rules applied. Total rules applied 2692 place count 21 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2693 place count 21 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2694 place count 20 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 21 edges and 18 vertex of which 14 / 18 are part of one of the 4 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 5 rules applied. Total rules applied 2699 place count 8 transition count 23
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 22 rules applied. Total rules applied 2721 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2722 place count 4 transition count 4
Applied a total of 2722 rules in 260 ms. Remains 4 /1292 variables (removed 1288) and now considering 4/1753 (removed 1749) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 4/1292 places, 4/1753 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND p1 (NOT p0)))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND p1 (NOT p0))), (F (NOT p2)), (F (AND p0 p2)), (F p1), (F p0), (F (AND (NOT p1) p0 p2)), (F (OR (AND (NOT p1) (NOT p2)) (AND p1 (NOT p0))))]
Knowledge based reduction with 9 factoid took 485 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 252 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 252 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 733 reset in 264 ms.
Product exploration explored 100000 steps with 735 reset in 272 ms.
Built C files in :
/tmp/ltsmin3186145070242312231
[2024-05-23 21:31:28] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3186145070242312231
Running compilation step : cd /tmp/ltsmin3186145070242312231;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3186145070242312231;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3186145070242312231;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 1753/1753 transitions.
Applied a total of 0 rules in 44 ms. Remains 1292 /1292 variables (removed 0) and now considering 1753/1753 (removed 0) transitions.
[2024-05-23 21:31:31] [INFO ] Invariant cache hit.
[2024-05-23 21:31:32] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-05-23 21:31:32] [INFO ] Invariant cache hit.
[2024-05-23 21:31:33] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1714 ms to find 0 implicit places.
[2024-05-23 21:31:33] [INFO ] Invariant cache hit.
[2024-05-23 21:31:34] [INFO ] Dead Transitions using invariants and state equation in 647 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2415 ms. Remains : 1292/1292 places, 1753/1753 transitions.
Built C files in :
/tmp/ltsmin9479652493202351187
[2024-05-23 21:31:34] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9479652493202351187
Running compilation step : cd /tmp/ltsmin9479652493202351187;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9479652493202351187;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9479652493202351187;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 21:31:37] [INFO ] Flatten gal took : 60 ms
[2024-05-23 21:31:37] [INFO ] Flatten gal took : 58 ms
[2024-05-23 21:31:37] [INFO ] Time to serialize gal into /tmp/LTL13706720461008393656.gal : 13 ms
[2024-05-23 21:31:37] [INFO ] Time to serialize properties into /tmp/LTL13983681664390070939.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13706720461008393656.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8978457811137177638.hoa' '-atoms' '/tmp/LTL13983681664390070939.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(G(((!(("(p1803==1)")U("(p882==1)")))||(X(X("(p882==0)"))))||(G(X("(p1803==1)"))))))))
Formula 0 simplified : GF(("(p1803==1)" U "(p882==1)") & X(X!"(p882==0)" & F!"(p1803==1)"))
Detected timeout of ITS tools.
[2024-05-23 21:32:07] [INFO ] Flatten gal took : 47 ms
[2024-05-23 21:32:07] [INFO ] Applying decomposition
[2024-05-23 21:32:07] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12278849000458547705.txt' '-o' '/tmp/graph12278849000458547705.bin' '-w' '/tmp/graph12278849000458547705.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12278849000458547705.bin' '-l' '-1' '-v' '-w' '/tmp/graph12278849000458547705.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:32:08] [INFO ] Decomposing Gal with order
[2024-05-23 21:32:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:32:08] [INFO ] Removed a total of 520 redundant transitions.
[2024-05-23 21:32:08] [INFO ] Flatten gal took : 496 ms
[2024-05-23 21:32:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 56 ms.
[2024-05-23 21:32:08] [INFO ] Time to serialize gal into /tmp/LTL14870674661373609364.gal : 34 ms
[2024-05-23 21:32:08] [INFO ] Time to serialize properties into /tmp/LTL15152648631453530054.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14870674661373609364.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15152648631453530054.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F(G(((!(("(i9.i0.i1.u107.p1803==1)")U("(i4.i1.i0.u54.p882==1)")))||(X(X("(i4.i1.i0.u54.p882==0)"))))||(G(X("(i9.i0.i1.u107.p1803=...167
Formula 0 simplified : GF(("(i9.i0.i1.u107.p1803==1)" U "(i4.i1.i0.u54.p882==1)") & X(X!"(i4.i1.i0.u54.p882==0)" & F!"(i9.i0.i1.u107.p1803==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8560925775910145907
[2024-05-23 21:32:23] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8560925775910145907
Running compilation step : cd /tmp/ltsmin8560925775910145907;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8560925775910145907;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8560925775910145907;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-01 finished in 80599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1314 transition count 1794
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1314 transition count 1794
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 1314 transition count 1790
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 71 place count 1297 transition count 1773
Iterating global reduction 1 with 17 rules applied. Total rules applied 88 place count 1297 transition count 1773
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 99 place count 1297 transition count 1762
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 104 place count 1292 transition count 1757
Iterating global reduction 2 with 5 rules applied. Total rules applied 109 place count 1292 transition count 1757
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 113 place count 1292 transition count 1753
Applied a total of 113 rules in 199 ms. Remains 1292 /1339 variables (removed 47) and now considering 1753/1819 (removed 66) transitions.
// Phase 1: matrix 1753 rows 1292 cols
[2024-05-23 21:32:27] [INFO ] Computed 22 invariants in 26 ms
[2024-05-23 21:32:27] [INFO ] Implicit Places using invariants in 642 ms returned []
[2024-05-23 21:32:27] [INFO ] Invariant cache hit.
[2024-05-23 21:32:29] [INFO ] Implicit Places using invariants and state equation in 1227 ms returned []
Implicit Place search using SMT with State Equation took 1871 ms to find 0 implicit places.
[2024-05-23 21:32:29] [INFO ] Invariant cache hit.
[2024-05-23 21:32:29] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1292/1339 places, 1753/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2750 ms. Remains : 1292/1339 places, 1753/1819 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s644 1), p1:(EQ s700 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-04 finished in 2914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p0))||(p1&&X((p0&&G(p2)))))))'
Support contains 4 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1317 transition count 1797
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1317 transition count 1797
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 1317 transition count 1793
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 1302 transition count 1778
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 1302 transition count 1778
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 87 place count 1302 transition count 1769
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 1297 transition count 1764
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 1297 transition count 1764
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 1297 transition count 1760
Applied a total of 101 rules in 173 ms. Remains 1297 /1339 variables (removed 42) and now considering 1760/1819 (removed 59) transitions.
// Phase 1: matrix 1760 rows 1297 cols
[2024-05-23 21:32:30] [INFO ] Computed 22 invariants in 44 ms
[2024-05-23 21:32:30] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-23 21:32:30] [INFO ] Invariant cache hit.
[2024-05-23 21:32:31] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 1705 ms to find 0 implicit places.
[2024-05-23 21:32:31] [INFO ] Invariant cache hit.
[2024-05-23 21:32:32] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1297/1339 places, 1760/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2553 ms. Remains : 1297/1339 places, 1760/1819 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p0 p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(EQ s424 1), p2:(OR (EQ s1141 1) (EQ s1191 1)), p0:(NEQ s384 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 734 reset in 324 ms.
Product exploration explored 100000 steps with 732 reset in 321 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (AND (NOT p1) p0 (NOT p2))), (X p0), (X (NOT (AND p1 p0))), (X (NOT (AND p0 p2))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0 (NOT p2)))), true, (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 151 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 192781 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192781 steps, saw 86315 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 9 properties.
[2024-05-23 21:32:37] [INFO ] Invariant cache hit.
[2024-05-23 21:32:37] [INFO ] [Real]Absence check using 22 positive place invariants in 13 ms returned sat
[2024-05-23 21:32:38] [INFO ] After 640ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2024-05-23 21:32:38] [INFO ] After 735ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-23 21:32:38] [INFO ] After 1128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-23 21:32:38] [INFO ] [Nat]Absence check using 22 positive place invariants in 15 ms returned sat
[2024-05-23 21:32:39] [INFO ] After 924ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-23 21:32:40] [INFO ] After 1703ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 476 ms.
[2024-05-23 21:32:40] [INFO ] After 2648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 3 properties in 27 ms.
Support contains 4 out of 1297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 1760/1760 transitions.
Graph (trivial) has 1229 edges and 1297 vertex of which 121 / 1297 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 1196 transition count 1541
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 1099 transition count 1541
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 195 place count 1099 transition count 1499
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 279 place count 1057 transition count 1499
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 317 place count 1019 transition count 1461
Iterating global reduction 2 with 38 rules applied. Total rules applied 355 place count 1019 transition count 1461
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 605 place count 894 transition count 1336
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 645 place count 894 transition count 1296
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 665 place count 874 transition count 1276
Iterating global reduction 3 with 20 rules applied. Total rules applied 685 place count 874 transition count 1276
Free-agglomeration rule applied 765 times.
Iterating global reduction 3 with 765 rules applied. Total rules applied 1450 place count 874 transition count 511
Reduce places removed 765 places and 0 transitions.
Drop transitions removed 342 transitions
Reduce isomorphic transitions removed 342 transitions.
Iterating post reduction 3 with 1107 rules applied. Total rules applied 2557 place count 109 transition count 169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2558 place count 108 transition count 168
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 100 edges and 107 vertex of which 40 / 107 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 2560 place count 87 transition count 168
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 2600 place count 87 transition count 128
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2600 place count 87 transition count 108
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 2640 place count 67 transition count 108
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 2660 place count 67 transition count 88
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 2700 place count 47 transition count 68
Free-agglomeration rule applied 20 times.
Iterating global reduction 7 with 20 rules applied. Total rules applied 2720 place count 47 transition count 48
Reduce places removed 39 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 7 with 77 rules applied. Total rules applied 2797 place count 8 transition count 10
Applied a total of 2797 rules in 247 ms. Remains 8 /1297 variables (removed 1289) and now considering 10/1760 (removed 1750) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 8/1297 places, 10/1760 transitions.
Finished random walk after 16 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (AND (NOT p1) p0 (NOT p2))), (X p0), (X (NOT (AND p1 p0))), (X (NOT (AND p0 p2))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0 (NOT p2)))), true, (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 p2)), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F p2), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p2)))
Knowledge based reduction with 16 factoid took 493 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-20b-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-05 finished in 11793 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(F(p0)))))'
Support contains 1 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1314 transition count 1794
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1314 transition count 1794
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 1314 transition count 1790
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 71 place count 1297 transition count 1773
Iterating global reduction 1 with 17 rules applied. Total rules applied 88 place count 1297 transition count 1773
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 99 place count 1297 transition count 1762
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 104 place count 1292 transition count 1757
Iterating global reduction 2 with 5 rules applied. Total rules applied 109 place count 1292 transition count 1757
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 114 place count 1292 transition count 1752
Applied a total of 114 rules in 185 ms. Remains 1292 /1339 variables (removed 47) and now considering 1752/1819 (removed 67) transitions.
// Phase 1: matrix 1752 rows 1292 cols
[2024-05-23 21:32:41] [INFO ] Computed 22 invariants in 36 ms
[2024-05-23 21:32:42] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-05-23 21:32:42] [INFO ] Invariant cache hit.
[2024-05-23 21:32:43] [INFO ] Implicit Places using invariants and state equation in 1149 ms returned []
Implicit Place search using SMT with State Equation took 1668 ms to find 0 implicit places.
[2024-05-23 21:32:43] [INFO ] Invariant cache hit.
[2024-05-23 21:32:44] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1292/1339 places, 1752/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2541 ms. Remains : 1292/1339 places, 1752/1819 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s1164 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-06 finished in 2711 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(F((p0||G(p1)))))))'
Support contains 5 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1316 transition count 1796
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1316 transition count 1796
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 1316 transition count 1793
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 65 place count 1300 transition count 1777
Iterating global reduction 1 with 16 rules applied. Total rules applied 81 place count 1300 transition count 1777
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 91 place count 1300 transition count 1767
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 97 place count 1294 transition count 1761
Iterating global reduction 2 with 6 rules applied. Total rules applied 103 place count 1294 transition count 1761
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 108 place count 1294 transition count 1756
Applied a total of 108 rules in 171 ms. Remains 1294 /1339 variables (removed 45) and now considering 1756/1819 (removed 63) transitions.
// Phase 1: matrix 1756 rows 1294 cols
[2024-05-23 21:32:44] [INFO ] Computed 22 invariants in 32 ms
[2024-05-23 21:32:45] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-23 21:32:45] [INFO ] Invariant cache hit.
[2024-05-23 21:32:46] [INFO ] Implicit Places using invariants and state equation in 1230 ms returned []
Implicit Place search using SMT with State Equation took 1713 ms to find 0 implicit places.
[2024-05-23 21:32:46] [INFO ] Invariant cache hit.
[2024-05-23 21:32:46] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1294/1339 places, 1756/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2531 ms. Remains : 1294/1339 places, 1756/1819 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s1047 1) (EQ s308 1) (EQ s695 1) (EQ s1045 1) (EQ s1270 1)), p0:(AND (EQ s308 1) (EQ s695 1) (EQ s1045 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-07 finished in 2688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(((X(G(p0)) U G(p0))||G(F(p1)))))))'
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1313 transition count 1793
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1313 transition count 1793
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 1313 transition count 1789
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 74 place count 1295 transition count 1771
Iterating global reduction 1 with 18 rules applied. Total rules applied 92 place count 1295 transition count 1771
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 103 place count 1295 transition count 1760
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 109 place count 1289 transition count 1754
Iterating global reduction 2 with 6 rules applied. Total rules applied 115 place count 1289 transition count 1754
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 120 place count 1289 transition count 1749
Applied a total of 120 rules in 168 ms. Remains 1289 /1339 variables (removed 50) and now considering 1749/1819 (removed 70) transitions.
// Phase 1: matrix 1749 rows 1289 cols
[2024-05-23 21:32:47] [INFO ] Computed 22 invariants in 33 ms
[2024-05-23 21:32:47] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-05-23 21:32:47] [INFO ] Invariant cache hit.
[2024-05-23 21:32:48] [INFO ] Implicit Places using invariants and state equation in 1244 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
[2024-05-23 21:32:49] [INFO ] Invariant cache hit.
[2024-05-23 21:32:49] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1289/1339 places, 1749/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2599 ms. Remains : 1289/1339 places, 1749/1819 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s331 1), p1:(EQ s1283 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-09 finished in 2778 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) U p1)||G(F(!p0))))'
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Graph (trivial) has 1252 edges and 1339 vertex of which 115 / 1339 are part of one of the 19 SCC in 6 ms
Free SCC test removed 96 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 1242 transition count 1619
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 205 place count 1140 transition count 1619
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 205 place count 1140 transition count 1573
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 297 place count 1094 transition count 1573
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 356 place count 1035 transition count 1514
Iterating global reduction 2 with 59 rules applied. Total rules applied 415 place count 1035 transition count 1514
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 419 place count 1035 transition count 1510
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 419 place count 1035 transition count 1508
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 423 place count 1033 transition count 1508
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 436 place count 1020 transition count 1495
Iterating global reduction 3 with 13 rules applied. Total rules applied 449 place count 1020 transition count 1495
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 461 place count 1020 transition count 1483
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 711 place count 895 transition count 1358
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 714 place count 892 transition count 1355
Iterating global reduction 4 with 3 rules applied. Total rules applied 717 place count 892 transition count 1355
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 720 place count 892 transition count 1352
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 722 place count 891 transition count 1352
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 743 place count 891 transition count 1331
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 745 place count 889 transition count 1329
Applied a total of 745 rules in 598 ms. Remains 889 /1339 variables (removed 450) and now considering 1329/1819 (removed 490) transitions.
[2024-05-23 21:32:50] [INFO ] Flow matrix only has 1291 transitions (discarded 38 similar events)
// Phase 1: matrix 1291 rows 889 cols
[2024-05-23 21:32:50] [INFO ] Computed 22 invariants in 29 ms
[2024-05-23 21:32:50] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-23 21:32:50] [INFO ] Flow matrix only has 1291 transitions (discarded 38 similar events)
[2024-05-23 21:32:50] [INFO ] Invariant cache hit.
[2024-05-23 21:32:51] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1379 ms to find 0 implicit places.
[2024-05-23 21:32:51] [INFO ] Redundant transitions in 81 ms returned []
[2024-05-23 21:32:51] [INFO ] Flow matrix only has 1291 transitions (discarded 38 similar events)
[2024-05-23 21:32:51] [INFO ] Invariant cache hit.
[2024-05-23 21:32:52] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 889/1339 places, 1329/1819 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2539 ms. Remains : 889/1339 places, 1329/1819 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s471 1), p0:(NEQ s469 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-10 finished in 2632 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&&G(p2))))))'
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1315 transition count 1795
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1315 transition count 1795
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 1315 transition count 1791
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 68 place count 1299 transition count 1775
Iterating global reduction 1 with 16 rules applied. Total rules applied 84 place count 1299 transition count 1775
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 93 place count 1299 transition count 1766
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 99 place count 1293 transition count 1760
Iterating global reduction 2 with 6 rules applied. Total rules applied 105 place count 1293 transition count 1760
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 110 place count 1293 transition count 1755
Applied a total of 110 rules in 164 ms. Remains 1293 /1339 variables (removed 46) and now considering 1755/1819 (removed 64) transitions.
// Phase 1: matrix 1755 rows 1293 cols
[2024-05-23 21:32:52] [INFO ] Computed 22 invariants in 33 ms
[2024-05-23 21:32:53] [INFO ] Implicit Places using invariants in 526 ms returned []
[2024-05-23 21:32:53] [INFO ] Invariant cache hit.
[2024-05-23 21:32:54] [INFO ] Implicit Places using invariants and state equation in 1221 ms returned []
Implicit Place search using SMT with State Equation took 1749 ms to find 0 implicit places.
[2024-05-23 21:32:54] [INFO ] Invariant cache hit.
[2024-05-23 21:32:55] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1293/1339 places, 1755/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2579 ms. Remains : 1293/1339 places, 1755/1819 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s521 0), p1:(EQ s295 0), p2:(EQ s295 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 735 reset in 291 ms.
Product exploration explored 100000 steps with 734 reset in 350 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 154 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false]
Incomplete random walk after 10000 steps, including 74 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 190183 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 190183 steps, saw 80224 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-23 21:32:59] [INFO ] Invariant cache hit.
[2024-05-23 21:32:59] [INFO ] [Real]Absence check using 22 positive place invariants in 13 ms returned sat
[2024-05-23 21:33:00] [INFO ] After 474ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:5
[2024-05-23 21:33:00] [INFO ] After 567ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:6
[2024-05-23 21:33:00] [INFO ] After 822ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:6
[2024-05-23 21:33:00] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2024-05-23 21:33:01] [INFO ] After 750ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2024-05-23 21:33:02] [INFO ] After 1269ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 302 ms.
[2024-05-23 21:33:02] [INFO ] After 1896ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 4 different solutions.
Finished Parikh walk after 99 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=99 )
Parikh walk visited 4 properties in 10 ms.
Support contains 2 out of 1293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1293/1293 places, 1755/1755 transitions.
Graph (trivial) has 1229 edges and 1293 vertex of which 121 / 1293 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 1192 transition count 1537
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 1096 transition count 1537
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 193 place count 1096 transition count 1495
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 277 place count 1054 transition count 1495
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 316 place count 1015 transition count 1456
Iterating global reduction 2 with 39 rules applied. Total rules applied 355 place count 1015 transition count 1456
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 357 place count 1013 transition count 1454
Iterating global reduction 2 with 2 rules applied. Total rules applied 359 place count 1013 transition count 1454
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 607 place count 889 transition count 1330
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 647 place count 889 transition count 1290
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 667 place count 869 transition count 1270
Iterating global reduction 3 with 20 rules applied. Total rules applied 687 place count 869 transition count 1270
Free-agglomeration rule applied 764 times.
Iterating global reduction 3 with 764 rules applied. Total rules applied 1451 place count 869 transition count 506
Reduce places removed 764 places and 0 transitions.
Drop transitions removed 361 transitions
Reduce isomorphic transitions removed 361 transitions.
Graph (complete) has 290 edges and 105 vertex of which 25 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.0 ms
Discarding 80 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1126 rules applied. Total rules applied 2577 place count 25 transition count 145
Drop transitions removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 4 with 112 rules applied. Total rules applied 2689 place count 25 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2690 place count 24 transition count 32
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 28 edges and 22 vertex of which 20 / 22 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 2693 place count 6 transition count 32
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 2723 place count 4 transition count 4
Applied a total of 2723 rules in 259 ms. Remains 4 /1293 variables (removed 1289) and now considering 4/1755 (removed 1751) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 4/1293 places, 4/1755 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) p1 p2)), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (AND p0 p1 p2)), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 13 factoid took 489 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false]
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false]
Support contains 2 out of 1293 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1293/1293 places, 1755/1755 transitions.
Graph (trivial) has 1229 edges and 1293 vertex of which 121 / 1293 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 1191 transition count 1556
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 1095 transition count 1556
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 193 place count 1095 transition count 1514
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 277 place count 1053 transition count 1514
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 316 place count 1014 transition count 1475
Iterating global reduction 2 with 39 rules applied. Total rules applied 355 place count 1014 transition count 1475
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 357 place count 1012 transition count 1473
Iterating global reduction 2 with 2 rules applied. Total rules applied 359 place count 1012 transition count 1473
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 603 place count 890 transition count 1351
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 623 place count 890 transition count 1331
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 625 place count 888 transition count 1329
Applied a total of 625 rules in 393 ms. Remains 888 /1293 variables (removed 405) and now considering 1329/1755 (removed 426) transitions.
[2024-05-23 21:33:03] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
// Phase 1: matrix 1290 rows 888 cols
[2024-05-23 21:33:03] [INFO ] Computed 22 invariants in 32 ms
[2024-05-23 21:33:04] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-05-23 21:33:04] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 21:33:04] [INFO ] Invariant cache hit.
[2024-05-23 21:33:05] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1423 ms to find 0 implicit places.
[2024-05-23 21:33:05] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-23 21:33:05] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 21:33:05] [INFO ] Invariant cache hit.
[2024-05-23 21:33:05] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 888/1293 places, 1329/1755 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2306 ms. Remains : 888/1293 places, 1329/1755 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p2))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 196 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false]
Incomplete random walk after 10000 steps, including 386 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 298406 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 298406 steps, saw 78196 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-23 21:33:10] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 21:33:10] [INFO ] Invariant cache hit.
[2024-05-23 21:33:10] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned sat
[2024-05-23 21:33:10] [INFO ] After 543ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:6
[2024-05-23 21:33:10] [INFO ] [Nat]Absence check using 22 positive place invariants in 13 ms returned sat
[2024-05-23 21:33:11] [INFO ] After 577ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2024-05-23 21:33:11] [INFO ] After 944ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 222 ms.
[2024-05-23 21:33:12] [INFO ] After 1420ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 888/888 places, 1329/1329 transitions.
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 888 transition count 1289
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 60 place count 868 transition count 1269
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 868 transition count 1269
Free-agglomeration rule applied 764 times.
Iterating global reduction 1 with 764 rules applied. Total rules applied 844 place count 868 transition count 505
Discarding 80 places :
Also discarding 337 output transitions
Drop transitions removed 337 transitions
Remove reverse transitions (loop back) rule discarded transition t379.t1388.t1245 and 80 places that fell out of Prefix Of Interest.
Drop transitions removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Graph (trivial) has 28 edges and 22 vertex of which 20 / 22 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 1 with 138 rules applied. Total rules applied 982 place count 6 transition count 32
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1012 place count 4 transition count 4
Applied a total of 1012 rules in 130 ms. Remains 4 /888 variables (removed 884) and now considering 4/1329 (removed 1325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 4/888 places, 4/1329 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p2))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p2)))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 19 factoid took 562 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3781 reset in 1226 ms.
Product exploration explored 100000 steps with 3775 reset in 1136 ms.
Built C files in :
/tmp/ltsmin12352777115043947506
[2024-05-23 21:33:15] [INFO ] Computing symmetric may disable matrix : 1329 transitions.
[2024-05-23 21:33:15] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:33:15] [INFO ] Computing symmetric may enable matrix : 1329 transitions.
[2024-05-23 21:33:15] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:33:15] [INFO ] Computing Do-Not-Accords matrix : 1329 transitions.
[2024-05-23 21:33:15] [INFO ] Computation of Completed DNA matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:33:15] [INFO ] Built C files in 440ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12352777115043947506
Running compilation step : cd /tmp/ltsmin12352777115043947506;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12352777115043947506;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12352777115043947506;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 888 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 888/888 places, 1329/1329 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 887 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 886 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 886 transition count 1327
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 886 transition count 1326
Applied a total of 5 rules in 122 ms. Remains 886 /888 variables (removed 2) and now considering 1326/1329 (removed 3) transitions.
[2024-05-23 21:33:18] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2024-05-23 21:33:19] [INFO ] Computed 22 invariants in 29 ms
[2024-05-23 21:33:19] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-23 21:33:19] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 21:33:19] [INFO ] Invariant cache hit.
[2024-05-23 21:33:20] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
[2024-05-23 21:33:20] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-23 21:33:20] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 21:33:20] [INFO ] Invariant cache hit.
[2024-05-23 21:33:20] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 886/888 places, 1326/1329 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1947 ms. Remains : 886/888 places, 1326/1329 transitions.
Built C files in :
/tmp/ltsmin14696520143279392287
[2024-05-23 21:33:20] [INFO ] Computing symmetric may disable matrix : 1326 transitions.
[2024-05-23 21:33:20] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:33:20] [INFO ] Computing symmetric may enable matrix : 1326 transitions.
[2024-05-23 21:33:20] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:33:21] [INFO ] Computing Do-Not-Accords matrix : 1326 transitions.
[2024-05-23 21:33:21] [INFO ] Computation of Completed DNA matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:33:21] [INFO ] Built C files in 407ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14696520143279392287
Running compilation step : cd /tmp/ltsmin14696520143279392287;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14696520143279392287;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14696520143279392287;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 21:33:24] [INFO ] Flatten gal took : 33 ms
[2024-05-23 21:33:24] [INFO ] Flatten gal took : 31 ms
[2024-05-23 21:33:24] [INFO ] Time to serialize gal into /tmp/LTL5483117296584185989.gal : 6 ms
[2024-05-23 21:33:24] [INFO ] Time to serialize properties into /tmp/LTL4795012909183837900.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5483117296584185989.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16231912147066674501.hoa' '-atoms' '/tmp/LTL4795012909183837900.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(p2071==0)"))||(("(p1113==0)")&&(G("(p1113==1)")))))))
Formula 0 simplified : XG(F!"(p2071==0)" & (!"(p1113==0)" | F!"(p1113==1)"))
Detected timeout of ITS tools.
[2024-05-23 21:33:54] [INFO ] Flatten gal took : 27 ms
[2024-05-23 21:33:54] [INFO ] Applying decomposition
[2024-05-23 21:33:54] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7250346576674295521.txt' '-o' '/tmp/graph7250346576674295521.bin' '-w' '/tmp/graph7250346576674295521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7250346576674295521.bin' '-l' '-1' '-v' '-w' '/tmp/graph7250346576674295521.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:33:54] [INFO ] Decomposing Gal with order
[2024-05-23 21:33:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:33:54] [INFO ] Removed a total of 521 redundant transitions.
[2024-05-23 21:33:54] [INFO ] Flatten gal took : 122 ms
[2024-05-23 21:33:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 12 ms.
[2024-05-23 21:33:54] [INFO ] Time to serialize gal into /tmp/LTL14209326462346786535.gal : 9 ms
[2024-05-23 21:33:54] [INFO ] Time to serialize properties into /tmp/LTL11334375105000438843.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14209326462346786535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11334375105000438843.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(u35.p2071==0)"))||(("(u20.p1113==0)")&&(G("(u20.p1113==1)")))))))
Formula 0 simplified : XG(F!"(u35.p2071==0)" & (!"(u20.p1113==0)" | F!"(u20.p1113==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4789547177529161243
[2024-05-23 21:34:09] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4789547177529161243
Running compilation step : cd /tmp/ltsmin4789547177529161243;'/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 2153 ms.
Running link step : cd /tmp/ltsmin4789547177529161243;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin4789547177529161243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp0==true))||((LTLAPp1==true)&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-11 finished in 92565 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)&&X(G(!p1))) U (p2||X(F(!p0)))))'
Support contains 5 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1315 transition count 1795
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1315 transition count 1795
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 1315 transition count 1792
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 68 place count 1298 transition count 1775
Iterating global reduction 1 with 17 rules applied. Total rules applied 85 place count 1298 transition count 1775
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 95 place count 1298 transition count 1765
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 101 place count 1292 transition count 1759
Iterating global reduction 2 with 6 rules applied. Total rules applied 107 place count 1292 transition count 1759
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 112 place count 1292 transition count 1754
Applied a total of 112 rules in 168 ms. Remains 1292 /1339 variables (removed 47) and now considering 1754/1819 (removed 65) transitions.
// Phase 1: matrix 1754 rows 1292 cols
[2024-05-23 21:34:25] [INFO ] Computed 22 invariants in 31 ms
[2024-05-23 21:34:25] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-23 21:34:25] [INFO ] Invariant cache hit.
[2024-05-23 21:34:26] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
[2024-05-23 21:34:26] [INFO ] Invariant cache hit.
[2024-05-23 21:34:27] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1292/1339 places, 1754/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2495 ms. Remains : 1292/1339 places, 1754/1819 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND p0 p1), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 p1)), p0]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(NEQ s242 1), p1:(AND (EQ s215 1) (EQ s514 1) (EQ s1005 1)), p2:(EQ s1250 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-12 finished in 2685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(!p0))||(F(!p0)&&F(G(!p1)))))))'
Support contains 5 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1314 transition count 1794
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1314 transition count 1794
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 1314 transition count 1791
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 71 place count 1296 transition count 1773
Iterating global reduction 1 with 18 rules applied. Total rules applied 89 place count 1296 transition count 1773
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 100 place count 1296 transition count 1762
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 106 place count 1290 transition count 1756
Iterating global reduction 2 with 6 rules applied. Total rules applied 112 place count 1290 transition count 1756
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 117 place count 1290 transition count 1751
Applied a total of 117 rules in 167 ms. Remains 1290 /1339 variables (removed 49) and now considering 1751/1819 (removed 68) transitions.
// Phase 1: matrix 1751 rows 1290 cols
[2024-05-23 21:34:27] [INFO ] Computed 22 invariants in 35 ms
[2024-05-23 21:34:28] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-23 21:34:28] [INFO ] Invariant cache hit.
[2024-05-23 21:34:29] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 1786 ms to find 0 implicit places.
[2024-05-23 21:34:29] [INFO ] Invariant cache hit.
[2024-05-23 21:34:30] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1290/1339 places, 1751/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2630 ms. Remains : 1290/1339 places, 1751/1819 transitions.
Stuttering acceptance computed with spot in 219 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s783 1) (EQ s851 1) (EQ s1263 1)), p1:(AND (EQ s466 1) (EQ s1284 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 735 reset in 258 ms.
Product exploration explored 100000 steps with 730 reset in 262 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 74 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-23 21:34:31] [INFO ] Invariant cache hit.
[2024-05-23 21:34:31] [INFO ] [Real]Absence check using 22 positive place invariants in 14 ms returned sat
[2024-05-23 21:34:31] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-20b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-13 finished in 3864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||F(p1))))))'
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1314 transition count 1794
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1314 transition count 1794
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 1314 transition count 1790
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 72 place count 1296 transition count 1772
Iterating global reduction 1 with 18 rules applied. Total rules applied 90 place count 1296 transition count 1772
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 101 place count 1296 transition count 1761
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 107 place count 1290 transition count 1755
Iterating global reduction 2 with 6 rules applied. Total rules applied 113 place count 1290 transition count 1755
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 118 place count 1290 transition count 1750
Applied a total of 118 rules in 179 ms. Remains 1290 /1339 variables (removed 49) and now considering 1750/1819 (removed 69) transitions.
// Phase 1: matrix 1750 rows 1290 cols
[2024-05-23 21:34:31] [INFO ] Computed 22 invariants in 33 ms
[2024-05-23 21:34:32] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-23 21:34:32] [INFO ] Invariant cache hit.
[2024-05-23 21:34:33] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1716 ms to find 0 implicit places.
[2024-05-23 21:34:33] [INFO ] Invariant cache hit.
[2024-05-23 21:34:34] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1290/1339 places, 1750/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2589 ms. Remains : 1290/1339 places, 1750/1819 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s723 0), p0:(EQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 737 reset in 256 ms.
Product exploration explored 100000 steps with 734 reset in 286 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 300733 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 300733 steps, saw 115352 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-23 21:34:38] [INFO ] Invariant cache hit.
[2024-05-23 21:34:38] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 21:34:38] [INFO ] [Nat]Absence check using 22 positive place invariants in 16 ms returned sat
[2024-05-23 21:34:39] [INFO ] After 547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 21:34:39] [INFO ] Deduced a trap composed of 163 places in 98 ms of which 0 ms to minimize.
[2024-05-23 21:34:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2024-05-23 21:34:39] [INFO ] After 867ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 95 ms.
[2024-05-23 21:34:39] [INFO ] After 1168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Graph (trivial) has 1225 edges and 1290 vertex of which 121 / 1290 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1189 transition count 1530
Reduce places removed 98 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 1091 transition count 1529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 199 place count 1090 transition count 1529
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 199 place count 1090 transition count 1488
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 281 place count 1049 transition count 1488
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 319 place count 1011 transition count 1450
Iterating global reduction 3 with 38 rules applied. Total rules applied 357 place count 1011 transition count 1450
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 603 place count 888 transition count 1327
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 642 place count 888 transition count 1288
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 662 place count 868 transition count 1268
Iterating global reduction 4 with 20 rules applied. Total rules applied 682 place count 868 transition count 1268
Free-agglomeration rule applied 763 times.
Iterating global reduction 4 with 763 rules applied. Total rules applied 1445 place count 868 transition count 505
Reduce places removed 763 places and 0 transitions.
Drop transitions removed 361 transitions
Reduce isomorphic transitions removed 361 transitions.
Graph (complete) has 285 edges and 105 vertex of which 15 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.0 ms
Discarding 90 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 1125 rules applied. Total rules applied 2570 place count 15 transition count 144
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 5 with 126 rules applied. Total rules applied 2696 place count 15 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2697 place count 14 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 13 edges and 12 vertex of which 10 / 12 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 2700 place count 4 transition count 17
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 2713 place count 4 transition count 4
Applied a total of 2713 rules in 216 ms. Remains 4 /1290 variables (removed 1286) and now considering 4/1750 (removed 1746) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 4/1290 places, 4/1750 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Applied a total of 0 rules in 38 ms. Remains 1290 /1290 variables (removed 0) and now considering 1750/1750 (removed 0) transitions.
[2024-05-23 21:34:40] [INFO ] Invariant cache hit.
[2024-05-23 21:34:40] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-23 21:34:40] [INFO ] Invariant cache hit.
[2024-05-23 21:34:41] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
[2024-05-23 21:34:41] [INFO ] Invariant cache hit.
[2024-05-23 21:34:42] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2316 ms. Remains : 1290/1290 places, 1750/1750 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 300539 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 300539 steps, saw 115304 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-23 21:34:46] [INFO ] Invariant cache hit.
[2024-05-23 21:34:46] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 21:34:46] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2024-05-23 21:34:46] [INFO ] After 531ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 21:34:47] [INFO ] Deduced a trap composed of 163 places in 107 ms of which 0 ms to minimize.
[2024-05-23 21:34:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2024-05-23 21:34:47] [INFO ] After 859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 96 ms.
[2024-05-23 21:34:47] [INFO ] After 1137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Graph (trivial) has 1225 edges and 1290 vertex of which 121 / 1290 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1189 transition count 1530
Reduce places removed 98 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 1091 transition count 1529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 199 place count 1090 transition count 1529
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 199 place count 1090 transition count 1488
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 281 place count 1049 transition count 1488
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 319 place count 1011 transition count 1450
Iterating global reduction 3 with 38 rules applied. Total rules applied 357 place count 1011 transition count 1450
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 2 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 603 place count 888 transition count 1327
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 642 place count 888 transition count 1288
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 662 place count 868 transition count 1268
Iterating global reduction 4 with 20 rules applied. Total rules applied 682 place count 868 transition count 1268
Free-agglomeration rule applied 763 times.
Iterating global reduction 4 with 763 rules applied. Total rules applied 1445 place count 868 transition count 505
Reduce places removed 763 places and 0 transitions.
Drop transitions removed 361 transitions
Reduce isomorphic transitions removed 361 transitions.
Graph (complete) has 285 edges and 105 vertex of which 15 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.0 ms
Discarding 90 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 1125 rules applied. Total rules applied 2570 place count 15 transition count 144
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 5 with 126 rules applied. Total rules applied 2696 place count 15 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2697 place count 14 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 13 edges and 12 vertex of which 10 / 12 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 2700 place count 4 transition count 17
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 2713 place count 4 transition count 4
Applied a total of 2713 rules in 245 ms. Remains 4 /1290 variables (removed 1286) and now considering 4/1750 (removed 1746) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 4/1290 places, 4/1750 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 273 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 731 reset in 257 ms.
Product exploration explored 100000 steps with 732 reset in 263 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Graph (trivial) has 1225 edges and 1290 vertex of which 121 / 1290 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 1189 transition count 1648
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 58 Pre rules applied. Total rules applied 81 place count 1189 transition count 1648
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 1 with 58 rules applied. Total rules applied 139 place count 1189 transition count 1648
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 235 place count 1093 transition count 1552
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 331 place count 1093 transition count 1552
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 1 with 105 rules applied. Total rules applied 436 place count 1093 transition count 1591
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 480 place count 1049 transition count 1547
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 524 place count 1049 transition count 1547
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 161 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 544 place count 1049 transition count 1587
Deduced a syphon composed of 161 places in 0 ms
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 1 with 39 rules applied. Total rules applied 583 place count 1049 transition count 1548
Deduced a syphon composed of 161 places in 0 ms
Applied a total of 583 rules in 568 ms. Remains 1049 /1290 variables (removed 241) and now considering 1548/1750 (removed 202) transitions.
[2024-05-23 21:34:49] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-23 21:34:49] [INFO ] Flow matrix only has 1509 transitions (discarded 39 similar events)
// Phase 1: matrix 1509 rows 1049 cols
[2024-05-23 21:34:49] [INFO ] Computed 22 invariants in 27 ms
[2024-05-23 21:34:50] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1049/1290 places, 1548/1750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1183 ms. Remains : 1049/1290 places, 1548/1750 transitions.
Built C files in :
/tmp/ltsmin5817670381131471774
[2024-05-23 21:34:50] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5817670381131471774
Running compilation step : cd /tmp/ltsmin5817670381131471774;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5817670381131471774;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5817670381131471774;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Applied a total of 0 rules in 31 ms. Remains 1290 /1290 variables (removed 0) and now considering 1750/1750 (removed 0) transitions.
// Phase 1: matrix 1750 rows 1290 cols
[2024-05-23 21:34:53] [INFO ] Computed 22 invariants in 31 ms
[2024-05-23 21:34:53] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-05-23 21:34:53] [INFO ] Invariant cache hit.
[2024-05-23 21:34:55] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
[2024-05-23 21:34:55] [INFO ] Invariant cache hit.
[2024-05-23 21:34:55] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2488 ms. Remains : 1290/1290 places, 1750/1750 transitions.
Built C files in :
/tmp/ltsmin10903437776163283343
[2024-05-23 21:34:55] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10903437776163283343
Running compilation step : cd /tmp/ltsmin10903437776163283343;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10903437776163283343;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10903437776163283343;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 21:34:58] [INFO ] Flatten gal took : 33 ms
[2024-05-23 21:34:58] [INFO ] Flatten gal took : 36 ms
[2024-05-23 21:34:58] [INFO ] Time to serialize gal into /tmp/LTL7552597431716737413.gal : 13 ms
[2024-05-23 21:34:58] [INFO ] Time to serialize properties into /tmp/LTL16465712401807010963.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7552597431716737413.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11005722235997210000.hoa' '-atoms' '/tmp/LTL16465712401807010963.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(p190==1)"))||(F("(p2874==0)")))))))
Formula 0 simplified : XXF(X!"(p190==1)" & G!"(p2874==0)")
Detected timeout of ITS tools.
[2024-05-23 21:35:29] [INFO ] Flatten gal took : 32 ms
[2024-05-23 21:35:29] [INFO ] Applying decomposition
[2024-05-23 21:35:29] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9626120400728915845.txt' '-o' '/tmp/graph9626120400728915845.bin' '-w' '/tmp/graph9626120400728915845.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9626120400728915845.bin' '-l' '-1' '-v' '-w' '/tmp/graph9626120400728915845.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:35:29] [INFO ] Decomposing Gal with order
[2024-05-23 21:35:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:35:29] [INFO ] Removed a total of 517 redundant transitions.
[2024-05-23 21:35:29] [INFO ] Flatten gal took : 137 ms
[2024-05-23 21:35:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 13 ms.
[2024-05-23 21:35:29] [INFO ] Time to serialize gal into /tmp/LTL12682529541502268309.gal : 14 ms
[2024-05-23 21:35:29] [INFO ] Time to serialize properties into /tmp/LTL1934297348086670871.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12682529541502268309.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1934297348086670871.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(i1.u14.p190==1)"))||(F("(i21.i1.i0.u165.p2874==0)")))))))
Formula 0 simplified : XXF(X!"(i1.u14.p190==1)" & G!"(i21.i1.i0.u165.p2874==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9544375077932494366
[2024-05-23 21:35:44] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9544375077932494366
Running compilation step : cd /tmp/ltsmin9544375077932494366;'/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 3002 ms.
Running link step : cd /tmp/ltsmin9544375077932494366;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9544375077932494366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp0==true))||<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-14 finished in 88185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||(p1 U (p2||G(p3)))) U !p0))'
Support contains 6 out of 1339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Graph (trivial) has 1271 edges and 1339 vertex of which 121 / 1339 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 1237 transition count 1613
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 207 place count 1134 transition count 1613
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 207 place count 1134 transition count 1567
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 299 place count 1088 transition count 1567
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 357 place count 1030 transition count 1509
Iterating global reduction 2 with 58 rules applied. Total rules applied 415 place count 1030 transition count 1509
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 418 place count 1030 transition count 1506
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 418 place count 1030 transition count 1505
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 420 place count 1029 transition count 1505
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 432 place count 1017 transition count 1493
Iterating global reduction 3 with 12 rules applied. Total rules applied 444 place count 1017 transition count 1493
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 455 place count 1017 transition count 1482
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 699 place count 895 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 701 place count 893 transition count 1358
Iterating global reduction 4 with 2 rules applied. Total rules applied 703 place count 893 transition count 1358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 705 place count 893 transition count 1356
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 725 place count 893 transition count 1336
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 727 place count 891 transition count 1334
Applied a total of 727 rules in 434 ms. Remains 891 /1339 variables (removed 448) and now considering 1334/1819 (removed 485) transitions.
[2024-05-23 21:36:00] [INFO ] Flow matrix only has 1295 transitions (discarded 39 similar events)
// Phase 1: matrix 1295 rows 891 cols
[2024-05-23 21:36:00] [INFO ] Computed 22 invariants in 32 ms
[2024-05-23 21:36:00] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-23 21:36:00] [INFO ] Flow matrix only has 1295 transitions (discarded 39 similar events)
[2024-05-23 21:36:00] [INFO ] Invariant cache hit.
[2024-05-23 21:36:01] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 1492 ms to find 0 implicit places.
[2024-05-23 21:36:01] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-23 21:36:01] [INFO ] Flow matrix only has 1295 transitions (discarded 39 similar events)
[2024-05-23 21:36:01] [INFO ] Invariant cache hit.
[2024-05-23 21:36:02] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 891/1339 places, 1334/1819 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2487 ms. Remains : 891/1339 places, 1334/1819 transitions.
Stuttering acceptance computed with spot in 241 ms :[p0, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), true, (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) p3 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p3 p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s448 1), p2:(NEQ s84 1), p3:(NEQ s277 1), p1:(AND (EQ s200 1) (EQ s446 1) (EQ s669 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-15 finished in 2757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((!(p0 U p1)||X(X(p2))||G(X(p0)))))))'
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&&G(p2))))))'
Found a Shortening insensitive property : FlexibleBarrier-PT-20b-LTLFireability-11
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Graph (trivial) has 1275 edges and 1339 vertex of which 121 / 1339 are part of one of the 20 SCC in 4 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 1237 transition count 1613
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 207 place count 1134 transition count 1613
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 207 place count 1134 transition count 1568
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 297 place count 1089 transition count 1568
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 357 place count 1029 transition count 1508
Iterating global reduction 2 with 60 rules applied. Total rules applied 417 place count 1029 transition count 1508
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 421 place count 1029 transition count 1504
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 421 place count 1029 transition count 1503
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 423 place count 1028 transition count 1503
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 435 place count 1016 transition count 1491
Iterating global reduction 3 with 12 rules applied. Total rules applied 447 place count 1016 transition count 1491
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 457 place count 1016 transition count 1481
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 701 place count 894 transition count 1359
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 705 place count 890 transition count 1355
Iterating global reduction 4 with 4 rules applied. Total rules applied 709 place count 890 transition count 1355
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 713 place count 890 transition count 1351
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 733 place count 890 transition count 1331
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 735 place count 888 transition count 1329
Applied a total of 735 rules in 220 ms. Remains 888 /1339 variables (removed 451) and now considering 1329/1819 (removed 490) transitions.
[2024-05-23 21:36:03] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
// Phase 1: matrix 1290 rows 888 cols
[2024-05-23 21:36:03] [INFO ] Computed 22 invariants in 32 ms
[2024-05-23 21:36:03] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-23 21:36:03] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 21:36:03] [INFO ] Invariant cache hit.
[2024-05-23 21:36:04] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
[2024-05-23 21:36:04] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 21:36:04] [INFO ] Invariant cache hit.
[2024-05-23 21:36:04] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 888/1339 places, 1329/1819 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2018 ms. Remains : 888/1339 places, 1329/1819 transitions.
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s288 0), p1:(EQ s157 0), p2:(EQ s157 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3795 reset in 1161 ms.
Product exploration explored 100000 steps with 3787 reset in 1185 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 (NOT p2)), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 157 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false]
Incomplete random walk after 10000 steps, including 383 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 269968 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 269968 steps, saw 76188 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-23 21:36:11] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 21:36:11] [INFO ] Invariant cache hit.
[2024-05-23 21:36:11] [INFO ] [Real]Absence check using 22 positive place invariants in 22 ms returned sat
[2024-05-23 21:36:12] [INFO ] After 587ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:6
[2024-05-23 21:36:12] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2024-05-23 21:36:12] [INFO ] After 556ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2024-05-23 21:36:13] [INFO ] After 908ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 216 ms.
[2024-05-23 21:36:13] [INFO ] After 1374ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 888/888 places, 1329/1329 transitions.
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 888 transition count 1289
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 60 place count 868 transition count 1269
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 868 transition count 1269
Free-agglomeration rule applied 764 times.
Iterating global reduction 1 with 764 rules applied. Total rules applied 844 place count 868 transition count 505
Discarding 80 places :
Also discarding 337 output transitions
Drop transitions removed 337 transitions
Remove reverse transitions (loop back) rule discarded transition t379.t1388.t1245 and 80 places that fell out of Prefix Of Interest.
Drop transitions removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Graph (trivial) has 28 edges and 22 vertex of which 20 / 22 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 1 with 138 rules applied. Total rules applied 982 place count 6 transition count 32
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1012 place count 4 transition count 4
Applied a total of 1012 rules in 117 ms. Remains 4 /888 variables (removed 884) and now considering 4/1329 (removed 1325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 4/888 places, 4/1329 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 6 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p2)))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 15 factoid took 462 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 1 out of 888 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 888/888 places, 1329/1329 transitions.
Applied a total of 0 rules in 78 ms. Remains 888 /888 variables (removed 0) and now considering 1329/1329 (removed 0) transitions.
[2024-05-23 21:36:14] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 21:36:14] [INFO ] Invariant cache hit.
[2024-05-23 21:36:14] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-23 21:36:14] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 21:36:14] [INFO ] Invariant cache hit.
[2024-05-23 21:36:15] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
[2024-05-23 21:36:15] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-23 21:36:15] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 21:36:15] [INFO ] Invariant cache hit.
[2024-05-23 21:36:16] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1946 ms. Remains : 888/888 places, 1329/1329 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 389 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 455794 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 455794 steps, saw 119429 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 21:36:19] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 21:36:19] [INFO ] Invariant cache hit.
[2024-05-23 21:36:19] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 21:36:19] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2024-05-23 21:36:20] [INFO ] After 379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 21:36:20] [INFO ] After 453ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-23 21:36:20] [INFO ] After 603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 888/888 places, 1329/1329 transitions.
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 888 transition count 1289
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 60 place count 868 transition count 1269
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 868 transition count 1269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 867 transition count 1268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 866 transition count 1267
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 866 transition count 1267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 866 transition count 1266
Free-agglomeration rule applied 763 times.
Iterating global reduction 2 with 763 rules applied. Total rules applied 848 place count 866 transition count 503
Discarding 90 places :
Also discarding 415 output transitions
Drop transitions removed 415 transitions
Remove reverse transitions (loop back) rule discarded transition t379.t1388.t1245 and 90 places that fell out of Prefix Of Interest.
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (trivial) has 14 edges and 11 vertex of which 10 / 11 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 2 with 74 rules applied. Total rules applied 922 place count 3 transition count 16
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 937 place count 2 transition count 2
Applied a total of 937 rules in 160 ms. Remains 2 /888 variables (removed 886) and now considering 2/1329 (removed 1327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 2/888 places, 2/1329 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3790 reset in 1113 ms.
Product exploration explored 100000 steps with 3769 reset in 1111 ms.
Built C files in :
/tmp/ltsmin14735174415480877901
[2024-05-23 21:36:22] [INFO ] Computing symmetric may disable matrix : 1329 transitions.
[2024-05-23 21:36:22] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:36:22] [INFO ] Computing symmetric may enable matrix : 1329 transitions.
[2024-05-23 21:36:22] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:36:23] [INFO ] Computing Do-Not-Accords matrix : 1329 transitions.
[2024-05-23 21:36:23] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:36:23] [INFO ] Built C files in 373ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14735174415480877901
Running compilation step : cd /tmp/ltsmin14735174415480877901;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14735174415480877901;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14735174415480877901;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 888 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 888/888 places, 1329/1329 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 887 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 886 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 886 transition count 1327
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 886 transition count 1326
Applied a total of 5 rules in 118 ms. Remains 886 /888 variables (removed 2) and now considering 1326/1329 (removed 3) transitions.
[2024-05-23 21:36:26] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2024-05-23 21:36:26] [INFO ] Computed 22 invariants in 34 ms
[2024-05-23 21:36:26] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-23 21:36:26] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 21:36:26] [INFO ] Invariant cache hit.
[2024-05-23 21:36:27] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
[2024-05-23 21:36:27] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-23 21:36:27] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 21:36:27] [INFO ] Invariant cache hit.
[2024-05-23 21:36:28] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 886/888 places, 1326/1329 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1977 ms. Remains : 886/888 places, 1326/1329 transitions.
Built C files in :
/tmp/ltsmin7105980496798051876
[2024-05-23 21:36:28] [INFO ] Computing symmetric may disable matrix : 1326 transitions.
[2024-05-23 21:36:28] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:36:28] [INFO ] Computing symmetric may enable matrix : 1326 transitions.
[2024-05-23 21:36:28] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:36:28] [INFO ] Computing Do-Not-Accords matrix : 1326 transitions.
[2024-05-23 21:36:28] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:36:28] [INFO ] Built C files in 372ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7105980496798051876
Running compilation step : cd /tmp/ltsmin7105980496798051876;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7105980496798051876;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7105980496798051876;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 21:36:31] [INFO ] Flatten gal took : 27 ms
[2024-05-23 21:36:31] [INFO ] Flatten gal took : 24 ms
[2024-05-23 21:36:31] [INFO ] Time to serialize gal into /tmp/LTL9673332645028697205.gal : 5 ms
[2024-05-23 21:36:31] [INFO ] Time to serialize properties into /tmp/LTL10171555767773564126.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9673332645028697205.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2135730829850750419.hoa' '-atoms' '/tmp/LTL10171555767773564126.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(p2071==0)"))||(("(p1113==0)")&&(G("(p1113==1)")))))))
Formula 0 simplified : XG(F!"(p2071==0)" & (!"(p1113==0)" | F!"(p1113==1)"))
Detected timeout of ITS tools.
[2024-05-23 21:37:02] [INFO ] Flatten gal took : 28 ms
[2024-05-23 21:37:02] [INFO ] Applying decomposition
[2024-05-23 21:37:02] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph956410496661804204.txt' '-o' '/tmp/graph956410496661804204.bin' '-w' '/tmp/graph956410496661804204.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph956410496661804204.bin' '-l' '-1' '-v' '-w' '/tmp/graph956410496661804204.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:37:02] [INFO ] Decomposing Gal with order
[2024-05-23 21:37:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:37:02] [INFO ] Removed a total of 521 redundant transitions.
[2024-05-23 21:37:02] [INFO ] Flatten gal took : 114 ms
[2024-05-23 21:37:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 9 ms.
[2024-05-23 21:37:02] [INFO ] Time to serialize gal into /tmp/LTL287920118135190025.gal : 8 ms
[2024-05-23 21:37:02] [INFO ] Time to serialize properties into /tmp/LTL15099725168540312878.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL287920118135190025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15099725168540312878.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(u35.p2071==0)"))||(("(u20.p1113==0)")&&(G("(u20.p1113==1)")))))))
Formula 0 simplified : XG(F!"(u35.p2071==0)" & (!"(u20.p1113==0)" | F!"(u20.p1113==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15827117567925669505
[2024-05-23 21:37:17] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15827117567925669505
Running compilation step : cd /tmp/ltsmin15827117567925669505;'/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 2167 ms.
Running link step : cd /tmp/ltsmin15827117567925669505;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15827117567925669505;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp0==true))||((LTLAPp1==true)&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-11 finished in 89885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||F(p1))))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-20b-LTLFireability-14
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Graph (trivial) has 1274 edges and 1339 vertex of which 121 / 1339 are part of one of the 20 SCC in 2 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 1237 transition count 1615
Reduce places removed 101 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 102 rules applied. Total rules applied 204 place count 1136 transition count 1614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 205 place count 1135 transition count 1614
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 205 place count 1135 transition count 1567
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 299 place count 1088 transition count 1567
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 360 place count 1027 transition count 1506
Iterating global reduction 3 with 61 rules applied. Total rules applied 421 place count 1027 transition count 1506
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 425 place count 1027 transition count 1502
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 425 place count 1027 transition count 1501
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 427 place count 1026 transition count 1501
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 439 place count 1014 transition count 1489
Iterating global reduction 4 with 12 rules applied. Total rules applied 451 place count 1014 transition count 1489
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 463 place count 1014 transition count 1477
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 5 with 242 rules applied. Total rules applied 705 place count 893 transition count 1356
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 709 place count 889 transition count 1352
Iterating global reduction 5 with 4 rules applied. Total rules applied 713 place count 889 transition count 1352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 717 place count 889 transition count 1348
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 736 place count 889 transition count 1329
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 737 place count 889 transition count 1329
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 739 place count 887 transition count 1327
Applied a total of 739 rules in 259 ms. Remains 887 /1339 variables (removed 452) and now considering 1327/1819 (removed 492) transitions.
[2024-05-23 21:37:33] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
// Phase 1: matrix 1288 rows 887 cols
[2024-05-23 21:37:33] [INFO ] Computed 22 invariants in 32 ms
[2024-05-23 21:37:33] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-23 21:37:33] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 21:37:33] [INFO ] Invariant cache hit.
[2024-05-23 21:37:34] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
[2024-05-23 21:37:34] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 21:37:34] [INFO ] Invariant cache hit.
[2024-05-23 21:37:34] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 887/1339 places, 1327/1819 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2127 ms. Remains : 887/1339 places, 1327/1819 transitions.
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s410 0), p0:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3773 reset in 1176 ms.
Product exploration explored 100000 steps with 3781 reset in 1187 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)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 386 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 339004 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 339004 steps, saw 89316 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-23 21:37:41] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 21:37:41] [INFO ] Invariant cache hit.
[2024-05-23 21:37:41] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 21:37:41] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2024-05-23 21:37:41] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 21:37:41] [INFO ] After 556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-23 21:37:42] [INFO ] After 783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 887 transition count 1287
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 60 place count 867 transition count 1267
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 867 transition count 1267
Free-agglomeration rule applied 762 times.
Iterating global reduction 1 with 762 rules applied. Total rules applied 842 place count 867 transition count 505
Discarding 90 places :
Also discarding 415 output transitions
Drop transitions removed 415 transitions
Remove reverse transitions (loop back) rule discarded transition t379.t1387.t1202 and 90 places that fell out of Prefix Of Interest.
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (trivial) has 14 edges and 13 vertex of which 10 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 74 rules applied. Total rules applied 916 place count 5 transition count 18
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 929 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 929 place count 5 transition count 4
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 931 place count 4 transition count 4
Applied a total of 931 rules in 130 ms. Remains 4 /887 variables (removed 883) and now considering 4/1327 (removed 1323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 4/887 places, 4/1327 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Applied a total of 0 rules in 20 ms. Remains 887 /887 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-23 21:37:42] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 21:37:42] [INFO ] Invariant cache hit.
[2024-05-23 21:37:43] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-23 21:37:43] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 21:37:43] [INFO ] Invariant cache hit.
[2024-05-23 21:37:44] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
[2024-05-23 21:37:44] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 21:37:44] [INFO ] Invariant cache hit.
[2024-05-23 21:37:44] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1870 ms. Remains : 887/887 places, 1327/1327 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 p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 386 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 378428 steps, run timeout after 3009 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 378428 steps, saw 94799 distinct states, run finished after 3009 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-23 21:37:48] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 21:37:48] [INFO ] Invariant cache hit.
[2024-05-23 21:37:48] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 21:37:48] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2024-05-23 21:37:48] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 21:37:49] [INFO ] After 544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-23 21:37:49] [INFO ] After 753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 887 transition count 1287
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 60 place count 867 transition count 1267
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 867 transition count 1267
Free-agglomeration rule applied 762 times.
Iterating global reduction 1 with 762 rules applied. Total rules applied 842 place count 867 transition count 505
Discarding 90 places :
Also discarding 415 output transitions
Drop transitions removed 415 transitions
Remove reverse transitions (loop back) rule discarded transition t379.t1387.t1202 and 90 places that fell out of Prefix Of Interest.
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (trivial) has 14 edges and 13 vertex of which 10 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 74 rules applied. Total rules applied 916 place count 5 transition count 18
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 929 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 929 place count 5 transition count 4
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 931 place count 4 transition count 4
Applied a total of 931 rules in 120 ms. Remains 4 /887 variables (removed 883) and now considering 4/1327 (removed 1323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 4/887 places, 4/1327 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 3777 reset in 1095 ms.
Product exploration explored 100000 steps with 3775 reset in 1115 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Applied a total of 0 rules in 90 ms. Remains 887 /887 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-23 21:37:52] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-23 21:37:52] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 21:37:52] [INFO ] Invariant cache hit.
[2024-05-23 21:37:53] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 592 ms. Remains : 887/887 places, 1327/1327 transitions.
Built C files in :
/tmp/ltsmin10313384817203769699
[2024-05-23 21:37:53] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10313384817203769699
Running compilation step : cd /tmp/ltsmin10313384817203769699;'/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 2289 ms.
Running link step : cd /tmp/ltsmin10313384817203769699;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10313384817203769699;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1283461953830632962.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Applied a total of 0 rules in 19 ms. Remains 887 /887 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-23 21:38:08] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 21:38:08] [INFO ] Invariant cache hit.
[2024-05-23 21:38:08] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-23 21:38:08] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 21:38:08] [INFO ] Invariant cache hit.
[2024-05-23 21:38:09] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1326 ms to find 0 implicit places.
[2024-05-23 21:38:09] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 21:38:09] [INFO ] Invariant cache hit.
[2024-05-23 21:38:09] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1790 ms. Remains : 887/887 places, 1327/1327 transitions.
Built C files in :
/tmp/ltsmin9074095340624332709
[2024-05-23 21:38:09] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9074095340624332709
Running compilation step : cd /tmp/ltsmin9074095340624332709;'/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 2196 ms.
Running link step : cd /tmp/ltsmin9074095340624332709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9074095340624332709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6678427947648285903.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 21:38:25] [INFO ] Flatten gal took : 28 ms
[2024-05-23 21:38:25] [INFO ] Flatten gal took : 28 ms
[2024-05-23 21:38:25] [INFO ] Time to serialize gal into /tmp/LTL18277399307483624386.gal : 8 ms
[2024-05-23 21:38:25] [INFO ] Time to serialize properties into /tmp/LTL8872298977935528388.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18277399307483624386.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14801454905175995726.hoa' '-atoms' '/tmp/LTL8872298977935528388.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(p190==1)"))||(F("(p2874==0)")))))))
Formula 0 simplified : XXF(X!"(p190==1)" & G!"(p2874==0)")
Detected timeout of ITS tools.
[2024-05-23 21:38:55] [INFO ] Flatten gal took : 30 ms
[2024-05-23 21:38:55] [INFO ] Applying decomposition
[2024-05-23 21:38:55] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2051411786759749700.txt' '-o' '/tmp/graph2051411786759749700.bin' '-w' '/tmp/graph2051411786759749700.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2051411786759749700.bin' '-l' '-1' '-v' '-w' '/tmp/graph2051411786759749700.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:38:55] [INFO ] Decomposing Gal with order
[2024-05-23 21:38:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:38:55] [INFO ] Removed a total of 520 redundant transitions.
[2024-05-23 21:38:55] [INFO ] Flatten gal took : 109 ms
[2024-05-23 21:38:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 12 ms.
[2024-05-23 21:38:55] [INFO ] Time to serialize gal into /tmp/LTL10098734431604554272.gal : 8 ms
[2024-05-23 21:38:55] [INFO ] Time to serialize properties into /tmp/LTL8347772799785404315.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10098734431604554272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8347772799785404315.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(u2.p190==1)"))||(F("(i15.u46.p2874==0)")))))))
Formula 0 simplified : XXF(X!"(u2.p190==1)" & G!"(i15.u46.p2874==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7804750315705960331
[2024-05-23 21:39:10] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7804750315705960331
Running compilation step : cd /tmp/ltsmin7804750315705960331;'/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 2168 ms.
Running link step : cd /tmp/ltsmin7804750315705960331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7804750315705960331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp0==true))||<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-14 finished in 113215 ms.
[2024-05-23 21:39:25] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7059735952717925420
[2024-05-23 21:39:25] [INFO ] Too many transitions (1819) to apply POR reductions. Disabling POR matrices.
[2024-05-23 21:39:25] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7059735952717925420
Running compilation step : cd /tmp/ltsmin7059735952717925420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 21:39:25] [INFO ] Applying decomposition
[2024-05-23 21:39:25] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5757037684879258630.txt' '-o' '/tmp/graph5757037684879258630.bin' '-w' '/tmp/graph5757037684879258630.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5757037684879258630.bin' '-l' '-1' '-v' '-w' '/tmp/graph5757037684879258630.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:39:25] [INFO ] Decomposing Gal with order
[2024-05-23 21:39:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:39:26] [INFO ] Removed a total of 528 redundant transitions.
[2024-05-23 21:39:26] [INFO ] Flatten gal took : 138 ms
[2024-05-23 21:39:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 22 ms.
[2024-05-23 21:39:26] [INFO ] Time to serialize gal into /tmp/LTLFireability8960956113982076381.gal : 11 ms
[2024-05-23 21:39:26] [INFO ] Time to serialize properties into /tmp/LTLFireability2627362461352119997.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8960956113982076381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2627362461352119997.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((G(F(G(((!(("(i10.i0.i0.u115.p1803==1)")U("(i5.u63.p882==1)")))||(X(X("(i5.u63.p882==0)"))))||(G(X("(i10.i0.i0.u115.p1803==1)"))))))...157
Formula 0 simplified : GF(("(i10.i0.i0.u115.p1803==1)" U "(i5.u63.p882==1)") & X(X!"(i5.u63.p882==0)" & F!"(i10.i0.i0.u115.p1803==1)"))
Compilation finished in 3222 ms.
Running link step : cd /tmp/ltsmin7059735952717925420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7059735952717925420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]((!((LTLAPp0==true) U (LTLAPp1==true))||X(X((LTLAPp2==true)))||[](X((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin7059735952717925420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]((!((LTLAPp0==true) U (LTLAPp1==true))||X(X((LTLAPp2==true)))||[](X((LTLAPp0==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7059735952717925420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp3==true))||((LTLAPp4==true)&&[]((LTLAPp5==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 22:02:20] [INFO ] Applying decomposition
[2024-05-23 22:02:20] [INFO ] Flatten gal took : 107 ms
[2024-05-23 22:02:20] [INFO ] Decomposing Gal with order
[2024-05-23 22:02:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 22:02:21] [INFO ] Removed a total of 504 redundant transitions.
[2024-05-23 22:02:21] [INFO ] Flatten gal took : 304 ms
[2024-05-23 22:02:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 1709 labels/synchronizations in 448 ms.
[2024-05-23 22:02:21] [INFO ] Time to serialize gal into /tmp/LTLFireability5405478647918991405.gal : 50 ms
[2024-05-23 22:02:21] [INFO ] Time to serialize properties into /tmp/LTLFireability6669449768167179073.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5405478647918991405.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6669449768167179073.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((G(F(G(((!(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u29.p1803==1)")U("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u24.p882==1)")))||...291
Formula 0 simplified : GF(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u29.p1803==1)" U "(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u24.p882==1)") & X(X!"(i0....269
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin7059735952717925420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp3==true))||((LTLAPp4==true)&&[]((LTLAPp5==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7059735952717925420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp6==true))||<>((LTLAPp7==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 22:25:34] [INFO ] Flatten gal took : 331 ms
[2024-05-23 22:25:37] [INFO ] Input system was already deterministic with 1819 transitions.
[2024-05-23 22:25:37] [INFO ] Transformed 1339 places.
[2024-05-23 22:25:37] [INFO ] Transformed 1819 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 22:25:37] [INFO ] Time to serialize gal into /tmp/LTLFireability8238116349546533019.gal : 39 ms
[2024-05-23 22:25:37] [INFO ] Time to serialize properties into /tmp/LTLFireability16635473027080720919.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8238116349546533019.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16635473027080720919.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(G(((!(("(p1803==1)")U("(p882==1)")))||(X(X("(p882==0)"))))||(G(X("(p1803==1)"))))))))
Formula 0 simplified : GF(("(p1803==1)" U "(p882==1)") & X(X!"(p882==0)" & F!"(p1803==1)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11686216 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15867356 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-20b"
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-20b, 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-171640624800088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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