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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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 25K May 19 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 13 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 13 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 08:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Apr 13 08:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M 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-22b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716500549490

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-22b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 21:42:31] [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:42:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 21:42:32] [INFO ] Load time of PNML (sax parser for PT used): 239 ms
[2024-05-23 21:42:32] [INFO ] Transformed 6478 places.
[2024-05-23 21:42:32] [INFO ] Transformed 7469 transitions.
[2024-05-23 21:42:32] [INFO ] Found NUPN structural information;
[2024-05-23 21:42:32] [INFO ] Parsed PT model containing 6478 places and 7469 transitions and 18797 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 6478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Discarding 2752 places :
Symmetric choice reduction at 0 with 2752 rule applications. Total rules 2752 place count 3726 transition count 4717
Iterating global reduction 0 with 2752 rules applied. Total rules applied 5504 place count 3726 transition count 4717
Discarding 1311 places :
Symmetric choice reduction at 0 with 1311 rule applications. Total rules 6815 place count 2415 transition count 3406
Iterating global reduction 0 with 1311 rules applied. Total rules applied 8126 place count 2415 transition count 3406
Discarding 853 places :
Symmetric choice reduction at 0 with 853 rule applications. Total rules 8979 place count 1562 transition count 2553
Iterating global reduction 0 with 853 rules applied. Total rules applied 9832 place count 1562 transition count 2553
Ensure Unique test removed 419 transitions
Reduce isomorphic transitions removed 419 transitions.
Iterating post reduction 0 with 419 rules applied. Total rules applied 10251 place count 1562 transition count 2134
Applied a total of 10251 rules in 2041 ms. Remains 1562 /6478 variables (removed 4916) and now considering 2134/7469 (removed 5335) transitions.
// Phase 1: matrix 2134 rows 1562 cols
[2024-05-23 21:42:34] [INFO ] Computed 24 invariants in 95 ms
[2024-05-23 21:42:35] [INFO ] Implicit Places using invariants in 881 ms returned []
[2024-05-23 21:42:35] [INFO ] Invariant cache hit.
[2024-05-23 21:42:36] [INFO ] Implicit Places using invariants and state equation in 1510 ms returned []
Implicit Place search using SMT with State Equation took 2418 ms to find 0 implicit places.
[2024-05-23 21:42:36] [INFO ] Invariant cache hit.
[2024-05-23 21:42:37] [INFO ] Dead Transitions using invariants and state equation in 933 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/6478 places, 2134/7469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5399 ms. Remains : 1562/6478 places, 2134/7469 transitions.
Support contains 51 out of 1562 places after structural reductions.
[2024-05-23 21:42:38] [INFO ] Flatten gal took : 154 ms
[2024-05-23 21:42:38] [INFO ] Flatten gal took : 89 ms
[2024-05-23 21:42:38] [INFO ] Input system was already deterministic with 2134 transitions.
Support contains 48 out of 1562 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 36) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
[2024-05-23 21:42:39] [INFO ] Invariant cache hit.
[2024-05-23 21:42:40] [INFO ] [Real]Absence check using 24 positive place invariants in 20 ms returned sat
[2024-05-23 21:42:40] [INFO ] After 1147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2024-05-23 21:42:41] [INFO ] [Nat]Absence check using 24 positive place invariants in 19 ms returned sat
[2024-05-23 21:42:44] [INFO ] After 2479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2024-05-23 21:42:45] [INFO ] Deduced a trap composed of 506 places in 565 ms of which 5 ms to minimize.
[2024-05-23 21:42:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 689 ms
[2024-05-23 21:42:47] [INFO ] Deduced a trap composed of 509 places in 557 ms of which 1 ms to minimize.
[2024-05-23 21:42:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 678 ms
[2024-05-23 21:42:47] [INFO ] Deduced a trap composed of 631 places in 555 ms of which 2 ms to minimize.
[2024-05-23 21:42:48] [INFO ] Deduced a trap composed of 505 places in 437 ms of which 2 ms to minimize.
[2024-05-23 21:42:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1180 ms
[2024-05-23 21:42:49] [INFO ] Deduced a trap composed of 546 places in 494 ms of which 2 ms to minimize.
[2024-05-23 21:42:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 618 ms
[2024-05-23 21:42:50] [INFO ] Deduced a trap composed of 193 places in 108 ms of which 1 ms to minimize.
[2024-05-23 21:42:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2024-05-23 21:42:51] [INFO ] After 8921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 1895 ms.
[2024-05-23 21:42:52] [INFO ] After 12575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Fused 32 Parikh solutions to 31 different solutions.
Parikh walk visited 24 properties in 158 ms.
Support contains 10 out of 1562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Graph (trivial) has 1478 edges and 1562 vertex of which 133 / 1562 are part of one of the 22 SCC in 5 ms
Free SCC test removed 111 places
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 1451 transition count 1893
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 215 place count 1344 transition count 1893
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 215 place count 1344 transition count 1839
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 323 place count 1290 transition count 1839
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 388 place count 1225 transition count 1774
Iterating global reduction 2 with 65 rules applied. Total rules applied 453 place count 1225 transition count 1774
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 460 place count 1225 transition count 1767
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 471 place count 1214 transition count 1756
Iterating global reduction 3 with 11 rules applied. Total rules applied 482 place count 1214 transition count 1756
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 493 place count 1214 transition count 1745
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 1 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 4 with 272 rules applied. Total rules applied 765 place count 1078 transition count 1609
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 4 with 44 rules applied. Total rules applied 809 place count 1078 transition count 1565
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 833 place count 1054 transition count 1541
Iterating global reduction 5 with 24 rules applied. Total rules applied 857 place count 1054 transition count 1541
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 859 place count 1054 transition count 1539
Free-agglomeration rule applied 925 times.
Iterating global reduction 6 with 925 rules applied. Total rules applied 1784 place count 1054 transition count 614
Reduce places removed 925 places and 0 transitions.
Drop transitions removed 416 transitions
Reduce isomorphic transitions removed 416 transitions.
Iterating post reduction 6 with 1341 rules applied. Total rules applied 3125 place count 129 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3126 place count 128 transition count 197
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 110 edges and 127 vertex of which 44 / 127 are part of one of the 22 SCC in 1 ms
Free SCC test removed 22 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 3128 place count 105 transition count 197
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 8 with 44 rules applied. Total rules applied 3172 place count 105 transition count 153
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 22 Pre rules applied. Total rules applied 3172 place count 105 transition count 131
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 9 with 44 rules applied. Total rules applied 3216 place count 83 transition count 131
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 3238 place count 83 transition count 109
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 10 with 44 rules applied. Total rules applied 3282 place count 61 transition count 87
Free-agglomeration rule applied 22 times.
Iterating global reduction 10 with 22 rules applied. Total rules applied 3304 place count 61 transition count 65
Reduce places removed 42 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 10 with 81 rules applied. Total rules applied 3385 place count 19 transition count 26
Free-agglomeration rule applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 3389 place count 19 transition count 22
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 3393 place count 15 transition count 22
Applied a total of 3393 rules in 1012 ms. Remains 15 /1562 variables (removed 1547) and now considering 22/2134 (removed 2112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1012 ms. Remains : 15/1562 places, 22/2134 transitions.
Finished random walk after 62 steps, including 0 resets, run visited all 8 properties in 1 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 25 stabilizing places and 25 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((F(p0)||X(F((!p1 U (p2||G(!p1))))))))'
Support contains 5 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1535 transition count 2107
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1535 transition count 2107
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 61 place count 1535 transition count 2100
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 80 place count 1516 transition count 2081
Iterating global reduction 1 with 19 rules applied. Total rules applied 99 place count 1516 transition count 2081
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 109 place count 1516 transition count 2071
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 115 place count 1510 transition count 2065
Iterating global reduction 2 with 6 rules applied. Total rules applied 121 place count 1510 transition count 2065
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 124 place count 1510 transition count 2062
Applied a total of 124 rules in 313 ms. Remains 1510 /1562 variables (removed 52) and now considering 2062/2134 (removed 72) transitions.
// Phase 1: matrix 2062 rows 1510 cols
[2024-05-23 21:42:55] [INFO ] Computed 24 invariants in 57 ms
[2024-05-23 21:42:55] [INFO ] Implicit Places using invariants in 792 ms returned []
[2024-05-23 21:42:55] [INFO ] Invariant cache hit.
[2024-05-23 21:42:57] [INFO ] Implicit Places using invariants and state equation in 1486 ms returned []
Implicit Place search using SMT with State Equation took 2283 ms to find 0 implicit places.
[2024-05-23 21:42:57] [INFO ] Invariant cache hit.
[2024-05-23 21:42:58] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1562 places, 2062/2134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3448 ms. Remains : 1510/1562 places, 2062/2134 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 222 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s491 1) (NEQ s649 1) (NEQ s1330 1)), p2:(AND (NEQ s396 1) (NOT (OR (AND (EQ s491 1) (EQ s649 1) (EQ s1330 1)) (EQ s1417 1)))), p1:(OR (AND (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 949 ms.
Product exploration explored 100000 steps with 50000 reset in 818 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-22b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-00 finished in 5543 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(p1))&&p0))))'
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1533 transition count 2105
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1533 transition count 2105
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 65 place count 1533 transition count 2098
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 86 place count 1512 transition count 2077
Iterating global reduction 1 with 21 rules applied. Total rules applied 107 place count 1512 transition count 2077
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 118 place count 1512 transition count 2066
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 1506 transition count 2060
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 1506 transition count 2060
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 1506 transition count 2057
Applied a total of 133 rules in 193 ms. Remains 1506 /1562 variables (removed 56) and now considering 2057/2134 (removed 77) transitions.
// Phase 1: matrix 2057 rows 1506 cols
[2024-05-23 21:43:00] [INFO ] Computed 24 invariants in 48 ms
[2024-05-23 21:43:00] [INFO ] Implicit Places using invariants in 630 ms returned []
[2024-05-23 21:43:01] [INFO ] Invariant cache hit.
[2024-05-23 21:43:02] [INFO ] Implicit Places using invariants and state equation in 1503 ms returned []
Implicit Place search using SMT with State Equation took 2143 ms to find 0 implicit places.
[2024-05-23 21:43:02] [INFO ] Invariant cache hit.
[2024-05-23 21:43:03] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1506/1562 places, 2057/2134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3197 ms. Remains : 1506/1562 places, 2057/2134 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s490 1) (EQ s835 1) (EQ s1408 1)), p1:(NEQ s206 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-02 finished in 3534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p0&&G((F(p1)&&F(G(!p0))))))))'
Support contains 2 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1534 transition count 2106
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1534 transition count 2106
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 64 place count 1534 transition count 2098
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 83 place count 1515 transition count 2079
Iterating global reduction 1 with 19 rules applied. Total rules applied 102 place count 1515 transition count 2079
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 112 place count 1515 transition count 2069
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 117 place count 1510 transition count 2064
Iterating global reduction 2 with 5 rules applied. Total rules applied 122 place count 1510 transition count 2064
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 125 place count 1510 transition count 2061
Applied a total of 125 rules in 328 ms. Remains 1510 /1562 variables (removed 52) and now considering 2061/2134 (removed 73) transitions.
// Phase 1: matrix 2061 rows 1510 cols
[2024-05-23 21:43:04] [INFO ] Computed 24 invariants in 45 ms
[2024-05-23 21:43:04] [INFO ] Implicit Places using invariants in 742 ms returned []
[2024-05-23 21:43:04] [INFO ] Invariant cache hit.
[2024-05-23 21:43:06] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 2290 ms to find 0 implicit places.
[2024-05-23 21:43:06] [INFO ] Invariant cache hit.
[2024-05-23 21:43:07] [INFO ] Dead Transitions using invariants and state equation in 861 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1562 places, 2061/2134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3483 ms. Remains : 1510/1562 places, 2061/2134 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-03 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=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s543 1), p1:(NEQ s1450 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]]
Product exploration explored 100000 steps with 676 reset in 360 ms.
Product exploration explored 100000 steps with 674 reset in 439 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 477 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 259885 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259885 steps, saw 107197 distinct states, run finished after 3002 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-23 21:43:12] [INFO ] Invariant cache hit.
[2024-05-23 21:43:12] [INFO ] [Real]Absence check using 24 positive place invariants in 19 ms returned sat
[2024-05-23 21:43:13] [INFO ] After 700ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-23 21:43:13] [INFO ] After 805ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-23 21:43:13] [INFO ] After 1161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2024-05-23 21:43:13] [INFO ] [Nat]Absence check using 24 positive place invariants in 18 ms returned sat
[2024-05-23 21:43:14] [INFO ] After 761ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 21:43:14] [INFO ] After 1067ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 175 ms.
[2024-05-23 21:43:14] [INFO ] After 1556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 5 ms.
Support contains 2 out of 1510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1510/1510 places, 2061/2061 transitions.
Graph (trivial) has 1439 edges and 1510 vertex of which 133 / 1510 are part of one of the 22 SCC in 2 ms
Free SCC test removed 111 places
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 1399 transition count 1820
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 215 place count 1292 transition count 1820
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 215 place count 1292 transition count 1774
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 307 place count 1246 transition count 1774
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 350 place count 1203 transition count 1731
Iterating global reduction 2 with 43 rules applied. Total rules applied 393 place count 1203 transition count 1731
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 1202 transition count 1730
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 1202 transition count 1730
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 274 rules applied. Total rules applied 669 place count 1065 transition count 1593
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 713 place count 1065 transition count 1549
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 735 place count 1043 transition count 1527
Iterating global reduction 3 with 22 rules applied. Total rules applied 757 place count 1043 transition count 1527
Free-agglomeration rule applied 927 times.
Iterating global reduction 3 with 927 rules applied. Total rules applied 1684 place count 1043 transition count 600
Reduce places removed 927 places and 0 transitions.
Drop transitions removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 319 edges and 116 vertex of which 26 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 3 with 1368 rules applied. Total rules applied 3052 place count 26 transition count 160
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 4 with 126 rules applied. Total rules applied 3178 place count 26 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3179 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 20 edges and 24 vertex of which 8 / 24 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 3181 place count 20 transition count 33
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 3189 place count 20 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 3189 place count 20 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 3197 place count 16 transition count 21
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 3201 place count 16 transition count 17
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 3209 place count 12 transition count 13
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3213 place count 12 transition count 9
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 3224 place count 5 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3225 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3226 place count 4 transition count 4
Applied a total of 3226 rules in 418 ms. Remains 4 /1510 variables (removed 1506) and now considering 4/2061 (removed 2057) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418 ms. Remains : 4/1510 places, 4/2061 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Support contains 2 out of 1510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1510/1510 places, 2061/2061 transitions.
Graph (trivial) has 1439 edges and 1510 vertex of which 133 / 1510 are part of one of the 22 SCC in 1 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 1398 transition count 1841
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 215 place count 1291 transition count 1841
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 215 place count 1291 transition count 1795
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 307 place count 1245 transition count 1795
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 350 place count 1202 transition count 1752
Iterating global reduction 2 with 43 rules applied. Total rules applied 393 place count 1202 transition count 1752
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 1201 transition count 1751
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 1201 transition count 1751
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 1 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 665 place count 1066 transition count 1616
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 687 place count 1066 transition count 1594
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 689 place count 1064 transition count 1592
Applied a total of 689 rules in 735 ms. Remains 1064 /1510 variables (removed 446) and now considering 1592/2061 (removed 469) transitions.
[2024-05-23 21:43:16] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
// Phase 1: matrix 1549 rows 1064 cols
[2024-05-23 21:43:16] [INFO ] Computed 24 invariants in 48 ms
[2024-05-23 21:43:17] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-05-23 21:43:17] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:43:17] [INFO ] Invariant cache hit.
[2024-05-23 21:43:18] [INFO ] Implicit Places using invariants and state equation in 1218 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
[2024-05-23 21:43:18] [INFO ] Redundant transitions in 104 ms returned []
[2024-05-23 21:43:18] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:43:18] [INFO ] Invariant cache hit.
[2024-05-23 21:43:19] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1064/1510 places, 1592/2061 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3248 ms. Remains : 1064/1510 places, 1592/2061 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 124 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 359 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 233476 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 233476 steps, saw 96494 distinct states, run finished after 3013 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-23 21:43:23] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:43:23] [INFO ] Invariant cache hit.
[2024-05-23 21:43:23] [INFO ] [Real]Absence check using 24 positive place invariants in 10 ms returned sat
[2024-05-23 21:43:23] [INFO ] After 507ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-23 21:43:23] [INFO ] After 582ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 21:43:23] [INFO ] After 781ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 21:43:24] [INFO ] [Nat]Absence check using 24 positive place invariants in 11 ms returned sat
[2024-05-23 21:43:24] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 21:43:24] [INFO ] After 738ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 128 ms.
[2024-05-23 21:43:24] [INFO ] After 1071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 1592/1592 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1064 transition count 1548
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1042 transition count 1526
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1042 transition count 1526
Free-agglomeration rule applied 927 times.
Iterating global reduction 1 with 927 rules applied. Total rules applied 1015 place count 1042 transition count 599
Reduce places removed 928 places and 0 transitions.
Drop transitions removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 207 edges and 114 vertex of which 24 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.1 ms
Discarding 90 places :
Also discarding 90 output transitions
Drop transitions removed 90 transitions
Graph (trivial) has 56 edges and 24 vertex of which 8 / 24 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 1370 rules applied. Total rules applied 2385 place count 20 transition count 69
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 2429 place count 20 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2429 place count 20 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2437 place count 16 transition count 21
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 2441 place count 16 transition count 17
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 2449 place count 12 transition count 13
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2453 place count 12 transition count 9
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 2464 place count 5 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2465 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2466 place count 4 transition count 4
Applied a total of 2466 rules in 237 ms. Remains 4 /1064 variables (removed 1060) and now considering 4/1592 (removed 1588) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 4/1064 places, 4/1592 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 173 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Product exploration explored 100000 steps with 3528 reset in 1435 ms.
Product exploration explored 100000 steps with 3511 reset in 1377 ms.
Built C files in :
/tmp/ltsmin5330848616099164984
[2024-05-23 21:43:28] [INFO ] Too many transitions (1592) to apply POR reductions. Disabling POR matrices.
[2024-05-23 21:43:28] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5330848616099164984
Running compilation step : cd /tmp/ltsmin5330848616099164984;'/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 2800 ms.
Running link step : cd /tmp/ltsmin5330848616099164984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin5330848616099164984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2387717267134821112.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1592/1592 transitions.
Applied a total of 0 rules in 135 ms. Remains 1064 /1064 variables (removed 0) and now considering 1592/1592 (removed 0) transitions.
[2024-05-23 21:43:43] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:43:43] [INFO ] Invariant cache hit.
[2024-05-23 21:43:44] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-05-23 21:43:44] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:43:44] [INFO ] Invariant cache hit.
[2024-05-23 21:43:45] [INFO ] Implicit Places using invariants and state equation in 1177 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
[2024-05-23 21:43:45] [INFO ] Redundant transitions in 82 ms returned []
[2024-05-23 21:43:45] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:43:45] [INFO ] Invariant cache hit.
[2024-05-23 21:43:46] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2554 ms. Remains : 1064/1064 places, 1592/1592 transitions.
Built C files in :
/tmp/ltsmin10949776649350258739
[2024-05-23 21:43:46] [INFO ] Too many transitions (1592) to apply POR reductions. Disabling POR matrices.
[2024-05-23 21:43:46] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10949776649350258739
Running compilation step : cd /tmp/ltsmin10949776649350258739;'/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/ltsmin10949776649350258739;'/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/ltsmin10949776649350258739;'/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:43:49] [INFO ] Flatten gal took : 63 ms
[2024-05-23 21:43:49] [INFO ] Flatten gal took : 56 ms
[2024-05-23 21:43:49] [INFO ] Time to serialize gal into /tmp/LTL4832277159232649142.gal : 13 ms
[2024-05-23 21:43:49] [INFO ] Time to serialize properties into /tmp/LTL5501516808891719524.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/LTL4832277159232649142.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5940705034025553961.hoa' '-atoms' '/tmp/LTL5501516808891719524.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5501516808891719524.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5940705034025553961.hoa
Detected timeout of ITS tools.
[2024-05-23 21:44:04] [INFO ] Flatten gal took : 93 ms
[2024-05-23 21:44:04] [INFO ] Flatten gal took : 97 ms
[2024-05-23 21:44:05] [INFO ] Time to serialize gal into /tmp/LTL17815715176035766143.gal : 25 ms
[2024-05-23 21:44:05] [INFO ] Time to serialize properties into /tmp/LTL7356223867047759304.ltl : 27 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/LTL17815715176035766143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7356223867047759304.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((G("(p2225!=1)"))||(("(p2225!=1)")&&(G((F("(p6201!=1)"))&&(F(G("(p2225==1)")))))))))
Formula 0 simplified : X(F!"(p2225!=1)" & (!"(p2225!=1)" | F(G!"(p6201!=1)" | GF!"(p2225==1)")))
Detected timeout of ITS tools.
[2024-05-23 21:44:20] [INFO ] Flatten gal took : 71 ms
[2024-05-23 21:44:20] [INFO ] Applying decomposition
[2024-05-23 21:44:20] [INFO ] Flatten gal took : 58 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/graph15190100165357575629.txt' '-o' '/tmp/graph15190100165357575629.bin' '-w' '/tmp/graph15190100165357575629.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15190100165357575629.bin' '-l' '-1' '-v' '-w' '/tmp/graph15190100165357575629.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:44:20] [INFO ] Decomposing Gal with order
[2024-05-23 21:44:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:44:21] [INFO ] Removed a total of 616 redundant transitions.
[2024-05-23 21:44:21] [INFO ] Flatten gal took : 926 ms
[2024-05-23 21:44:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 50 ms.
[2024-05-23 21:44:21] [INFO ] Time to serialize gal into /tmp/LTL17921933276453278152.gal : 65 ms
[2024-05-23 21:44:21] [INFO ] Time to serialize properties into /tmp/LTL13243355539386100311.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/LTL17921933276453278152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13243355539386100311.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((G("(i11.u35.p2225!=1)"))||(("(i11.u35.p2225!=1)")&&(G((F("(i9.u66.p6201!=1)"))&&(F(G("(i11.u35.p2225==1)")))))))))
Formula 0 simplified : X(F!"(i11.u35.p2225!=1)" & (!"(i11.u35.p2225!=1)" | F(G!"(i9.u66.p6201!=1)" | GF!"(i11.u35.p2225==1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6700212560537472078
[2024-05-23 21:44:37] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6700212560537472078
Running compilation step : cd /tmp/ltsmin6700212560537472078;'/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 2818 ms.
Running link step : cd /tmp/ltsmin6700212560537472078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6700212560537472078;'/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))||((LTLAPp0==true)&&[]((<>((LTLAPp1==true))&&<>([](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-03 finished in 108443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 2 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1534 transition count 2106
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1534 transition count 2106
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 64 place count 1534 transition count 2098
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 84 place count 1514 transition count 2078
Iterating global reduction 1 with 20 rules applied. Total rules applied 104 place count 1514 transition count 2078
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 115 place count 1514 transition count 2067
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 120 place count 1509 transition count 2062
Iterating global reduction 2 with 5 rules applied. Total rules applied 125 place count 1509 transition count 2062
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 1509 transition count 2060
Applied a total of 127 rules in 274 ms. Remains 1509 /1562 variables (removed 53) and now considering 2060/2134 (removed 74) transitions.
// Phase 1: matrix 2060 rows 1509 cols
[2024-05-23 21:44:52] [INFO ] Computed 24 invariants in 47 ms
[2024-05-23 21:44:53] [INFO ] Implicit Places using invariants in 855 ms returned []
[2024-05-23 21:44:53] [INFO ] Invariant cache hit.
[2024-05-23 21:44:54] [INFO ] Implicit Places using invariants and state equation in 1488 ms returned []
Implicit Place search using SMT with State Equation took 2365 ms to find 0 implicit places.
[2024-05-23 21:44:54] [INFO ] Invariant cache hit.
[2024-05-23 21:44:55] [INFO ] Dead Transitions using invariants and state equation in 904 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1509/1562 places, 2060/2134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3554 ms. Remains : 1509/1562 places, 2060/2134 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s432 0), p1:(EQ s120 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 675 reset in 350 ms.
Product exploration explored 100000 steps with 673 reset in 446 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 223 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 158191 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{0=1, 2=1, 4=1}
Probabilistic random walk after 158191 steps, saw 82681 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :3
Running SMT prover for 2 properties.
[2024-05-23 21:45:00] [INFO ] Invariant cache hit.
[2024-05-23 21:45:00] [INFO ] [Real]Absence check using 24 positive place invariants in 19 ms returned sat
[2024-05-23 21:45:01] [INFO ] After 622ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-23 21:45:01] [INFO ] After 733ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-23 21:45:01] [INFO ] After 1030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 21:45:01] [INFO ] [Nat]Absence check using 24 positive place invariants in 17 ms returned sat
[2024-05-23 21:45:02] [INFO ] After 764ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 21:45:02] [INFO ] Deduced a trap composed of 186 places in 116 ms of which 9 ms to minimize.
[2024-05-23 21:45:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2024-05-23 21:45:02] [INFO ] After 1130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 106 ms.
[2024-05-23 21:45:02] [INFO ] After 1488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 1509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1509/1509 places, 2060/2060 transitions.
Graph (trivial) has 1437 edges and 1509 vertex of which 133 / 1509 are part of one of the 22 SCC in 1 ms
Free SCC test removed 111 places
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 1398 transition count 1819
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 215 place count 1291 transition count 1819
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 215 place count 1291 transition count 1773
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 307 place count 1245 transition count 1773
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 350 place count 1202 transition count 1730
Iterating global reduction 2 with 43 rules applied. Total rules applied 393 place count 1202 transition count 1730
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 1201 transition count 1729
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 1201 transition count 1729
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 1 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 665 place count 1066 transition count 1594
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 709 place count 1066 transition count 1550
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 731 place count 1044 transition count 1528
Iterating global reduction 3 with 22 rules applied. Total rules applied 753 place count 1044 transition count 1528
Free-agglomeration rule applied 927 times.
Iterating global reduction 3 with 927 rules applied. Total rules applied 1680 place count 1044 transition count 601
Reduce places removed 927 places and 0 transitions.
Drop transitions removed 441 transitions
Reduce isomorphic transitions removed 441 transitions.
Graph (complete) has 317 edges and 117 vertex of which 22 are kept as prefixes of interest. Removing 95 places using SCC suffix rule.15 ms
Discarding 95 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1369 rules applied. Total rules applied 3049 place count 22 transition count 160
Drop transitions removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Iterating post reduction 4 with 133 rules applied. Total rules applied 3182 place count 22 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3183 place count 21 transition count 26
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 21 edges and 19 vertex of which 12 / 19 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 3187 place count 10 transition count 25
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 19 rules applied. Total rules applied 3206 place count 8 transition count 8
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 3209 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3210 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 3210 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 3214 place count 4 transition count 4
Applied a total of 3214 rules in 525 ms. Remains 4 /1509 variables (removed 1505) and now considering 4/2060 (removed 2056) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 525 ms. Remains : 4/1509 places, 4/2060 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 11 factoid took 292 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 2060/2060 transitions.
Applied a total of 0 rules in 57 ms. Remains 1509 /1509 variables (removed 0) and now considering 2060/2060 (removed 0) transitions.
[2024-05-23 21:45:03] [INFO ] Invariant cache hit.
[2024-05-23 21:45:04] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-05-23 21:45:04] [INFO ] Invariant cache hit.
[2024-05-23 21:45:05] [INFO ] Implicit Places using invariants and state equation in 1499 ms returned []
Implicit Place search using SMT with State Equation took 2125 ms to find 0 implicit places.
[2024-05-23 21:45:05] [INFO ] Invariant cache hit.
[2024-05-23 21:45:06] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3118 ms. Remains : 1509/1509 places, 2060/2060 transitions.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 171 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 177796 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{0=1, 2=1, 4=1}
Probabilistic random walk after 177796 steps, saw 87548 distinct states, run finished after 3003 ms. (steps per millisecond=59 ) properties seen :3
Running SMT prover for 2 properties.
[2024-05-23 21:45:10] [INFO ] Invariant cache hit.
[2024-05-23 21:45:10] [INFO ] [Real]Absence check using 24 positive place invariants in 17 ms returned sat
[2024-05-23 21:45:11] [INFO ] After 764ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-23 21:45:11] [INFO ] After 865ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-23 21:45:11] [INFO ] After 1158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 21:45:11] [INFO ] [Nat]Absence check using 24 positive place invariants in 17 ms returned sat
[2024-05-23 21:45:12] [INFO ] After 683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 21:45:12] [INFO ] Deduced a trap composed of 186 places in 134 ms of which 1 ms to minimize.
[2024-05-23 21:45:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2024-05-23 21:45:12] [INFO ] After 1083ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 115 ms.
[2024-05-23 21:45:12] [INFO ] After 1434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 1509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1509/1509 places, 2060/2060 transitions.
Graph (trivial) has 1437 edges and 1509 vertex of which 133 / 1509 are part of one of the 22 SCC in 1 ms
Free SCC test removed 111 places
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 1398 transition count 1819
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 215 place count 1291 transition count 1819
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 215 place count 1291 transition count 1773
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 307 place count 1245 transition count 1773
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 350 place count 1202 transition count 1730
Iterating global reduction 2 with 43 rules applied. Total rules applied 393 place count 1202 transition count 1730
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 1201 transition count 1729
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 1201 transition count 1729
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 0 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 665 place count 1066 transition count 1594
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 709 place count 1066 transition count 1550
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 731 place count 1044 transition count 1528
Iterating global reduction 3 with 22 rules applied. Total rules applied 753 place count 1044 transition count 1528
Free-agglomeration rule applied 927 times.
Iterating global reduction 3 with 927 rules applied. Total rules applied 1680 place count 1044 transition count 601
Reduce places removed 927 places and 0 transitions.
Drop transitions removed 441 transitions
Reduce isomorphic transitions removed 441 transitions.
Graph (complete) has 317 edges and 117 vertex of which 22 are kept as prefixes of interest. Removing 95 places using SCC suffix rule.0 ms
Discarding 95 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1369 rules applied. Total rules applied 3049 place count 22 transition count 160
Drop transitions removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Iterating post reduction 4 with 133 rules applied. Total rules applied 3182 place count 22 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3183 place count 21 transition count 26
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 21 edges and 19 vertex of which 12 / 19 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 3187 place count 10 transition count 25
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 19 rules applied. Total rules applied 3206 place count 8 transition count 8
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 3209 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3210 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 3210 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 3214 place count 4 transition count 4
Applied a total of 3214 rules in 430 ms. Remains 4 /1509 variables (removed 1505) and now considering 4/2060 (removed 2056) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 430 ms. Remains : 4/1509 places, 4/2060 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 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 11 factoid took 378 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 676 reset in 293 ms.
Product exploration explored 100000 steps with 674 reset in 318 ms.
Built C files in :
/tmp/ltsmin11284041758518358983
[2024-05-23 21:45:14] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11284041758518358983
Running compilation step : cd /tmp/ltsmin11284041758518358983;'/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/ltsmin11284041758518358983;'/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/ltsmin11284041758518358983;'/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 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 2060/2060 transitions.
Applied a total of 0 rules in 62 ms. Remains 1509 /1509 variables (removed 0) and now considering 2060/2060 (removed 0) transitions.
[2024-05-23 21:45:17] [INFO ] Invariant cache hit.
[2024-05-23 21:45:18] [INFO ] Implicit Places using invariants in 809 ms returned []
[2024-05-23 21:45:18] [INFO ] Invariant cache hit.
[2024-05-23 21:45:20] [INFO ] Implicit Places using invariants and state equation in 1528 ms returned []
Implicit Place search using SMT with State Equation took 2367 ms to find 0 implicit places.
[2024-05-23 21:45:20] [INFO ] Invariant cache hit.
[2024-05-23 21:45:21] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3339 ms. Remains : 1509/1509 places, 2060/2060 transitions.
Built C files in :
/tmp/ltsmin9700970236002879723
[2024-05-23 21:45:21] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9700970236002879723
Running compilation step : cd /tmp/ltsmin9700970236002879723;'/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/ltsmin9700970236002879723;'/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/ltsmin9700970236002879723;'/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:45:24] [INFO ] Flatten gal took : 100 ms
[2024-05-23 21:45:24] [INFO ] Flatten gal took : 107 ms
[2024-05-23 21:45:24] [INFO ] Time to serialize gal into /tmp/LTL3849588223602514378.gal : 24 ms
[2024-05-23 21:45:24] [INFO ] Time to serialize properties into /tmp/LTL11372924514220307768.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/LTL3849588223602514378.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15218065238652137278.hoa' '-atoms' '/tmp/LTL11372924514220307768.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/LTL11372924514220307768.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15218065238652137278.hoa
Detected timeout of ITS tools.
[2024-05-23 21:45:39] [INFO ] Flatten gal took : 41 ms
[2024-05-23 21:45:39] [INFO ] Flatten gal took : 50 ms
[2024-05-23 21:45:39] [INFO ] Time to serialize gal into /tmp/LTL1244091795755075406.gal : 9 ms
[2024-05-23 21:45:39] [INFO ] Time to serialize properties into /tmp/LTL1626888617017373689.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/LTL1244091795755075406.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1626888617017373689.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p1762==0)")||(X("(p434==1)"))))))
Formula 0 simplified : GF(!"(p1762==0)" & X!"(p434==1)")
Detected timeout of ITS tools.
[2024-05-23 21:45:54] [INFO ] Flatten gal took : 62 ms
[2024-05-23 21:45:54] [INFO ] Applying decomposition
[2024-05-23 21:45:55] [INFO ] Flatten gal took : 68 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/graph16212274868458258056.txt' '-o' '/tmp/graph16212274868458258056.bin' '-w' '/tmp/graph16212274868458258056.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16212274868458258056.bin' '-l' '-1' '-v' '-w' '/tmp/graph16212274868458258056.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:45:55] [INFO ] Decomposing Gal with order
[2024-05-23 21:45:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:45:55] [INFO ] Removed a total of 594 redundant transitions.
[2024-05-23 21:45:55] [INFO ] Flatten gal took : 302 ms
[2024-05-23 21:45:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 37 ms.
[2024-05-23 21:45:55] [INFO ] Time to serialize gal into /tmp/LTL3421381447540104823.gal : 25 ms
[2024-05-23 21:45:55] [INFO ] Time to serialize properties into /tmp/LTL12757665187896730747.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/LTL3421381447540104823.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12757665187896730747.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 : !((F(G(("(i9.i1.i0.u99.p1762==0)")||(X("(i3.u31.p434==1)"))))))
Formula 0 simplified : GF(!"(i9.i1.i0.u99.p1762==0)" & X!"(i3.u31.p434==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12201138476230835738
[2024-05-23 21:46:10] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12201138476230835738
Running compilation step : cd /tmp/ltsmin12201138476230835738;'/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/ltsmin12201138476230835738;'/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/ltsmin12201138476230835738;'/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-22b-LTLFireability-04 finished in 81713 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)&&F(p1)))))'
Support contains 2 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1533 transition count 2105
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1533 transition count 2105
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 66 place count 1533 transition count 2097
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 86 place count 1513 transition count 2077
Iterating global reduction 1 with 20 rules applied. Total rules applied 106 place count 1513 transition count 2077
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 116 place count 1513 transition count 2067
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 122 place count 1507 transition count 2061
Iterating global reduction 2 with 6 rules applied. Total rules applied 128 place count 1507 transition count 2061
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 131 place count 1507 transition count 2058
Applied a total of 131 rules in 272 ms. Remains 1507 /1562 variables (removed 55) and now considering 2058/2134 (removed 76) transitions.
// Phase 1: matrix 2058 rows 1507 cols
[2024-05-23 21:46:14] [INFO ] Computed 24 invariants in 42 ms
[2024-05-23 21:46:14] [INFO ] Implicit Places using invariants in 704 ms returned []
[2024-05-23 21:46:14] [INFO ] Invariant cache hit.
[2024-05-23 21:46:16] [INFO ] Implicit Places using invariants and state equation in 1529 ms returned []
Implicit Place search using SMT with State Equation took 2244 ms to find 0 implicit places.
[2024-05-23 21:46:16] [INFO ] Invariant cache hit.
[2024-05-23 21:46:17] [INFO ] Dead Transitions using invariants and state equation in 923 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1507/1562 places, 2058/2134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3450 ms. Remains : 1507/1562 places, 2058/2134 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s515 1), p1:(EQ s772 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 142 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-05 finished in 3599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(G(p0)))) U (p1&&X(X(X(p2))))))'
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1535 transition count 2107
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1535 transition count 2107
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 62 place count 1535 transition count 2099
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 80 place count 1517 transition count 2081
Iterating global reduction 1 with 18 rules applied. Total rules applied 98 place count 1517 transition count 2081
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 108 place count 1517 transition count 2071
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 113 place count 1512 transition count 2066
Iterating global reduction 2 with 5 rules applied. Total rules applied 118 place count 1512 transition count 2066
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 121 place count 1512 transition count 2063
Applied a total of 121 rules in 269 ms. Remains 1512 /1562 variables (removed 50) and now considering 2063/2134 (removed 71) transitions.
// Phase 1: matrix 2063 rows 1512 cols
[2024-05-23 21:46:17] [INFO ] Computed 24 invariants in 44 ms
[2024-05-23 21:46:18] [INFO ] Implicit Places using invariants in 649 ms returned []
[2024-05-23 21:46:18] [INFO ] Invariant cache hit.
[2024-05-23 21:46:19] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 2231 ms to find 0 implicit places.
[2024-05-23 21:46:19] [INFO ] Invariant cache hit.
[2024-05-23 21:46:20] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1512/1562 places, 2063/2134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3391 ms. Remains : 1512/1562 places, 2063/2134 transitions.
Stuttering acceptance computed with spot in 1176 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1), (NOT p2), true, (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) p1), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 4}, { cond=p1, acceptance={0} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 7}, { cond=p0, acceptance={} source=3 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(AND p1 p0), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 10}, { cond=(NOT p1), acceptance={0} source=5 dest: 11}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 12}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 13}, { cond=p1, acceptance={0} source=5 dest: 14}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 9}], [{ cond=(NOT p0), acceptance={} source=8 dest: 9}, { cond=p0, acceptance={} source=8 dest: 15}], [{ cond=(NOT p2), acceptance={} source=9 dest: 6}], [{ cond=(NOT p0), acceptance={} source=10 dest: 15}, { cond=p0, acceptance={} source=10 dest: 16}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=11 dest: 15}, { cond=(AND (NOT p1) p0), acceptance={0} source=11 dest: 16}, { cond=(NOT p1), acceptance={0} source=11 dest: 17}, { cond=(AND p1 (NOT p0)), acceptance={0} source=11 dest: 18}, { cond=(AND p1 p0), acceptance={0} source=11 dest: 19}, { cond=p1, acceptance={0} source=11 dest: 20}], [{ cond=(NOT p0), acceptance={} source=12 dest: 21}, { cond=p0, acceptance={} source=12 dest: 22}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=13 dest: 22}, { cond=(AND p1 p0), acceptance={} source=13 dest: 23}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=14 dest: 22}, { cond=(AND (NOT p1) p0), acceptance={0} source=14 dest: 23}, { cond=(NOT p1), acceptance={0} source=14 dest: 24}, { cond=(AND p1 (NOT p0)), acceptance={0} source=14 dest: 25}, { cond=(AND p1 p0), acceptance={0} source=14 dest: 26}, { cond=p1, acceptance={0} source=14 dest: 27}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=15 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=15 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=16 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=16 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=17 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=17 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=17 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=17 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=17 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=17 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=18 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=18 dest: 8}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=19 dest: 8}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=19 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=20 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=20 dest: 10}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=20 dest: 11}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=20 dest: 12}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=20 dest: 13}, { cond=(AND p1 (NOT p2)), acceptance={0} source=20 dest: 14}], [{ cond=(NOT p2), acceptance={} source=21 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=22 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=22 dest: 15}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=23 dest: 15}, { cond=(AND p0 (NOT p2)), acceptance={} source=23 dest: 16}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=24 dest: 15}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=24 dest: 16}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=24 dest: 17}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=24 dest: 18}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=24 dest: 19}, { cond=(AND p1 (NOT p2)), acceptance={0} source=24 dest: 20}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=25 dest: 21}, { cond=(AND p0 (NOT p2)), acceptance={} source=25 dest: 22}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=26 dest: 22}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=26 dest: 23}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=27 dest: 22}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=27 dest: 23}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=27 dest: 24}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=27 dest: 25}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=27 dest: 26}, { cond=(AND p1 (NOT p2)), acceptance={0} source=27 dest: 27}]], initial=0, aps=[p1:(EQ s1261 1), p0:(EQ s1443 1), p2:(EQ s920 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-07 finished in 4608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)||X(G(p2))))))'
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1532 transition count 2104
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1532 transition count 2104
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 68 place count 1532 transition count 2096
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 89 place count 1511 transition count 2075
Iterating global reduction 1 with 21 rules applied. Total rules applied 110 place count 1511 transition count 2075
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 121 place count 1511 transition count 2064
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 127 place count 1505 transition count 2058
Iterating global reduction 2 with 6 rules applied. Total rules applied 133 place count 1505 transition count 2058
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 136 place count 1505 transition count 2055
Applied a total of 136 rules in 270 ms. Remains 1505 /1562 variables (removed 57) and now considering 2055/2134 (removed 79) transitions.
// Phase 1: matrix 2055 rows 1505 cols
[2024-05-23 21:46:22] [INFO ] Computed 24 invariants in 43 ms
[2024-05-23 21:46:23] [INFO ] Implicit Places using invariants in 678 ms returned []
[2024-05-23 21:46:23] [INFO ] Invariant cache hit.
[2024-05-23 21:46:24] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 2219 ms to find 0 implicit places.
[2024-05-23 21:46:24] [INFO ] Invariant cache hit.
[2024-05-23 21:46:25] [INFO ] Dead Transitions using invariants and state equation in 892 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1505/1562 places, 2055/2134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3392 ms. Remains : 1505/1562 places, 2055/2134 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s857 0), p2:(EQ s582 1), p0:(EQ s50 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 677 reset in 299 ms.
Product exploration explored 100000 steps with 676 reset in 311 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 169 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :2
Running SMT prover for 4 properties.
[2024-05-23 21:46:26] [INFO ] Invariant cache hit.
[2024-05-23 21:46:27] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 21:46:27] [INFO ] [Nat]Absence check using 24 positive place invariants in 16 ms returned sat
[2024-05-23 21:46:28] [INFO ] After 767ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 21:46:28] [INFO ] After 1151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 223 ms.
[2024-05-23 21:46:28] [INFO ] After 1732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 27 ms.
Support contains 2 out of 1505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1505/1505 places, 2055/2055 transitions.
Graph (trivial) has 1413 edges and 1505 vertex of which 127 / 1505 are part of one of the 21 SCC in 2 ms
Free SCC test removed 106 places
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 1399 transition count 1819
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 217 place count 1291 transition count 1819
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 217 place count 1291 transition count 1772
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 311 place count 1244 transition count 1772
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 352 place count 1203 transition count 1731
Iterating global reduction 2 with 41 rules applied. Total rules applied 393 place count 1203 transition count 1731
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 0 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 276 rules applied. Total rules applied 669 place count 1065 transition count 1593
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 712 place count 1065 transition count 1550
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 734 place count 1043 transition count 1528
Iterating global reduction 3 with 22 rules applied. Total rules applied 756 place count 1043 transition count 1528
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 758 place count 1042 transition count 1528
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 760 place count 1042 transition count 1526
Free-agglomeration rule applied 905 times.
Iterating global reduction 3 with 905 rules applied. Total rules applied 1665 place count 1042 transition count 621
Reduce places removed 905 places and 0 transitions.
Drop transitions removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 3 with 1305 rules applied. Total rules applied 2970 place count 137 transition count 221
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 2991 place count 137 transition count 200
Graph (complete) has 376 edges and 137 vertex of which 132 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 2992 place count 132 transition count 200
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 2999 place count 132 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2999 place count 132 transition count 192
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3001 place count 131 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3002 place count 130 transition count 191
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 145 edges and 128 vertex of which 99 / 128 are part of one of the 21 SCC in 0 ms
Free SCC test removed 78 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 6 with 5 rules applied. Total rules applied 3007 place count 50 transition count 189
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 159 rules applied. Total rules applied 3166 place count 29 transition count 51
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 3169 place count 28 transition count 49
Reduce places removed 1 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 9 with 22 rules applied. Total rules applied 3191 place count 27 transition count 28
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 43 rules applied. Total rules applied 3234 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 3235 place count 5 transition count 6
Applied a total of 3235 rules in 579 ms. Remains 5 /1505 variables (removed 1500) and now considering 6/2055 (removed 2049) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 579 ms. Remains : 5/1505 places, 6/2055 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (AND p1 p2)), (F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F p2), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 12 factoid took 519 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 1505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1505/1505 places, 2055/2055 transitions.
Applied a total of 0 rules in 56 ms. Remains 1505 /1505 variables (removed 0) and now considering 2055/2055 (removed 0) transitions.
[2024-05-23 21:46:30] [INFO ] Invariant cache hit.
[2024-05-23 21:46:31] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-23 21:46:31] [INFO ] Invariant cache hit.
[2024-05-23 21:46:32] [INFO ] Implicit Places using invariants and state equation in 1534 ms returned []
Implicit Place search using SMT with State Equation took 2194 ms to find 0 implicit places.
[2024-05-23 21:46:32] [INFO ] Invariant cache hit.
[2024-05-23 21:46:33] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3198 ms. Remains : 1505/1505 places, 2055/2055 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 115 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-23 21:46:34] [INFO ] Invariant cache hit.
[2024-05-23 21:46:34] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 21:46:34] [INFO ] [Nat]Absence check using 24 positive place invariants in 17 ms returned sat
[2024-05-23 21:46:35] [INFO ] After 887ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 21:46:36] [INFO ] After 1497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 340 ms.
[2024-05-23 21:46:36] [INFO ] After 2258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 5 properties in 9 ms.
Support contains 2 out of 1505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1505/1505 places, 2055/2055 transitions.
Graph (trivial) has 1433 edges and 1505 vertex of which 133 / 1505 are part of one of the 22 SCC in 1 ms
Free SCC test removed 111 places
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 1394 transition count 1813
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 217 place count 1286 transition count 1813
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 217 place count 1286 transition count 1767
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 309 place count 1240 transition count 1767
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 352 place count 1197 transition count 1724
Iterating global reduction 2 with 43 rules applied. Total rules applied 395 place count 1197 transition count 1724
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 663 place count 1063 transition count 1590
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 706 place count 1063 transition count 1547
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 727 place count 1042 transition count 1526
Iterating global reduction 3 with 21 rules applied. Total rules applied 748 place count 1042 transition count 1526
Free-agglomeration rule applied 926 times.
Iterating global reduction 3 with 926 rules applied. Total rules applied 1674 place count 1042 transition count 600
Reduce places removed 926 places and 0 transitions.
Drop transitions removed 441 transitions
Reduce isomorphic transitions removed 441 transitions.
Graph (complete) has 316 edges and 116 vertex of which 16 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.0 ms
Discarding 100 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1368 rules applied. Total rules applied 3042 place count 16 transition count 159
Drop transitions removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 4 with 140 rules applied. Total rules applied 3182 place count 16 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3183 place count 15 transition count 18
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 12 edges and 13 vertex of which 7 / 13 are part of one of the 2 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 3187 place count 8 transition count 17
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 10 rules applied. Total rules applied 3197 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 3200 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3201 place count 5 transition count 6
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 9 with 2 rules applied. Total rules applied 3203 place count 4 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3204 place count 4 transition count 4
Applied a total of 3204 rules in 397 ms. Remains 4 /1505 variables (removed 1501) and now considering 4/2055 (removed 2051) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 4/1505 places, 4/2055 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (AND p1 p2)), (F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F p2), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 12 factoid took 511 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 675 reset in 303 ms.
Product exploration explored 100000 steps with 669 reset in 340 ms.
Applying partial POR strategy [true, true, true, true, false, false]
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 1505 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1505/1505 places, 2055/2055 transitions.
Graph (trivial) has 1411 edges and 1505 vertex of which 127 / 1505 are part of one of the 21 SCC in 0 ms
Free SCC test removed 106 places
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 1399 transition count 1948
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 66 Pre rules applied. Total rules applied 88 place count 1399 transition count 1949
Deduced a syphon composed of 153 places in 1 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 154 place count 1399 transition count 1949
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 258 place count 1295 transition count 1845
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 104 rules applied. Total rules applied 362 place count 1295 transition count 1845
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 208 places in 0 ms
Iterating global reduction 1 with 118 rules applied. Total rules applied 480 place count 1295 transition count 1888
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 530 place count 1245 transition count 1838
Deduced a syphon composed of 158 places in 0 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 580 place count 1245 transition count 1838
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 180 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 602 place count 1245 transition count 1883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 603 place count 1244 transition count 1881
Deduced a syphon composed of 179 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 604 place count 1244 transition count 1881
Deduced a syphon composed of 179 places in 0 ms
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 1 with 44 rules applied. Total rules applied 648 place count 1244 transition count 1837
Deduced a syphon composed of 179 places in 0 ms
Applied a total of 648 rules in 869 ms. Remains 1244 /1505 variables (removed 261) and now considering 1837/2055 (removed 218) transitions.
[2024-05-23 21:46:40] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-23 21:46:40] [INFO ] Flow matrix only has 1796 transitions (discarded 41 similar events)
// Phase 1: matrix 1796 rows 1244 cols
[2024-05-23 21:46:40] [INFO ] Computed 24 invariants in 56 ms
[2024-05-23 21:46:41] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1244/1505 places, 1837/2055 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1921 ms. Remains : 1244/1505 places, 1837/2055 transitions.
Built C files in :
/tmp/ltsmin3276047580681381872
[2024-05-23 21:46:41] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3276047580681381872
Running compilation step : cd /tmp/ltsmin3276047580681381872;'/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/ltsmin3276047580681381872;'/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/ltsmin3276047580681381872;'/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 3 out of 1505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1505/1505 places, 2055/2055 transitions.
Applied a total of 0 rules in 64 ms. Remains 1505 /1505 variables (removed 0) and now considering 2055/2055 (removed 0) transitions.
// Phase 1: matrix 2055 rows 1505 cols
[2024-05-23 21:46:44] [INFO ] Computed 24 invariants in 50 ms
[2024-05-23 21:46:45] [INFO ] Implicit Places using invariants in 772 ms returned []
[2024-05-23 21:46:45] [INFO ] Invariant cache hit.
[2024-05-23 21:46:46] [INFO ] Implicit Places using invariants and state equation in 1474 ms returned []
Implicit Place search using SMT with State Equation took 2269 ms to find 0 implicit places.
[2024-05-23 21:46:46] [INFO ] Invariant cache hit.
[2024-05-23 21:46:47] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3230 ms. Remains : 1505/1505 places, 2055/2055 transitions.
Built C files in :
/tmp/ltsmin11026461250183747933
[2024-05-23 21:46:47] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11026461250183747933
Running compilation step : cd /tmp/ltsmin11026461250183747933;'/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/ltsmin11026461250183747933;'/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/ltsmin11026461250183747933;'/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:46:50] [INFO ] Flatten gal took : 38 ms
[2024-05-23 21:46:50] [INFO ] Flatten gal took : 39 ms
[2024-05-23 21:46:50] [INFO ] Time to serialize gal into /tmp/LTL451898274654882198.gal : 12 ms
[2024-05-23 21:46:50] [INFO ] Time to serialize properties into /tmp/LTL13082096833710329054.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/LTL451898274654882198.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6894021290198435536.hoa' '-atoms' '/tmp/LTL13082096833710329054.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL13082096833710329054.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6894021290198435536.hoa
Detected timeout of ITS tools.
[2024-05-23 21:47:05] [INFO ] Flatten gal took : 38 ms
[2024-05-23 21:47:05] [INFO ] Flatten gal took : 37 ms
[2024-05-23 21:47:05] [INFO ] Time to serialize gal into /tmp/LTL5120604141185868093.gal : 8 ms
[2024-05-23 21:47:05] [INFO ] Time to serialize properties into /tmp/LTL11954462559909907313.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/LTL5120604141185868093.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11954462559909907313.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(G((("(p189==0)")||(G("(p3534==0)")))||(X(G("(p2365==1)")))))))
Formula 0 simplified : XF(!"(p189==0)" & F!"(p3534==0)" & XF!"(p2365==1)")
Detected timeout of ITS tools.
[2024-05-23 21:47:21] [INFO ] Flatten gal took : 70 ms
[2024-05-23 21:47:21] [INFO ] Applying decomposition
[2024-05-23 21:47:21] [INFO ] Flatten gal took : 43 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/graph12403846260629010276.txt' '-o' '/tmp/graph12403846260629010276.bin' '-w' '/tmp/graph12403846260629010276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12403846260629010276.bin' '-l' '-1' '-v' '-w' '/tmp/graph12403846260629010276.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:47:21] [INFO ] Decomposing Gal with order
[2024-05-23 21:47:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:47:21] [INFO ] Removed a total of 613 redundant transitions.
[2024-05-23 21:47:21] [INFO ] Flatten gal took : 348 ms
[2024-05-23 21:47:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 32 ms.
[2024-05-23 21:47:21] [INFO ] Time to serialize gal into /tmp/LTL1124041668792546921.gal : 32 ms
[2024-05-23 21:47:21] [INFO ] Time to serialize properties into /tmp/LTL12413746704529493794.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/LTL1124041668792546921.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12413746704529493794.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(G((("(i1.u12.p189==0)")||(G("(i4.i3.i1.u187.p3534==0)")))||(X(G("(i11.i1.i0.u131.p2365==1)")))))))
Formula 0 simplified : XF(!"(i1.u12.p189==0)" & F!"(i4.i3.i1.u187.p3534==0)" & XF!"(i11.i1.i0.u131.p2365==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4383770694100118914
[2024-05-23 21:47:37] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4383770694100118914
Running compilation step : cd /tmp/ltsmin4383770694100118914;'/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/ltsmin4383770694100118914;'/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/ltsmin4383770694100118914;'/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-22b-LTLFireability-08 finished in 78239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1533 transition count 2105
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1533 transition count 2105
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 66 place count 1533 transition count 2097
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 86 place count 1513 transition count 2077
Iterating global reduction 1 with 20 rules applied. Total rules applied 106 place count 1513 transition count 2077
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 117 place count 1513 transition count 2066
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 122 place count 1508 transition count 2061
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 1508 transition count 2061
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 129 place count 1508 transition count 2059
Applied a total of 129 rules in 175 ms. Remains 1508 /1562 variables (removed 54) and now considering 2059/2134 (removed 75) transitions.
// Phase 1: matrix 2059 rows 1508 cols
[2024-05-23 21:47:40] [INFO ] Computed 24 invariants in 66 ms
[2024-05-23 21:47:41] [INFO ] Implicit Places using invariants in 710 ms returned []
[2024-05-23 21:47:41] [INFO ] Invariant cache hit.
[2024-05-23 21:47:42] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 2232 ms to find 0 implicit places.
[2024-05-23 21:47:42] [INFO ] Invariant cache hit.
[2024-05-23 21:47:43] [INFO ] Dead Transitions using invariants and state equation in 862 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1562 places, 2059/2134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3283 ms. Remains : 1508/1562 places, 2059/2134 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s308 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-09 finished in 3423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Graph (trivial) has 1492 edges and 1562 vertex of which 133 / 1562 are part of one of the 22 SCC in 1 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 1450 transition count 1906
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 231 place count 1335 transition count 1906
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 231 place count 1335 transition count 1855
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 333 place count 1284 transition count 1855
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 405 place count 1212 transition count 1783
Iterating global reduction 2 with 72 rules applied. Total rules applied 477 place count 1212 transition count 1783
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 485 place count 1212 transition count 1775
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 485 place count 1212 transition count 1774
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 487 place count 1211 transition count 1774
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 499 place count 1199 transition count 1762
Iterating global reduction 3 with 12 rules applied. Total rules applied 511 place count 1199 transition count 1762
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 523 place count 1199 transition count 1750
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 4 with 266 rules applied. Total rules applied 789 place count 1066 transition count 1617
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 791 place count 1064 transition count 1615
Iterating global reduction 4 with 2 rules applied. Total rules applied 793 place count 1064 transition count 1615
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 795 place count 1064 transition count 1613
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 817 place count 1064 transition count 1591
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 819 place count 1062 transition count 1589
Applied a total of 819 rules in 761 ms. Remains 1062 /1562 variables (removed 500) and now considering 1589/2134 (removed 545) transitions.
[2024-05-23 21:47:44] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
// Phase 1: matrix 1546 rows 1062 cols
[2024-05-23 21:47:44] [INFO ] Computed 24 invariants in 42 ms
[2024-05-23 21:47:45] [INFO ] Implicit Places using invariants in 664 ms returned []
[2024-05-23 21:47:45] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2024-05-23 21:47:45] [INFO ] Invariant cache hit.
[2024-05-23 21:47:46] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
[2024-05-23 21:47:46] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-23 21:47:46] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2024-05-23 21:47:46] [INFO ] Invariant cache hit.
[2024-05-23 21:47:47] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1062/1562 places, 1589/2134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3326 ms. Remains : 1062/1562 places, 1589/2134 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s659 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3515 reset in 1388 ms.
Product exploration explored 100000 steps with 3517 reset in 1368 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 359 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 348971 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 348971 steps, saw 101544 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 21:47:53] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2024-05-23 21:47:53] [INFO ] Invariant cache hit.
[2024-05-23 21:47:53] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 21:47:53] [INFO ] [Nat]Absence check using 24 positive place invariants in 33 ms returned sat
[2024-05-23 21:47:54] [INFO ] After 474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 21:47:54] [INFO ] After 546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-23 21:47:54] [INFO ] After 763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 1589/1589 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1062 transition count 1545
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1040 transition count 1523
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1040 transition count 1523
Free-agglomeration rule applied 926 times.
Iterating global reduction 1 with 926 rules applied. Total rules applied 1014 place count 1040 transition count 597
Reduce places removed 927 places and 0 transitions.
Drop transitions removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 203 edges and 113 vertex of which 13 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.1 ms
Discarding 100 places :
Also discarding 100 output transitions
Drop transitions removed 100 transitions
Graph (trivial) has 50 edges and 13 vertex of which 4 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 1369 rules applied. Total rules applied 2383 place count 11 transition count 57
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 2427 place count 11 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2427 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2431 place count 9 transition count 11
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2433 place count 9 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2437 place count 7 transition count 7
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2439 place count 7 transition count 5
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2445 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2445 place count 3 transition count 2
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 2447 place count 2 transition count 2
Applied a total of 2447 rules in 225 ms. Remains 2 /1062 variables (removed 1060) and now considering 2/1589 (removed 1587) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 2/1062 places, 2/1589 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 257 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1589/1589 transitions.
Applied a total of 0 rules in 120 ms. Remains 1062 /1062 variables (removed 0) and now considering 1589/1589 (removed 0) transitions.
[2024-05-23 21:47:55] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2024-05-23 21:47:55] [INFO ] Invariant cache hit.
[2024-05-23 21:47:55] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-05-23 21:47:55] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2024-05-23 21:47:55] [INFO ] Invariant cache hit.
[2024-05-23 21:47:57] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1886 ms to find 0 implicit places.
[2024-05-23 21:47:57] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-23 21:47:57] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2024-05-23 21:47:57] [INFO ] Invariant cache hit.
[2024-05-23 21:47:57] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2664 ms. Remains : 1062/1062 places, 1589/1589 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 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 359 resets, run finished after 138 ms. (steps per millisecond=72 ) 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 349717 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 349717 steps, saw 101873 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 21:48:01] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2024-05-23 21:48:01] [INFO ] Invariant cache hit.
[2024-05-23 21:48:01] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 21:48:01] [INFO ] [Nat]Absence check using 24 positive place invariants in 9 ms returned sat
[2024-05-23 21:48:02] [INFO ] After 472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 21:48:02] [INFO ] After 544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-23 21:48:02] [INFO ] After 763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 1589/1589 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1062 transition count 1545
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1040 transition count 1523
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1040 transition count 1523
Free-agglomeration rule applied 926 times.
Iterating global reduction 1 with 926 rules applied. Total rules applied 1014 place count 1040 transition count 597
Reduce places removed 927 places and 0 transitions.
Drop transitions removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 203 edges and 113 vertex of which 13 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.0 ms
Discarding 100 places :
Also discarding 100 output transitions
Drop transitions removed 100 transitions
Graph (trivial) has 50 edges and 13 vertex of which 4 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 1369 rules applied. Total rules applied 2383 place count 11 transition count 57
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 2427 place count 11 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2427 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2431 place count 9 transition count 11
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2433 place count 9 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2437 place count 7 transition count 7
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2439 place count 7 transition count 5
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2445 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2445 place count 3 transition count 2
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 2447 place count 2 transition count 2
Applied a total of 2447 rules in 233 ms. Remains 2 /1062 variables (removed 1060) and now considering 2/1589 (removed 1587) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 2/1062 places, 2/1589 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 217 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3528 reset in 1322 ms.
Product exploration explored 100000 steps with 3522 reset in 1336 ms.
Built C files in :
/tmp/ltsmin9759475571532652436
[2024-05-23 21:48:05] [INFO ] Too many transitions (1589) to apply POR reductions. Disabling POR matrices.
[2024-05-23 21:48:05] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9759475571532652436
Running compilation step : cd /tmp/ltsmin9759475571532652436;'/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/ltsmin9759475571532652436;'/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/ltsmin9759475571532652436;'/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 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1589/1589 transitions.
Applied a total of 0 rules in 114 ms. Remains 1062 /1062 variables (removed 0) and now considering 1589/1589 (removed 0) transitions.
[2024-05-23 21:48:08] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2024-05-23 21:48:08] [INFO ] Invariant cache hit.
[2024-05-23 21:48:09] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-05-23 21:48:09] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2024-05-23 21:48:09] [INFO ] Invariant cache hit.
[2024-05-23 21:48:10] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
[2024-05-23 21:48:10] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-23 21:48:10] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2024-05-23 21:48:10] [INFO ] Invariant cache hit.
[2024-05-23 21:48:11] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2545 ms. Remains : 1062/1062 places, 1589/1589 transitions.
Built C files in :
/tmp/ltsmin2490871037205077416
[2024-05-23 21:48:11] [INFO ] Too many transitions (1589) to apply POR reductions. Disabling POR matrices.
[2024-05-23 21:48:11] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2490871037205077416
Running compilation step : cd /tmp/ltsmin2490871037205077416;'/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 2849 ms.
Running link step : cd /tmp/ltsmin2490871037205077416;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2490871037205077416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7708320443024239503.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 21:48:26] [INFO ] Flatten gal took : 29 ms
[2024-05-23 21:48:26] [INFO ] Flatten gal took : 30 ms
[2024-05-23 21:48:26] [INFO ] Time to serialize gal into /tmp/LTL13145718615875771408.gal : 19 ms
[2024-05-23 21:48:26] [INFO ] Time to serialize properties into /tmp/LTL13163062651251197842.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/LTL13145718615875771408.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7678026659889695502.hoa' '-atoms' '/tmp/LTL13163062651251197842.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/LTL13163062651251197842.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7678026659889695502.hoa
Detected timeout of ITS tools.
[2024-05-23 21:48:41] [INFO ] Flatten gal took : 35 ms
[2024-05-23 21:48:41] [INFO ] Flatten gal took : 31 ms
[2024-05-23 21:48:41] [INFO ] Time to serialize gal into /tmp/LTL7604054503084809967.gal : 6 ms
[2024-05-23 21:48:41] [INFO ] Time to serialize properties into /tmp/LTL2510101259215169668.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/LTL7604054503084809967.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2510101259215169668.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(p4462==0)"))))
Formula 0 simplified : FG!"(p4462==0)"
Detected timeout of ITS tools.
[2024-05-23 21:48:56] [INFO ] Flatten gal took : 35 ms
[2024-05-23 21:48:56] [INFO ] Applying decomposition
[2024-05-23 21:48:56] [INFO ] Flatten gal took : 29 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/graph9596578660799891606.txt' '-o' '/tmp/graph9596578660799891606.bin' '-w' '/tmp/graph9596578660799891606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9596578660799891606.bin' '-l' '-1' '-v' '-w' '/tmp/graph9596578660799891606.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:48:57] [INFO ] Decomposing Gal with order
[2024-05-23 21:48:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:48:57] [INFO ] Removed a total of 615 redundant transitions.
[2024-05-23 21:48:57] [INFO ] Flatten gal took : 168 ms
[2024-05-23 21:48:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 9 ms.
[2024-05-23 21:48:57] [INFO ] Time to serialize gal into /tmp/LTL4510478539681479594.gal : 9 ms
[2024-05-23 21:48:57] [INFO ] Time to serialize properties into /tmp/LTL13784415151776857550.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/LTL4510478539681479594.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13784415151776857550.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 : !((G(F("(i1.u67.p4462==0)"))))
Formula 0 simplified : FG!"(i1.u67.p4462==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15636145600512451762
[2024-05-23 21:49:12] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15636145600512451762
Running compilation step : cd /tmp/ltsmin15636145600512451762;'/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 2720 ms.
Running link step : cd /tmp/ltsmin15636145600512451762;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15636145600512451762;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-10 finished in 103716 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 G(p1))||G(F(p2))))'
Support contains 6 out of 1562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Graph (trivial) has 1462 edges and 1562 vertex of which 127 / 1562 are part of one of the 21 SCC in 1 ms
Free SCC test removed 106 places
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 1455 transition count 1913
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 1 with 113 rules applied. Total rules applied 227 place count 1342 transition count 1913
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 227 place count 1342 transition count 1862
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 329 place count 1291 transition count 1862
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 398 place count 1222 transition count 1793
Iterating global reduction 2 with 69 rules applied. Total rules applied 467 place count 1222 transition count 1793
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 474 place count 1222 transition count 1786
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 474 place count 1222 transition count 1785
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 476 place count 1221 transition count 1785
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 488 place count 1209 transition count 1773
Iterating global reduction 3 with 12 rules applied. Total rules applied 500 place count 1209 transition count 1773
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 511 place count 1209 transition count 1762
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 1 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 4 with 272 rules applied. Total rules applied 783 place count 1073 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 785 place count 1071 transition count 1624
Iterating global reduction 4 with 2 rules applied. Total rules applied 787 place count 1071 transition count 1624
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 789 place count 1071 transition count 1622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 791 place count 1070 transition count 1622
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 5 with 23 rules applied. Total rules applied 814 place count 1070 transition count 1599
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 816 place count 1068 transition count 1597
Applied a total of 816 rules in 608 ms. Remains 1068 /1562 variables (removed 494) and now considering 1597/2134 (removed 537) transitions.
[2024-05-23 21:49:28] [INFO ] Flow matrix only has 1555 transitions (discarded 42 similar events)
// Phase 1: matrix 1555 rows 1068 cols
[2024-05-23 21:49:28] [INFO ] Computed 24 invariants in 37 ms
[2024-05-23 21:49:28] [INFO ] Implicit Places using invariants in 598 ms returned []
[2024-05-23 21:49:28] [INFO ] Flow matrix only has 1555 transitions (discarded 42 similar events)
[2024-05-23 21:49:28] [INFO ] Invariant cache hit.
[2024-05-23 21:49:29] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1794 ms to find 0 implicit places.
[2024-05-23 21:49:29] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-23 21:49:29] [INFO ] Flow matrix only has 1555 transitions (discarded 42 similar events)
[2024-05-23 21:49:29] [INFO ] Invariant cache hit.
[2024-05-23 21:49:30] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1068/1562 places, 1597/2134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3048 ms. Remains : 1068/1562 places, 1597/2134 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s198 1) (EQ s319 1) (EQ s851 1)), p0:(EQ s54 1), p2:(OR (EQ s58 0) (EQ s453 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 33409 reset in 3595 ms.
Product exploration explored 100000 steps with 33282 reset in 3687 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 (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 163 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 344 resets, run finished after 636 ms. (steps per millisecond=15 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) 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 6) 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 6) 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 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-23 21:49:39] [INFO ] Flow matrix only has 1555 transitions (discarded 42 similar events)
[2024-05-23 21:49:39] [INFO ] Invariant cache hit.
[2024-05-23 21:49:39] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 21:49:40] [INFO ] [Nat]Absence check using 24 positive place invariants in 9 ms returned sat
[2024-05-23 21:49:40] [INFO ] After 669ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 21:49:41] [INFO ] After 1063ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 238 ms.
[2024-05-23 21:49:41] [INFO ] After 1568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 1068 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1068/1068 places, 1597/1597 transitions.
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 1068 transition count 1554
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 65 place count 1046 transition count 1532
Iterating global reduction 1 with 22 rules applied. Total rules applied 87 place count 1046 transition count 1532
Free-agglomeration rule applied 904 times.
Iterating global reduction 1 with 904 rules applied. Total rules applied 991 place count 1046 transition count 628
Reduce places removed 905 places and 0 transitions.
Drop transitions removed 380 transitions
Reduce isomorphic transitions removed 380 transitions.
Graph (trivial) has 111 edges and 141 vertex of which 40 / 141 are part of one of the 20 SCC in 1 ms
Free SCC test removed 20 places
Iterating post reduction 1 with 1286 rules applied. Total rules applied 2277 place count 121 transition count 248
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 2317 place count 121 transition count 208
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 2317 place count 121 transition count 186
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 2361 place count 99 transition count 186
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 2383 place count 99 transition count 164
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 2435 place count 73 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2436 place count 73 transition count 137
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 2457 place count 73 transition count 116
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2457 place count 73 transition count 115
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 2459 place count 72 transition count 115
Free-agglomeration rule applied 20 times.
Iterating global reduction 5 with 20 rules applied. Total rules applied 2479 place count 72 transition count 95
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 73 rules applied. Total rules applied 2552 place count 35 transition count 59
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 2568 place count 19 transition count 43
Iterating global reduction 6 with 16 rules applied. Total rules applied 2584 place count 19 transition count 43
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 2600 place count 19 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 2602 place count 19 transition count 25
Applied a total of 2602 rules in 243 ms. Remains 19 /1068 variables (removed 1049) and now considering 25/1597 (removed 1572) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 19/1068 places, 25/1597 transitions.
Finished random walk after 527 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=263 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 468 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1597/1597 transitions.
Applied a total of 0 rules in 127 ms. Remains 1068 /1068 variables (removed 0) and now considering 1597/1597 (removed 0) transitions.
[2024-05-23 21:49:42] [INFO ] Flow matrix only has 1555 transitions (discarded 42 similar events)
[2024-05-23 21:49:42] [INFO ] Invariant cache hit.
[2024-05-23 21:49:43] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-05-23 21:49:43] [INFO ] Flow matrix only has 1555 transitions (discarded 42 similar events)
[2024-05-23 21:49:43] [INFO ] Invariant cache hit.
[2024-05-23 21:49:44] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
[2024-05-23 21:49:44] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-23 21:49:44] [INFO ] Flow matrix only has 1555 transitions (discarded 42 similar events)
[2024-05-23 21:49:44] [INFO ] Invariant cache hit.
[2024-05-23 21:49:45] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2690 ms. Remains : 1068/1068 places, 1597/1597 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 152 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 343 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) 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 6) 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 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-23 21:49:46] [INFO ] Flow matrix only has 1555 transitions (discarded 42 similar events)
[2024-05-23 21:49:46] [INFO ] Invariant cache hit.
[2024-05-23 21:49:47] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 21:49:47] [INFO ] [Nat]Absence check using 24 positive place invariants in 11 ms returned sat
[2024-05-23 21:49:47] [INFO ] After 680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 21:49:48] [INFO ] After 1075ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 235 ms.
[2024-05-23 21:49:48] [INFO ] After 1572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 6 out of 1068 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1068/1068 places, 1597/1597 transitions.
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 1068 transition count 1554
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 65 place count 1046 transition count 1532
Iterating global reduction 1 with 22 rules applied. Total rules applied 87 place count 1046 transition count 1532
Free-agglomeration rule applied 904 times.
Iterating global reduction 1 with 904 rules applied. Total rules applied 991 place count 1046 transition count 628
Reduce places removed 905 places and 0 transitions.
Drop transitions removed 380 transitions
Reduce isomorphic transitions removed 380 transitions.
Graph (trivial) has 111 edges and 141 vertex of which 40 / 141 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Iterating post reduction 1 with 1286 rules applied. Total rules applied 2277 place count 121 transition count 248
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 2317 place count 121 transition count 208
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 2317 place count 121 transition count 186
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 2361 place count 99 transition count 186
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 2383 place count 99 transition count 164
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 2435 place count 73 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2436 place count 73 transition count 137
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 2457 place count 73 transition count 116
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2457 place count 73 transition count 115
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 2459 place count 72 transition count 115
Free-agglomeration rule applied 20 times.
Iterating global reduction 5 with 20 rules applied. Total rules applied 2479 place count 72 transition count 95
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 73 rules applied. Total rules applied 2552 place count 35 transition count 59
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 2568 place count 19 transition count 43
Iterating global reduction 6 with 16 rules applied. Total rules applied 2584 place count 19 transition count 43
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 2600 place count 19 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 2602 place count 19 transition count 25
Applied a total of 2602 rules in 180 ms. Remains 19 /1068 variables (removed 1049) and now considering 25/1597 (removed 1572) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 19/1068 places, 25/1597 transitions.
Finished random walk after 498 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=166 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 473 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33205 reset in 3652 ms.
Product exploration explored 100000 steps with 33387 reset in 3662 ms.
Built C files in :
/tmp/ltsmin13902637877846324380
[2024-05-23 21:49:57] [INFO ] Too many transitions (1597) to apply POR reductions. Disabling POR matrices.
[2024-05-23 21:49:57] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13902637877846324380
Running compilation step : cd /tmp/ltsmin13902637877846324380;'/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 2954 ms.
Running link step : cd /tmp/ltsmin13902637877846324380;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13902637877846324380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16947289977239994662.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1597/1597 transitions.
Applied a total of 0 rules in 118 ms. Remains 1068 /1068 variables (removed 0) and now considering 1597/1597 (removed 0) transitions.
[2024-05-23 21:50:12] [INFO ] Flow matrix only has 1555 transitions (discarded 42 similar events)
[2024-05-23 21:50:12] [INFO ] Invariant cache hit.
[2024-05-23 21:50:12] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-05-23 21:50:12] [INFO ] Flow matrix only has 1555 transitions (discarded 42 similar events)
[2024-05-23 21:50:12] [INFO ] Invariant cache hit.
[2024-05-23 21:50:13] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
[2024-05-23 21:50:13] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-23 21:50:13] [INFO ] Flow matrix only has 1555 transitions (discarded 42 similar events)
[2024-05-23 21:50:14] [INFO ] Invariant cache hit.
[2024-05-23 21:50:14] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2548 ms. Remains : 1068/1068 places, 1597/1597 transitions.
Built C files in :
/tmp/ltsmin7700221924458221496
[2024-05-23 21:50:14] [INFO ] Too many transitions (1597) to apply POR reductions. Disabling POR matrices.
[2024-05-23 21:50:14] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7700221924458221496
Running compilation step : cd /tmp/ltsmin7700221924458221496;'/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/ltsmin7700221924458221496;'/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/ltsmin7700221924458221496;'/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:50:17] [INFO ] Flatten gal took : 37 ms
[2024-05-23 21:50:17] [INFO ] Flatten gal took : 37 ms
[2024-05-23 21:50:17] [INFO ] Time to serialize gal into /tmp/LTL4546776791012189386.gal : 6 ms
[2024-05-23 21:50:17] [INFO ] Time to serialize properties into /tmp/LTL2253093676231927719.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/LTL4546776791012189386.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16697253468853222270.hoa' '-atoms' '/tmp/LTL2253093676231927719.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/LTL2253093676231927719.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16697253468853222270.hoa
Detected timeout of ITS tools.
[2024-05-23 21:50:32] [INFO ] Flatten gal took : 44 ms
[2024-05-23 21:50:32] [INFO ] Flatten gal took : 34 ms
[2024-05-23 21:50:32] [INFO ] Time to serialize gal into /tmp/LTL2401972840981092392.gal : 6 ms
[2024-05-23 21:50:32] [INFO ] Time to serialize properties into /tmp/LTL4897493853071556359.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/LTL2401972840981092392.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4897493853071556359.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((F("(p400==1)"))U(G("(((p1390==1)&&(p2289==1))&&(p5389==1))")))||(G(F("((p484==0)||(p3149==0))")))))
Formula 0 simplified : (G!"(p400==1)" R F!"(((p1390==1)&&(p2289==1))&&(p5389==1))") & FG!"((p484==0)||(p3149==0))"
Detected timeout of ITS tools.
[2024-05-23 21:50:47] [INFO ] Flatten gal took : 38 ms
[2024-05-23 21:50:47] [INFO ] Applying decomposition
[2024-05-23 21:50:48] [INFO ] Flatten gal took : 35 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/graph11835914584777904157.txt' '-o' '/tmp/graph11835914584777904157.bin' '-w' '/tmp/graph11835914584777904157.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11835914584777904157.bin' '-l' '-1' '-v' '-w' '/tmp/graph11835914584777904157.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:50:48] [INFO ] Decomposing Gal with order
[2024-05-23 21:50:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:50:48] [INFO ] Removed a total of 621 redundant transitions.
[2024-05-23 21:50:48] [INFO ] Flatten gal took : 144 ms
[2024-05-23 21:50:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 9 ms.
[2024-05-23 21:50:48] [INFO ] Time to serialize gal into /tmp/LTL1024433686019099859.gal : 24 ms
[2024-05-23 21:50:48] [INFO ] Time to serialize properties into /tmp/LTL4557210703863639998.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/LTL1024433686019099859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4557210703863639998.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((F("(i1.u5.p400==1)"))U(G("(((u22.p1390==1)&&(i11.u37.p2289==1))&&(u69.p5389==1))")))||(G(F("((i2.u7.p484==0)||(i15.u49.p3149==0))...161
Formula 0 simplified : (G!"(i1.u5.p400==1)" R F!"(((u22.p1390==1)&&(i11.u37.p2289==1))&&(u69.p5389==1))") & FG!"((i2.u7.p484==0)||(i15.u49.p3149==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1665994958180030345
[2024-05-23 21:51:03] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1665994958180030345
Running compilation step : cd /tmp/ltsmin1665994958180030345;'/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 2703 ms.
Running link step : cd /tmp/ltsmin1665994958180030345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1665994958180030345;'/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)))||[](<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-11 finished in 111140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||F((p1&&X(p2)))))'
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1535 transition count 2107
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1535 transition count 2107
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 62 place count 1535 transition count 2099
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 80 place count 1517 transition count 2081
Iterating global reduction 1 with 18 rules applied. Total rules applied 98 place count 1517 transition count 2081
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 106 place count 1517 transition count 2073
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 1511 transition count 2067
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 1511 transition count 2067
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 121 place count 1511 transition count 2064
Applied a total of 121 rules in 179 ms. Remains 1511 /1562 variables (removed 51) and now considering 2064/2134 (removed 70) transitions.
// Phase 1: matrix 2064 rows 1511 cols
[2024-05-23 21:51:18] [INFO ] Computed 24 invariants in 43 ms
[2024-05-23 21:51:19] [INFO ] Implicit Places using invariants in 649 ms returned []
[2024-05-23 21:51:19] [INFO ] Invariant cache hit.
[2024-05-23 21:51:21] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 2255 ms to find 0 implicit places.
[2024-05-23 21:51:21] [INFO ] Invariant cache hit.
[2024-05-23 21:51:21] [INFO ] Dead Transitions using invariants and state equation in 848 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1511/1562 places, 2064/2134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3286 ms. Remains : 1511/1562 places, 2064/2134 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 2}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}, { cond=p1, acceptance={} source=6 dest: 4}]], initial=5, aps=[p1:(EQ s358 0), p2:(EQ s123 1), p0:(EQ s736 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-12 finished in 3617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((G(p2)||p1)))))'
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1534 transition count 2106
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1534 transition count 2106
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 63 place count 1534 transition count 2099
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 83 place count 1514 transition count 2079
Iterating global reduction 1 with 20 rules applied. Total rules applied 103 place count 1514 transition count 2079
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 113 place count 1514 transition count 2069
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 119 place count 1508 transition count 2063
Iterating global reduction 2 with 6 rules applied. Total rules applied 125 place count 1508 transition count 2063
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 128 place count 1508 transition count 2060
Applied a total of 128 rules in 174 ms. Remains 1508 /1562 variables (removed 54) and now considering 2060/2134 (removed 74) transitions.
// Phase 1: matrix 2060 rows 1508 cols
[2024-05-23 21:51:22] [INFO ] Computed 24 invariants in 38 ms
[2024-05-23 21:51:23] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-05-23 21:51:23] [INFO ] Invariant cache hit.
[2024-05-23 21:51:24] [INFO ] Implicit Places using invariants and state equation in 1603 ms returned []
Implicit Place search using SMT with State Equation took 2266 ms to find 0 implicit places.
[2024-05-23 21:51:24] [INFO ] Invariant cache hit.
[2024-05-23 21:51:25] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1562 places, 2060/2134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3244 ms. Remains : 1508/1562 places, 2060/2134 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s1112 0), p1:(OR (EQ s752 0) (EQ s1009 0) (EQ s1380 0)), p2:(EQ s1112 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 675 reset in 285 ms.
Product exploration explored 100000 steps with 675 reset in 303 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) p2))), (X (AND p0 p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 137 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-23 21:51:26] [INFO ] Invariant cache hit.
[2024-05-23 21:51:27] [INFO ] [Real]Absence check using 24 positive place invariants in 18 ms returned sat
[2024-05-23 21:51:27] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 21:51:27] [INFO ] [Nat]Absence check using 24 positive place invariants in 18 ms returned sat
[2024-05-23 21:51:28] [INFO ] After 779ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-23 21:51:28] [INFO ] After 1085ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 174 ms.
[2024-05-23 21:51:28] [INFO ] After 1593ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 99 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=14 )
Parikh walk visited 2 properties in 8 ms.
Support contains 4 out of 1508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1508/1508 places, 2060/2060 transitions.
Graph (trivial) has 1436 edges and 1508 vertex of which 133 / 1508 are part of one of the 22 SCC in 1 ms
Free SCC test removed 111 places
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 1397 transition count 1818
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 217 place count 1289 transition count 1818
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 217 place count 1289 transition count 1772
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 309 place count 1243 transition count 1772
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 352 place count 1200 transition count 1729
Iterating global reduction 2 with 43 rules applied. Total rules applied 395 place count 1200 transition count 1729
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 1 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 667 place count 1064 transition count 1593
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 711 place count 1064 transition count 1549
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 733 place count 1042 transition count 1527
Iterating global reduction 3 with 22 rules applied. Total rules applied 755 place count 1042 transition count 1527
Free-agglomeration rule applied 925 times.
Iterating global reduction 3 with 925 rules applied. Total rules applied 1680 place count 1042 transition count 602
Reduce places removed 925 places and 0 transitions.
Drop transitions removed 420 transitions
Reduce isomorphic transitions removed 420 transitions.
Iterating post reduction 3 with 1345 rules applied. Total rules applied 3025 place count 117 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3026 place count 116 transition count 181
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 110 edges and 115 vertex of which 44 / 115 are part of one of the 22 SCC in 1 ms
Free SCC test removed 22 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 3028 place count 93 transition count 181
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 5 with 44 rules applied. Total rules applied 3072 place count 93 transition count 137
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 3072 place count 93 transition count 115
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 3116 place count 71 transition count 115
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 3138 place count 71 transition count 93
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 3182 place count 49 transition count 71
Free-agglomeration rule applied 22 times.
Iterating global reduction 7 with 22 rules applied. Total rules applied 3204 place count 49 transition count 49
Reduce places removed 42 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 7 with 83 rules applied. Total rules applied 3287 place count 7 transition count 8
Applied a total of 3287 rules in 328 ms. Remains 7 /1508 variables (removed 1501) and now considering 8/2060 (removed 2052) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 7/1508 places, 8/2060 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) p2))), (X (AND p0 p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F p2)]
Knowledge based reduction with 13 factoid took 354 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 2060/2060 transitions.
Applied a total of 0 rules in 44 ms. Remains 1508 /1508 variables (removed 0) and now considering 2060/2060 (removed 0) transitions.
[2024-05-23 21:51:29] [INFO ] Invariant cache hit.
[2024-05-23 21:51:30] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-23 21:51:30] [INFO ] Invariant cache hit.
[2024-05-23 21:51:31] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 2182 ms to find 0 implicit places.
[2024-05-23 21:51:31] [INFO ] Invariant cache hit.
[2024-05-23 21:51:32] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3065 ms. Remains : 1508/1508 places, 2060/2060 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) p2))), (X (AND p0 p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 115 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-23 21:51:33] [INFO ] Invariant cache hit.
[2024-05-23 21:51:33] [INFO ] [Real]Absence check using 24 positive place invariants in 17 ms returned sat
[2024-05-23 21:51:33] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 21:51:33] [INFO ] [Nat]Absence check using 24 positive place invariants in 14 ms returned sat
[2024-05-23 21:51:34] [INFO ] After 765ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-23 21:51:35] [INFO ] After 1072ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 165 ms.
[2024-05-23 21:51:35] [INFO ] After 1557ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 99 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=49 )
Parikh walk visited 2 properties in 3 ms.
Support contains 4 out of 1508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1508/1508 places, 2060/2060 transitions.
Graph (trivial) has 1436 edges and 1508 vertex of which 133 / 1508 are part of one of the 22 SCC in 0 ms
Free SCC test removed 111 places
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 1397 transition count 1818
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 217 place count 1289 transition count 1818
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 217 place count 1289 transition count 1772
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 309 place count 1243 transition count 1772
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 352 place count 1200 transition count 1729
Iterating global reduction 2 with 43 rules applied. Total rules applied 395 place count 1200 transition count 1729
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 667 place count 1064 transition count 1593
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 711 place count 1064 transition count 1549
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 733 place count 1042 transition count 1527
Iterating global reduction 3 with 22 rules applied. Total rules applied 755 place count 1042 transition count 1527
Free-agglomeration rule applied 925 times.
Iterating global reduction 3 with 925 rules applied. Total rules applied 1680 place count 1042 transition count 602
Reduce places removed 925 places and 0 transitions.
Drop transitions removed 420 transitions
Reduce isomorphic transitions removed 420 transitions.
Iterating post reduction 3 with 1345 rules applied. Total rules applied 3025 place count 117 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3026 place count 116 transition count 181
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 110 edges and 115 vertex of which 44 / 115 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 3028 place count 93 transition count 181
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 5 with 44 rules applied. Total rules applied 3072 place count 93 transition count 137
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 3072 place count 93 transition count 115
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 3116 place count 71 transition count 115
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 3138 place count 71 transition count 93
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 3182 place count 49 transition count 71
Free-agglomeration rule applied 22 times.
Iterating global reduction 7 with 22 rules applied. Total rules applied 3204 place count 49 transition count 49
Reduce places removed 42 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 7 with 83 rules applied. Total rules applied 3287 place count 7 transition count 8
Applied a total of 3287 rules in 317 ms. Remains 7 /1508 variables (removed 1501) and now considering 8/2060 (removed 2052) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 317 ms. Remains : 7/1508 places, 8/2060 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) p2))), (X (AND p0 p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F p2)]
Knowledge based reduction with 13 factoid took 354 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 673 reset in 317 ms.
Product exploration explored 100000 steps with 674 reset in 302 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 1508 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1508/1508 places, 2060/2060 transitions.
Graph (trivial) has 1436 edges and 1508 vertex of which 133 / 1508 are part of one of the 22 SCC in 1 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 1397 transition count 1948
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 65 Pre rules applied. Total rules applied 88 place count 1397 transition count 1948
Deduced a syphon composed of 152 places in 1 ms
Iterating global reduction 1 with 65 rules applied. Total rules applied 153 place count 1397 transition count 1948
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 260 place count 1290 transition count 1841
Deduced a syphon composed of 88 places in 1 ms
Iterating global reduction 1 with 107 rules applied. Total rules applied 367 place count 1290 transition count 1841
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 204 places in 0 ms
Iterating global reduction 1 with 116 rules applied. Total rules applied 483 place count 1290 transition count 1885
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 531 place count 1242 transition count 1837
Deduced a syphon composed of 156 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 579 place count 1242 transition count 1837
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 178 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 601 place count 1242 transition count 1881
Deduced a syphon composed of 178 places in 0 ms
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 1 with 44 rules applied. Total rules applied 645 place count 1242 transition count 1837
Deduced a syphon composed of 178 places in 0 ms
Applied a total of 645 rules in 481 ms. Remains 1242 /1508 variables (removed 266) and now considering 1837/2060 (removed 223) transitions.
[2024-05-23 21:51:37] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-23 21:51:37] [INFO ] Flow matrix only has 1794 transitions (discarded 43 similar events)
// Phase 1: matrix 1794 rows 1242 cols
[2024-05-23 21:51:37] [INFO ] Computed 24 invariants in 47 ms
[2024-05-23 21:51:38] [INFO ] Dead Transitions using invariants and state equation in 779 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1242/1508 places, 1837/2060 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1298 ms. Remains : 1242/1508 places, 1837/2060 transitions.
Built C files in :
/tmp/ltsmin2212266466113206752
[2024-05-23 21:51:38] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2212266466113206752
Running compilation step : cd /tmp/ltsmin2212266466113206752;'/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/ltsmin2212266466113206752;'/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/ltsmin2212266466113206752;'/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 4 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 2060/2060 transitions.
Applied a total of 0 rules in 44 ms. Remains 1508 /1508 variables (removed 0) and now considering 2060/2060 (removed 0) transitions.
// Phase 1: matrix 2060 rows 1508 cols
[2024-05-23 21:51:41] [INFO ] Computed 24 invariants in 42 ms
[2024-05-23 21:51:42] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-05-23 21:51:42] [INFO ] Invariant cache hit.
[2024-05-23 21:51:43] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 2170 ms to find 0 implicit places.
[2024-05-23 21:51:43] [INFO ] Invariant cache hit.
[2024-05-23 21:51:44] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3066 ms. Remains : 1508/1508 places, 2060/2060 transitions.
Built C files in :
/tmp/ltsmin16805071385969357051
[2024-05-23 21:51:44] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16805071385969357051
Running compilation step : cd /tmp/ltsmin16805071385969357051;'/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/ltsmin16805071385969357051;'/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/ltsmin16805071385969357051;'/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:51:47] [INFO ] Flatten gal took : 37 ms
[2024-05-23 21:51:47] [INFO ] Flatten gal took : 37 ms
[2024-05-23 21:51:47] [INFO ] Time to serialize gal into /tmp/LTL17625202270786940142.gal : 7 ms
[2024-05-23 21:51:47] [INFO ] Time to serialize properties into /tmp/LTL11377823689817681517.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/LTL17625202270786940142.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2497641086672151417.hoa' '-atoms' '/tmp/LTL11377823689817681517.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/LTL11377823689817681517.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2497641086672151417.hoa
Detected timeout of ITS tools.
[2024-05-23 21:52:02] [INFO ] Flatten gal took : 44 ms
[2024-05-23 21:52:02] [INFO ] Flatten gal took : 41 ms
[2024-05-23 21:52:02] [INFO ] Time to serialize gal into /tmp/LTL15983582120452527062.gal : 9 ms
[2024-05-23 21:52:02] [INFO ] Time to serialize properties into /tmp/LTL16065510504125928667.ltl : 6 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/LTL15983582120452527062.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16065510504125928667.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(p4518==0)")||(X(("((p3123==0)||(p4134==0))")||(("(p5854==0)")||(G("(p4518==1)"))))))))
Formula 0 simplified : F(!"(p4518==0)" & X(!"((p3123==0)||(p4134==0))" & !"(p5854==0)" & F!"(p4518==1)"))
Detected timeout of ITS tools.
[2024-05-23 21:52:17] [INFO ] Flatten gal took : 37 ms
[2024-05-23 21:52:17] [INFO ] Applying decomposition
[2024-05-23 21:52:17] [INFO ] Flatten gal took : 38 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/graph12436624392678502933.txt' '-o' '/tmp/graph12436624392678502933.bin' '-w' '/tmp/graph12436624392678502933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12436624392678502933.bin' '-l' '-1' '-v' '-w' '/tmp/graph12436624392678502933.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:52:18] [INFO ] Decomposing Gal with order
[2024-05-23 21:52:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:52:18] [INFO ] Removed a total of 616 redundant transitions.
[2024-05-23 21:52:18] [INFO ] Flatten gal took : 164 ms
[2024-05-23 21:52:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 14 ms.
[2024-05-23 21:52:18] [INFO ] Time to serialize gal into /tmp/LTL8497879736735280247.gal : 15 ms
[2024-05-23 21:52:18] [INFO ] Time to serialize properties into /tmp/LTL9068207481809882499.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/LTL8497879736735280247.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9068207481809882499.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("(u240.p4518==0)")||(X(("((i15.u178.p3123==0)||(i20.u221.p4134==0))")||(("(u240.p5854==0)")||(G("(u240.p4518==1)"))))))))
Formula 0 simplified : F(!"(u240.p4518==0)" & X(!"((i15.u178.p3123==0)||(i20.u221.p4134==0))" & !"(u240.p5854==0)" & F!"(u240.p4518==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11848396487695140156
[2024-05-23 21:52:33] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11848396487695140156
Running compilation step : cd /tmp/ltsmin11848396487695140156;'/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/ltsmin11848396487695140156;'/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/ltsmin11848396487695140156;'/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-22b-LTLFireability-13 finished in 74396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1&&F(p2)))))'
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1535 transition count 2107
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1535 transition count 2107
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 62 place count 1535 transition count 2099
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 80 place count 1517 transition count 2081
Iterating global reduction 1 with 18 rules applied. Total rules applied 98 place count 1517 transition count 2081
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 108 place count 1517 transition count 2071
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 113 place count 1512 transition count 2066
Iterating global reduction 2 with 5 rules applied. Total rules applied 118 place count 1512 transition count 2066
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 121 place count 1512 transition count 2063
Applied a total of 121 rules in 179 ms. Remains 1512 /1562 variables (removed 50) and now considering 2063/2134 (removed 71) transitions.
// Phase 1: matrix 2063 rows 1512 cols
[2024-05-23 21:52:36] [INFO ] Computed 24 invariants in 44 ms
[2024-05-23 21:52:37] [INFO ] Implicit Places using invariants in 663 ms returned []
[2024-05-23 21:52:37] [INFO ] Invariant cache hit.
[2024-05-23 21:52:38] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 2198 ms to find 0 implicit places.
[2024-05-23 21:52:38] [INFO ] Invariant cache hit.
[2024-05-23 21:52:39] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1512/1562 places, 2063/2134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3249 ms. Remains : 1512/1562 places, 2063/2134 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s1166 1), p0:(NEQ s1128 1), p2:(EQ s1411 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 156 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-14 finished in 3396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(p1)))'
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1534 transition count 2106
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1534 transition count 2106
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 63 place count 1534 transition count 2099
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 83 place count 1514 transition count 2079
Iterating global reduction 1 with 20 rules applied. Total rules applied 103 place count 1514 transition count 2079
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 113 place count 1514 transition count 2069
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 119 place count 1508 transition count 2063
Iterating global reduction 2 with 6 rules applied. Total rules applied 125 place count 1508 transition count 2063
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 128 place count 1508 transition count 2060
Applied a total of 128 rules in 180 ms. Remains 1508 /1562 variables (removed 54) and now considering 2060/2134 (removed 74) transitions.
// Phase 1: matrix 2060 rows 1508 cols
[2024-05-23 21:52:40] [INFO ] Computed 24 invariants in 37 ms
[2024-05-23 21:52:40] [INFO ] Implicit Places using invariants in 663 ms returned []
[2024-05-23 21:52:40] [INFO ] Invariant cache hit.
[2024-05-23 21:52:42] [INFO ] Implicit Places using invariants and state equation in 1473 ms returned []
Implicit Place search using SMT with State Equation took 2157 ms to find 0 implicit places.
[2024-05-23 21:52:42] [INFO ] Invariant cache hit.
[2024-05-23 21:52:43] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1562 places, 2060/2134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3240 ms. Remains : 1508/1562 places, 2060/2134 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s67 1) (EQ s734 1) (EQ s1361 1)), p0:(EQ s1131 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 137 steps with 1 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-15 finished in 3365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p0&&G((F(p1)&&F(G(!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' '!(F(G((p0||X(p1)))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-22b-LTLFireability-04
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Graph (trivial) has 1490 edges and 1562 vertex of which 133 / 1562 are part of one of the 22 SCC in 0 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 1450 transition count 1907
Reduce places removed 114 places and 0 transitions.
Iterating post reduction 1 with 114 rules applied. Total rules applied 229 place count 1336 transition count 1907
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 229 place count 1336 transition count 1857
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 329 place count 1286 transition count 1857
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 400 place count 1215 transition count 1786
Iterating global reduction 2 with 71 rules applied. Total rules applied 471 place count 1215 transition count 1786
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 479 place count 1215 transition count 1778
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 479 place count 1215 transition count 1777
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 481 place count 1214 transition count 1777
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 493 place count 1202 transition count 1765
Iterating global reduction 3 with 12 rules applied. Total rules applied 505 place count 1202 transition count 1765
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 516 place count 1202 transition count 1754
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 1 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 4 with 266 rules applied. Total rules applied 782 place count 1069 transition count 1621
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 784 place count 1067 transition count 1619
Iterating global reduction 4 with 2 rules applied. Total rules applied 786 place count 1067 transition count 1619
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 788 place count 1067 transition count 1617
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 810 place count 1067 transition count 1595
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 812 place count 1065 transition count 1593
Applied a total of 812 rules in 353 ms. Remains 1065 /1562 variables (removed 497) and now considering 1593/2134 (removed 541) transitions.
[2024-05-23 21:52:43] [INFO ] Flow matrix only has 1550 transitions (discarded 43 similar events)
// Phase 1: matrix 1550 rows 1065 cols
[2024-05-23 21:52:43] [INFO ] Computed 24 invariants in 39 ms
[2024-05-23 21:52:44] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-05-23 21:52:44] [INFO ] Flow matrix only has 1550 transitions (discarded 43 similar events)
[2024-05-23 21:52:44] [INFO ] Invariant cache hit.
[2024-05-23 21:52:45] [INFO ] Implicit Places using invariants and state equation in 1259 ms returned []
Implicit Place search using SMT with State Equation took 1858 ms to find 0 implicit places.
[2024-05-23 21:52:45] [INFO ] Flow matrix only has 1550 transitions (discarded 43 similar events)
[2024-05-23 21:52:45] [INFO ] Invariant cache hit.
[2024-05-23 21:52:46] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1065/1562 places, 1593/2134 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2852 ms. Remains : 1065/1562 places, 1593/2134 transitions.
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s250 0), p1:(EQ s56 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1758 steps with 60 reset in 30 ms.
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-04 finished in 3049 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)||X(G(p2))))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-22b-LTLFireability-08
Stuttering acceptance computed with spot in 196 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Graph (trivial) has 1467 edges and 1562 vertex of which 127 / 1562 are part of one of the 21 SCC in 1 ms
Free SCC test removed 106 places
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 1455 transition count 1910
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 233 place count 1339 transition count 1910
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 233 place count 1339 transition count 1858
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 337 place count 1287 transition count 1858
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 408 place count 1216 transition count 1787
Iterating global reduction 2 with 71 rules applied. Total rules applied 479 place count 1216 transition count 1787
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 487 place count 1216 transition count 1779
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 487 place count 1216 transition count 1778
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 489 place count 1215 transition count 1778
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 501 place count 1203 transition count 1766
Iterating global reduction 3 with 12 rules applied. Total rules applied 513 place count 1203 transition count 1766
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 525 place count 1203 transition count 1754
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 4 with 268 rules applied. Total rules applied 793 place count 1069 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 795 place count 1067 transition count 1618
Iterating global reduction 4 with 2 rules applied. Total rules applied 797 place count 1067 transition count 1618
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 799 place count 1067 transition count 1616
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 801 place count 1066 transition count 1616
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 5 with 23 rules applied. Total rules applied 824 place count 1066 transition count 1593
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 826 place count 1064 transition count 1591
Applied a total of 826 rules in 375 ms. Remains 1064 /1562 variables (removed 498) and now considering 1591/2134 (removed 543) transitions.
[2024-05-23 21:52:47] [INFO ] Flow matrix only has 1550 transitions (discarded 41 similar events)
// Phase 1: matrix 1550 rows 1064 cols
[2024-05-23 21:52:47] [INFO ] Computed 24 invariants in 39 ms
[2024-05-23 21:52:47] [INFO ] Implicit Places using invariants in 726 ms returned []
[2024-05-23 21:52:47] [INFO ] Flow matrix only has 1550 transitions (discarded 41 similar events)
[2024-05-23 21:52:47] [INFO ] Invariant cache hit.
[2024-05-23 21:52:49] [INFO ] Implicit Places using invariants and state equation in 1239 ms returned []
Implicit Place search using SMT with State Equation took 2003 ms to find 0 implicit places.
[2024-05-23 21:52:49] [INFO ] Flow matrix only has 1550 transitions (discarded 41 similar events)
[2024-05-23 21:52:49] [INFO ] Invariant cache hit.
[2024-05-23 21:52:49] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1064/1562 places, 1591/2134 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3001 ms. Remains : 1064/1562 places, 1591/2134 transitions.
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s504 0), p2:(EQ s337 1), p0:(EQ s21 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3391 reset in 1320 ms.
Product exploration explored 100000 steps with 3404 reset in 1328 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2))))]
Knowledge based reduction with 9 factoid took 333 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 344 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 9) seen :8
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
Running SMT prover for 1 properties.
[2024-05-23 21:52:53] [INFO ] Flow matrix only has 1550 transitions (discarded 41 similar events)
[2024-05-23 21:52:53] [INFO ] Invariant cache hit.
[2024-05-23 21:52:53] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 21:52:54] [INFO ] [Nat]Absence check using 24 positive place invariants in 9 ms returned sat
[2024-05-23 21:52:54] [INFO ] After 491ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 21:52:54] [INFO ] After 570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-23 21:52:54] [INFO ] After 771ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 1591/1591 transitions.
Graph (trivial) has 950 edges and 1064 vertex of which 3 / 1064 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 1041 transition count 1525
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 1041 transition count 1525
Free-agglomeration rule applied 926 times.
Iterating global reduction 0 with 926 rules applied. Total rules applied 969 place count 1041 transition count 599
Discarding 100 places :
Also discarding 501 output transitions
Drop transitions removed 501 transitions
Remove reverse transitions (loop back) rule discarded transition t470.t1614.t1414 and 100 places that fell out of Prefix Of Interest.
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (trivial) has 12 edges and 13 vertex of which 7 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 83 rules applied. Total rules applied 1052 place count 8 transition count 17
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 1062 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1065 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1066 place count 5 transition count 6
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 4 with 2 rules applied. Total rules applied 1068 place count 4 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1069 place count 4 transition count 4
Applied a total of 1069 rules in 218 ms. Remains 4 /1064 variables (removed 1060) and now considering 4/1591 (removed 1587) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 4/1064 places, 4/1591 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 p2)), (F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F p2), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 9 factoid took 623 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1591/1591 transitions.
Applied a total of 0 rules in 21 ms. Remains 1064 /1064 variables (removed 0) and now considering 1591/1591 (removed 0) transitions.
[2024-05-23 21:52:56] [INFO ] Flow matrix only has 1550 transitions (discarded 41 similar events)
[2024-05-23 21:52:56] [INFO ] Invariant cache hit.
[2024-05-23 21:52:56] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-05-23 21:52:56] [INFO ] Flow matrix only has 1550 transitions (discarded 41 similar events)
[2024-05-23 21:52:56] [INFO ] Invariant cache hit.
[2024-05-23 21:52:57] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
[2024-05-23 21:52:57] [INFO ] Flow matrix only has 1550 transitions (discarded 41 similar events)
[2024-05-23 21:52:57] [INFO ] Invariant cache hit.
[2024-05-23 21:52:58] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2546 ms. Remains : 1064/1064 places, 1591/1591 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2))))]
Knowledge based reduction with 9 factoid took 289 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 344 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 9) seen :8
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
Running SMT prover for 1 properties.
[2024-05-23 21:53:00] [INFO ] Flow matrix only has 1550 transitions (discarded 41 similar events)
[2024-05-23 21:53:00] [INFO ] Invariant cache hit.
[2024-05-23 21:53:00] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 21:53:00] [INFO ] [Nat]Absence check using 24 positive place invariants in 9 ms returned sat
[2024-05-23 21:53:00] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 21:53:00] [INFO ] After 579ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-23 21:53:00] [INFO ] After 767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 1591/1591 transitions.
Graph (trivial) has 950 edges and 1064 vertex of which 3 / 1064 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 1041 transition count 1525
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 1041 transition count 1525
Free-agglomeration rule applied 926 times.
Iterating global reduction 0 with 926 rules applied. Total rules applied 969 place count 1041 transition count 599
Discarding 100 places :
Also discarding 501 output transitions
Drop transitions removed 501 transitions
Remove reverse transitions (loop back) rule discarded transition t470.t1614.t1414 and 100 places that fell out of Prefix Of Interest.
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (trivial) has 12 edges and 13 vertex of which 7 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 83 rules applied. Total rules applied 1052 place count 8 transition count 17
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 1062 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1065 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1066 place count 5 transition count 6
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 4 with 2 rules applied. Total rules applied 1068 place count 4 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1069 place count 4 transition count 4
Applied a total of 1069 rules in 247 ms. Remains 4 /1064 variables (removed 1060) and now considering 4/1591 (removed 1587) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 4/1064 places, 4/1591 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 p2)), (F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F p2), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 9 factoid took 648 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Entered a terminal (fully accepting) state of product in 44491 steps with 1509 reset in 585 ms.
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-08 finished in 16523 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-08 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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 G(p1))||G(F(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((G(p2)||p1)))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-22b-LTLFireability-13
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1562/1562 places, 2134/2134 transitions.
Graph (trivial) has 1490 edges and 1562 vertex of which 133 / 1562 are part of one of the 22 SCC in 1 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 1450 transition count 1905
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 233 place count 1334 transition count 1905
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 233 place count 1334 transition count 1854
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 335 place count 1283 transition count 1854
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 406 place count 1212 transition count 1783
Iterating global reduction 2 with 71 rules applied. Total rules applied 477 place count 1212 transition count 1783
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 484 place count 1212 transition count 1776
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 484 place count 1212 transition count 1775
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 486 place count 1211 transition count 1775
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 497 place count 1200 transition count 1764
Iterating global reduction 3 with 11 rules applied. Total rules applied 508 place count 1200 transition count 1764
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 519 place count 1200 transition count 1753
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 4 with 266 rules applied. Total rules applied 785 place count 1067 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 787 place count 1065 transition count 1618
Iterating global reduction 4 with 2 rules applied. Total rules applied 789 place count 1065 transition count 1618
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 791 place count 1065 transition count 1616
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 813 place count 1065 transition count 1594
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 815 place count 1063 transition count 1592
Applied a total of 815 rules in 282 ms. Remains 1063 /1562 variables (removed 499) and now considering 1592/2134 (removed 542) transitions.
[2024-05-23 21:53:03] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
// Phase 1: matrix 1549 rows 1063 cols
[2024-05-23 21:53:03] [INFO ] Computed 24 invariants in 45 ms
[2024-05-23 21:53:04] [INFO ] Implicit Places using invariants in 599 ms returned []
[2024-05-23 21:53:04] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:53:04] [INFO ] Invariant cache hit.
[2024-05-23 21:53:05] [INFO ] Implicit Places using invariants and state equation in 1190 ms returned []
Implicit Place search using SMT with State Equation took 1809 ms to find 0 implicit places.
[2024-05-23 21:53:05] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:53:05] [INFO ] Invariant cache hit.
[2024-05-23 21:53:06] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1063/1562 places, 1592/2134 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2763 ms. Remains : 1063/1562 places, 1592/2134 transitions.
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s671 0), p1:(OR (EQ s440 0) (EQ s588 0) (EQ s939 0)), p2:(EQ s671 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3518 reset in 1399 ms.
Product exploration explored 100000 steps with 3511 reset in 1405 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 (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) p2))), (X (AND p0 p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 124 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 361 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 6) 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 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-23 21:53:10] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:53:10] [INFO ] Invariant cache hit.
[2024-05-23 21:53:10] [INFO ] [Real]Absence check using 24 positive place invariants in 10 ms returned sat
[2024-05-23 21:53:10] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 21:53:10] [INFO ] [Nat]Absence check using 24 positive place invariants in 13 ms returned sat
[2024-05-23 21:53:11] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-23 21:53:11] [INFO ] After 763ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 136 ms.
[2024-05-23 21:53:11] [INFO ] After 1147ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 1063 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1063/1063 places, 1592/1592 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1063 transition count 1548
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1041 transition count 1526
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1041 transition count 1526
Free-agglomeration rule applied 925 times.
Iterating global reduction 1 with 925 rules applied. Total rules applied 1013 place count 1041 transition count 601
Reduce places removed 926 places and 0 transitions.
Drop transitions removed 420 transitions
Reduce isomorphic transitions removed 420 transitions.
Graph (trivial) has 110 edges and 115 vertex of which 44 / 115 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Iterating post reduction 1 with 1347 rules applied. Total rules applied 2360 place count 93 transition count 181
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 2404 place count 93 transition count 137
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 2404 place count 93 transition count 115
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 2448 place count 71 transition count 115
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 2470 place count 71 transition count 93
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 2514 place count 49 transition count 71
Free-agglomeration rule applied 22 times.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2536 place count 49 transition count 49
Reduce places removed 42 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 4 with 83 rules applied. Total rules applied 2619 place count 7 transition count 8
Applied a total of 2619 rules in 205 ms. Remains 7 /1063 variables (removed 1056) and now considering 8/1592 (removed 1584) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 7/1063 places, 8/1592 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) p2))), (X (AND p0 p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F p2)]
Knowledge based reduction with 14 factoid took 325 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1592/1592 transitions.
Applied a total of 0 rules in 21 ms. Remains 1063 /1063 variables (removed 0) and now considering 1592/1592 (removed 0) transitions.
[2024-05-23 21:53:12] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:53:12] [INFO ] Invariant cache hit.
[2024-05-23 21:53:13] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-05-23 21:53:13] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:53:13] [INFO ] Invariant cache hit.
[2024-05-23 21:53:14] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1764 ms to find 0 implicit places.
[2024-05-23 21:53:14] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:53:14] [INFO ] Invariant cache hit.
[2024-05-23 21:53:14] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2407 ms. Remains : 1063/1063 places, 1592/1592 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p1), (X (AND p0 p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X p1)), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 99 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 358 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 4) 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 4) 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 4) seen :2
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
Running SMT prover for 2 properties.
[2024-05-23 21:53:15] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:53:15] [INFO ] Invariant cache hit.
[2024-05-23 21:53:16] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 21:53:16] [INFO ] [Nat]Absence check using 24 positive place invariants in 9 ms returned sat
[2024-05-23 21:53:16] [INFO ] After 491ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 21:53:16] [INFO ] After 643ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-05-23 21:53:17] [INFO ] After 915ms 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 4 out of 1063 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1063/1063 places, 1592/1592 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1063 transition count 1548
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1041 transition count 1526
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1041 transition count 1526
Free-agglomeration rule applied 925 times.
Iterating global reduction 1 with 925 rules applied. Total rules applied 1013 place count 1041 transition count 601
Reduce places removed 926 places and 0 transitions.
Drop transitions removed 420 transitions
Reduce isomorphic transitions removed 420 transitions.
Graph (trivial) has 110 edges and 115 vertex of which 44 / 115 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Iterating post reduction 1 with 1347 rules applied. Total rules applied 2360 place count 93 transition count 181
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 2404 place count 93 transition count 137
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 2404 place count 93 transition count 115
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 2448 place count 71 transition count 115
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 2470 place count 71 transition count 93
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 2514 place count 49 transition count 71
Free-agglomeration rule applied 22 times.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2536 place count 49 transition count 49
Reduce places removed 42 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 4 with 83 rules applied. Total rules applied 2619 place count 7 transition count 8
Applied a total of 2619 rules in 252 ms. Remains 7 /1063 variables (removed 1056) and now considering 8/1592 (removed 1584) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 7/1063 places, 8/1592 transitions.
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p1), (X (AND p0 p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X p1)), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 213 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3517 reset in 1388 ms.
Product exploration explored 100000 steps with 3519 reset in 1401 ms.
Built C files in :
/tmp/ltsmin9050816626710813905
[2024-05-23 21:53:20] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9050816626710813905
Running compilation step : cd /tmp/ltsmin9050816626710813905;'/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 2920 ms.
Running link step : cd /tmp/ltsmin9050816626710813905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9050816626710813905;'/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/stateBased2638185582293673595.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1592/1592 transitions.
Applied a total of 0 rules in 26 ms. Remains 1063 /1063 variables (removed 0) and now considering 1592/1592 (removed 0) transitions.
[2024-05-23 21:53:35] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:53:35] [INFO ] Invariant cache hit.
[2024-05-23 21:53:36] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-05-23 21:53:36] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:53:36] [INFO ] Invariant cache hit.
[2024-05-23 21:53:37] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned []
Implicit Place search using SMT with State Equation took 1778 ms to find 0 implicit places.
[2024-05-23 21:53:37] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:53:37] [INFO ] Invariant cache hit.
[2024-05-23 21:53:38] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2413 ms. Remains : 1063/1063 places, 1592/1592 transitions.
Built C files in :
/tmp/ltsmin13002574424574604888
[2024-05-23 21:53:38] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13002574424574604888
Running compilation step : cd /tmp/ltsmin13002574424574604888;'/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 2878 ms.
Running link step : cd /tmp/ltsmin13002574424574604888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13002574424574604888;'/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/stateBased11393407803066285374.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 21:53:53] [INFO ] Flatten gal took : 30 ms
[2024-05-23 21:53:53] [INFO ] Flatten gal took : 31 ms
[2024-05-23 21:53:53] [INFO ] Time to serialize gal into /tmp/LTL6315554211349474103.gal : 16 ms
[2024-05-23 21:53:53] [INFO ] Time to serialize properties into /tmp/LTL9647288383773343065.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/LTL6315554211349474103.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13799955589774164529.hoa' '-atoms' '/tmp/LTL9647288383773343065.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/LTL9647288383773343065.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13799955589774164529.hoa
Detected timeout of ITS tools.
[2024-05-23 21:54:08] [INFO ] Flatten gal took : 38 ms
[2024-05-23 21:54:08] [INFO ] Flatten gal took : 33 ms
[2024-05-23 21:54:08] [INFO ] Time to serialize gal into /tmp/LTL5334314264974045237.gal : 10 ms
[2024-05-23 21:54:08] [INFO ] Time to serialize properties into /tmp/LTL11145953687183016008.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/LTL5334314264974045237.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11145953687183016008.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(("(p4518==0)")||(X(("((p3123==0)||(p4134==0))")||(("(p5854==0)")||(G("(p4518==1)"))))))))
Formula 0 simplified : F(!"(p4518==0)" & X(!"((p3123==0)||(p4134==0))" & !"(p5854==0)" & F!"(p4518==1)"))
Detected timeout of ITS tools.
[2024-05-23 21:54:23] [INFO ] Flatten gal took : 29 ms
[2024-05-23 21:54:23] [INFO ] Applying decomposition
[2024-05-23 21:54:23] [INFO ] Flatten gal took : 28 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/graph13808910512104503112.txt' '-o' '/tmp/graph13808910512104503112.bin' '-w' '/tmp/graph13808910512104503112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13808910512104503112.bin' '-l' '-1' '-v' '-w' '/tmp/graph13808910512104503112.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:54:23] [INFO ] Decomposing Gal with order
[2024-05-23 21:54:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:54:23] [INFO ] Removed a total of 618 redundant transitions.
[2024-05-23 21:54:23] [INFO ] Flatten gal took : 187 ms
[2024-05-23 21:54:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 10 ms.
[2024-05-23 21:54:23] [INFO ] Time to serialize gal into /tmp/LTL17165586494865235862.gal : 8 ms
[2024-05-23 21:54:23] [INFO ] Time to serialize properties into /tmp/LTL4077550217934104564.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/LTL17165586494865235862.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4077550217934104564.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 : !((G(("(u66.p4518==0)")||(X(("((i15.u47.p3123==0)||(i20.u62.p4134==0))")||(("(u66.p5854==0)")||(G("(u66.p4518==1)"))))))))
Formula 0 simplified : F(!"(u66.p4518==0)" & X(!"((i15.u47.p3123==0)||(i20.u62.p4134==0))" & !"(u66.p5854==0)" & F!"(u66.p4518==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15878755779304262511
[2024-05-23 21:54:39] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15878755779304262511
Running compilation step : cd /tmp/ltsmin15878755779304262511;'/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 2920 ms.
Running link step : cd /tmp/ltsmin15878755779304262511;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15878755779304262511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(([]((LTLAPp2==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-13 finished in 110954 ms.
[2024-05-23 21:54:54] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1951749882732302815
[2024-05-23 21:54:54] [INFO ] Too many transitions (2134) to apply POR reductions. Disabling POR matrices.
[2024-05-23 21:54:54] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1951749882732302815
[2024-05-23 21:54:54] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin1951749882732302815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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:54:54] [INFO ] Flatten gal took : 44 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/graph17994531579687096830.txt' '-o' '/tmp/graph17994531579687096830.bin' '-w' '/tmp/graph17994531579687096830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17994531579687096830.bin' '-l' '-1' '-v' '-w' '/tmp/graph17994531579687096830.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:54:54] [INFO ] Decomposing Gal with order
[2024-05-23 21:54:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:54:54] [INFO ] Removed a total of 658 redundant transitions.
[2024-05-23 21:54:54] [INFO ] Flatten gal took : 185 ms
[2024-05-23 21:54:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 27 ms.
[2024-05-23 21:54:54] [INFO ] Time to serialize gal into /tmp/LTLFireability12108962678728628648.gal : 16 ms
[2024-05-23 21:54:54] [INFO ] Time to serialize properties into /tmp/LTLFireability4290286029148564271.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/LTLFireability12108962678728628648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4290286029148564271.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((X((G("(i13.u129.p2225!=1)"))||(("(i13.u129.p2225!=1)")&&(G((F("(i11.u249.p6201!=1)"))&&(F(G("(i13.u129.p2225==1)")))))))))
Formula 0 simplified : X(F!"(i13.u129.p2225!=1)" & (!"(i13.u129.p2225!=1)" | F(G!"(i11.u249.p6201!=1)" | GF!"(i13.u129.p2225==1)")))
Compilation finished in 4462 ms.
Running link step : cd /tmp/ltsmin1951749882732302815;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin1951749882732302815;'/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))||((LTLAPp0==true)&&[]((<>((LTLAPp1==true))&&<>([](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin1951749882732302815;'/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))||((LTLAPp0==true)&&[]((<>((LTLAPp1==true))&&<>([](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1951749882732302815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp7==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 22:19:03] [INFO ] Applying decomposition
[2024-05-23 22:19:03] [INFO ] Flatten gal took : 127 ms
[2024-05-23 22:19:03] [INFO ] Decomposing Gal with order
[2024-05-23 22:19:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 22:19:03] [INFO ] Removed a total of 601 redundant transitions.
[2024-05-23 22:19:03] [INFO ] Flatten gal took : 426 ms
[2024-05-23 22:19:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 2076 labels/synchronizations in 695 ms.
[2024-05-23 22:19:04] [INFO ] Time to serialize gal into /tmp/LTLFireability1551725283193341673.gal : 48 ms
[2024-05-23 22:19:04] [INFO ] Time to serialize properties into /tmp/LTLFireability18381286026358179660.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/LTLFireability1551725283193341673.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18381286026358179660.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((X((G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u33.p2225!=1)"))||(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u33.p2225!=1)")&&(G((F("(i1.u45.p620...228
Formula 0 simplified : X(F!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u33.p2225!=1)" & (!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u33.p2225!=1)" | F(G!"(i1.u45.p6201!=1)...214
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin1951749882732302815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp7==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1951749882732302815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((<>((LTLAPp8==true)) U []((LTLAPp9==true)))||[](<>((LTLAPp10==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin1951749882732302815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((<>((LTLAPp8==true)) U []((LTLAPp9==true)))||[](<>((LTLAPp10==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1951749882732302815;'/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' '[](((LTLAPp11==true)||X(([]((LTLAPp13==true))||(LTLAPp12==true)))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 136260 kB
After kill :
MemTotal: 16393232 kB
MemFree: 14103724 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-22b"
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-22b, 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-171640624900098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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