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.r109-tall-171624208400373.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 DBSingleClientW-PT-d2m10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208400373
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K 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 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 DBSingleClientW-PT-d2m10-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716329989977

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=DBSingleClientW-PT-d2m10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 22:19:51] [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-21 22:19:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:19:51] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-05-21 22:19:51] [INFO ] Transformed 4763 places.
[2024-05-21 22:19:51] [INFO ] Transformed 2478 transitions.
[2024-05-21 22:19:51] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 3580 places in 15 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 377 places :
Symmetric choice reduction at 1 with 377 rule applications. Total rules 622 place count 760 transition count 1397
Iterating global reduction 1 with 377 rules applied. Total rules applied 999 place count 760 transition count 1397
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 1044 place count 760 transition count 1352
Discarding 301 places :
Symmetric choice reduction at 2 with 301 rule applications. Total rules 1345 place count 459 transition count 1051
Iterating global reduction 2 with 301 rules applied. Total rules applied 1646 place count 459 transition count 1051
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1655 place count 459 transition count 1042
Discarding 226 places :
Symmetric choice reduction at 3 with 226 rule applications. Total rules 1881 place count 233 transition count 726
Iterating global reduction 3 with 226 rules applied. Total rules applied 2107 place count 233 transition count 726
Ensure Unique test removed 259 transitions
Reduce isomorphic transitions removed 259 transitions.
Iterating post reduction 3 with 259 rules applied. Total rules applied 2366 place count 233 transition count 467
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 2383 place count 216 transition count 437
Iterating global reduction 4 with 17 rules applied. Total rules applied 2400 place count 216 transition count 437
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 2415 place count 216 transition count 422
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2425 place count 206 transition count 412
Iterating global reduction 5 with 10 rules applied. Total rules applied 2435 place count 206 transition count 412
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2438 place count 206 transition count 409
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 2446 place count 198 transition count 401
Iterating global reduction 6 with 8 rules applied. Total rules applied 2454 place count 198 transition count 401
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2459 place count 198 transition count 396
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2461 place count 196 transition count 392
Iterating global reduction 7 with 2 rules applied. Total rules applied 2463 place count 196 transition count 392
Applied a total of 2463 rules in 179 ms. Remains 196 /1183 variables (removed 987) and now considering 392/2478 (removed 2086) transitions.
// Phase 1: matrix 392 rows 196 cols
[2024-05-21 22:19:52] [INFO ] Computed 2 invariants in 22 ms
[2024-05-21 22:19:52] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-21 22:19:52] [INFO ] Invariant cache hit.
[2024-05-21 22:19:52] [INFO ] State equation strengthened by 208 read => feed constraints.
[2024-05-21 22:19:53] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2024-05-21 22:19:53] [INFO ] Invariant cache hit.
[2024-05-21 22:19:53] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/1183 places, 392/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1210 ms. Remains : 196/1183 places, 392/2478 transitions.
Support contains 37 out of 196 places after structural reductions.
[2024-05-21 22:19:53] [INFO ] Flatten gal took : 52 ms
[2024-05-21 22:19:53] [INFO ] Flatten gal took : 26 ms
[2024-05-21 22:19:53] [INFO ] Input system was already deterministic with 392 transitions.
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 30) seen :4
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 108 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2024-05-21 22:19:54] [INFO ] Invariant cache hit.
[2024-05-21 22:19:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 22:19:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 22:19:54] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2024-05-21 22:19:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 22:19:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 22:19:56] [INFO ] After 1091ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :25
[2024-05-21 22:19:56] [INFO ] State equation strengthened by 208 read => feed constraints.
[2024-05-21 22:19:57] [INFO ] After 1442ms SMT Verify possible using 208 Read/Feed constraints in natural domain returned unsat :1 sat :25
[2024-05-21 22:19:59] [INFO ] After 3315ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :25
Attempting to minimize the solution found.
Minimization took 1201 ms.
[2024-05-21 22:20:00] [INFO ] After 5870ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :25
Fused 26 Parikh solutions to 24 different solutions.
Parikh walk visited 2 properties in 157 ms.
Support contains 29 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 392/392 transitions.
Graph (complete) has 730 edges and 196 vertex of which 195 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 195 transition count 386
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 190 transition count 365
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 190 transition count 365
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 186 transition count 361
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 186 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 186 transition count 360
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 183 transition count 355
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 183 transition count 355
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 183 transition count 351
Applied a total of 36 rules in 72 ms. Remains 183 /196 variables (removed 13) and now considering 351/392 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 183/196 places, 351/392 transitions.
Incomplete random walk after 10000 steps, including 2313 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 111 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 104 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 103 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Finished probabilistic random walk after 113886 steps, run visited all 23 properties in 897 ms. (steps per millisecond=126 )
Probabilistic random walk after 113886 steps, saw 44470 distinct states, run finished after 897 ms. (steps per millisecond=126 ) properties seen :23
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 5 stabilizing places and 31 stable transitions
Graph (complete) has 790 edges and 196 vertex of which 195 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 176 transition count 313
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 176 transition count 313
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 176 transition count 309
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 160 transition count 285
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 160 transition count 285
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 160 transition count 278
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 149 transition count 263
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 149 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 110 place count 149 transition count 258
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 119 place count 140 transition count 242
Iterating global reduction 3 with 9 rules applied. Total rules applied 128 place count 140 transition count 242
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 131 place count 140 transition count 239
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 137 place count 134 transition count 233
Iterating global reduction 4 with 6 rules applied. Total rules applied 143 place count 134 transition count 233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 152 place count 134 transition count 224
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 158 place count 128 transition count 191
Iterating global reduction 5 with 6 rules applied. Total rules applied 164 place count 128 transition count 191
Applied a total of 164 rules in 39 ms. Remains 128 /196 variables (removed 68) and now considering 191/392 (removed 201) transitions.
// Phase 1: matrix 191 rows 128 cols
[2024-05-21 22:20:02] [INFO ] Computed 2 invariants in 6 ms
[2024-05-21 22:20:03] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 22:20:03] [INFO ] Invariant cache hit.
[2024-05-21 22:20:03] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 22:20:03] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-21 22:20:03] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-21 22:20:03] [INFO ] Invariant cache hit.
[2024-05-21 22:20:03] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/196 places, 191/392 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 493 ms. Remains : 128/196 places, 191/392 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 186 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s1 1) (GEQ s94 1))) (NOT (AND (GEQ s8 1) (GEQ s53 1)))), p0:(AND (GEQ s8 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23069 reset in 278 ms.
Product exploration explored 100000 steps with 22918 reset in 217 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 469 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 971 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 982 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Finished probabilistic random walk after 20841 steps, run visited all 2 properties in 62 ms. (steps per millisecond=336 )
Probabilistic random walk after 20841 steps, saw 10331 distinct states, run finished after 63 ms. (steps per millisecond=330 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 191/191 transitions.
Applied a total of 0 rules in 13 ms. Remains 128 /128 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-21 22:20:04] [INFO ] Invariant cache hit.
[2024-05-21 22:20:04] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-21 22:20:04] [INFO ] Invariant cache hit.
[2024-05-21 22:20:05] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 22:20:05] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-05-21 22:20:05] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-21 22:20:05] [INFO ] Invariant cache hit.
[2024-05-21 22:20:05] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 507 ms. Remains : 128/128 places, 191/191 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 469 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2318 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Finished probabilistic random walk after 20841 steps, run visited all 2 properties in 232 ms. (steps per millisecond=89 )
Probabilistic random walk after 20841 steps, saw 10331 distinct states, run finished after 232 ms. (steps per millisecond=89 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22926 reset in 155 ms.
Product exploration explored 100000 steps with 22884 reset in 265 ms.
Built C files in :
/tmp/ltsmin1786109100261912014
[2024-05-21 22:20:06] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2024-05-21 22:20:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:20:06] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2024-05-21 22:20:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:20:06] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2024-05-21 22:20:06] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:20:06] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1786109100261912014
Running compilation step : cd /tmp/ltsmin1786109100261912014;'/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 483 ms.
Running link step : cd /tmp/ltsmin1786109100261912014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1786109100261912014;'/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/stateBased9730206876847441712.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 191/191 transitions.
Applied a total of 0 rules in 13 ms. Remains 128 /128 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-21 22:20:21] [INFO ] Invariant cache hit.
[2024-05-21 22:20:21] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 22:20:21] [INFO ] Invariant cache hit.
[2024-05-21 22:20:21] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 22:20:22] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-21 22:20:22] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 22:20:22] [INFO ] Invariant cache hit.
[2024-05-21 22:20:22] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 425 ms. Remains : 128/128 places, 191/191 transitions.
Built C files in :
/tmp/ltsmin12612100930103295173
[2024-05-21 22:20:22] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2024-05-21 22:20:22] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:20:22] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2024-05-21 22:20:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:20:22] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2024-05-21 22:20:22] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:20:22] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12612100930103295173
Running compilation step : cd /tmp/ltsmin12612100930103295173;'/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 385 ms.
Running link step : cd /tmp/ltsmin12612100930103295173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12612100930103295173;'/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/stateBased4707258492821666957.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:20:37] [INFO ] Flatten gal took : 12 ms
[2024-05-21 22:20:37] [INFO ] Flatten gal took : 11 ms
[2024-05-21 22:20:37] [INFO ] Time to serialize gal into /tmp/LTL15305101042399548306.gal : 2 ms
[2024-05-21 22:20:37] [INFO ] Time to serialize properties into /tmp/LTL17995480879806850044.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/LTL15305101042399548306.gal' '-t' 'CGAL' '-hoa' '/tmp/aut754751942814637552.hoa' '-atoms' '/tmp/LTL17995480879806850044.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/LTL17995480879806850044.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut754751942814637552.hoa
Detected timeout of ITS tools.
[2024-05-21 22:20:52] [INFO ] Flatten gal took : 10 ms
[2024-05-21 22:20:52] [INFO ] Flatten gal took : 10 ms
[2024-05-21 22:20:52] [INFO ] Time to serialize gal into /tmp/LTL3282480053283966089.gal : 2 ms
[2024-05-21 22:20:52] [INFO ] Time to serialize properties into /tmp/LTL15085634709223723347.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/LTL3282480053283966089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15085634709223723347.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((p213>=1)&&(l0>=1))"))U((G(!("((p213>=1)&&(l0>=1))")))||("((!((s1>=1)&&(l3083>=1)))&&(!((p213>=1)&&(l0>=1))))"))))))
Formula 0 simplified : FG("((p213>=1)&&(l0>=1))" M !"((!((s1>=1)&&(l3083>=1)))&&(!((p213>=1)&&(l0>=1))))")
Detected timeout of ITS tools.
[2024-05-21 22:21:07] [INFO ] Flatten gal took : 12 ms
[2024-05-21 22:21:07] [INFO ] Applying decomposition
[2024-05-21 22:21:07] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4151810609457821579.txt' '-o' '/tmp/graph4151810609457821579.bin' '-w' '/tmp/graph4151810609457821579.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4151810609457821579.bin' '-l' '-1' '-v' '-w' '/tmp/graph4151810609457821579.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:21:07] [INFO ] Decomposing Gal with order
[2024-05-21 22:21:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:21:07] [INFO ] Removed a total of 217 redundant transitions.
[2024-05-21 22:21:07] [INFO ] Flatten gal took : 51 ms
[2024-05-21 22:21:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 12 ms.
[2024-05-21 22:21:07] [INFO ] Time to serialize gal into /tmp/LTL1307653732379346690.gal : 3 ms
[2024-05-21 22:21:07] [INFO ] Time to serialize properties into /tmp/LTL16174626590862792512.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/LTL1307653732379346690.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16174626590862792512.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((!("((i7.u9.p213>=1)&&(i0.u2.l0>=1))"))U((G(!("((i7.u9.p213>=1)&&(i0.u2.l0>=1))")))||("((!((i3.u0.s1>=1)&&(i3.u6.l3083>=1)))&&(...197
Formula 0 simplified : FG("((i7.u9.p213>=1)&&(i0.u2.l0>=1))" M !"((!((i3.u0.s1>=1)&&(i3.u6.l3083>=1)))&&(!((i7.u9.p213>=1)&&(i0.u2.l0>=1))))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1328958538214794270
[2024-05-21 22:21:22] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1328958538214794270
Running compilation step : cd /tmp/ltsmin1328958538214794270;'/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 313 ms.
Running link step : cd /tmp/ltsmin1328958538214794270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1328958538214794270;'/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 ([](!(LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-00 finished in 95056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p1))||p0))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 178 transition count 325
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 178 transition count 325
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 178 transition count 321
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 55 place count 163 transition count 298
Iterating global reduction 1 with 15 rules applied. Total rules applied 70 place count 163 transition count 298
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 75 place count 163 transition count 293
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 85 place count 153 transition count 279
Iterating global reduction 2 with 10 rules applied. Total rules applied 95 place count 153 transition count 279
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 100 place count 153 transition count 274
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 107 place count 146 transition count 262
Iterating global reduction 3 with 7 rules applied. Total rules applied 114 place count 146 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 146 transition count 261
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 121 place count 140 transition count 255
Iterating global reduction 4 with 6 rules applied. Total rules applied 127 place count 140 transition count 255
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 136 place count 140 transition count 246
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 143 place count 133 transition count 205
Iterating global reduction 5 with 7 rules applied. Total rules applied 150 place count 133 transition count 205
Applied a total of 150 rules in 29 ms. Remains 133 /196 variables (removed 63) and now considering 205/392 (removed 187) transitions.
// Phase 1: matrix 205 rows 133 cols
[2024-05-21 22:21:37] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 22:21:38] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 22:21:38] [INFO ] Invariant cache hit.
[2024-05-21 22:21:38] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 22:21:38] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-05-21 22:21:38] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 22:21:38] [INFO ] Invariant cache hit.
[2024-05-21 22:21:38] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/196 places, 205/392 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 882 ms. Remains : 133/196 places, 205/392 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s119 1)) (AND (OR (LT s1 1) (LT s96 1)) (OR (LT s1 1) (LT s119 1)))), p1:(AND (GEQ s1 1) (GEQ s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23055 reset in 176 ms.
Product exploration explored 100000 steps with 22949 reset in 185 ms.
Computed a total of 5 stabilizing places and 20 stable transitions
Graph (complete) has 493 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20768 steps, run visited all 1 properties in 41 ms. (steps per millisecond=506 )
Probabilistic random walk after 20768 steps, saw 10275 distinct states, run finished after 41 ms. (steps per millisecond=506 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 205/205 transitions.
Applied a total of 0 rules in 9 ms. Remains 133 /133 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2024-05-21 22:21:39] [INFO ] Invariant cache hit.
[2024-05-21 22:21:39] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 22:21:39] [INFO ] Invariant cache hit.
[2024-05-21 22:21:39] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 22:21:40] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2024-05-21 22:21:40] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 22:21:40] [INFO ] Invariant cache hit.
[2024-05-21 22:21:40] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 466 ms. Remains : 133/133 places, 205/205 transitions.
Computed a total of 5 stabilizing places and 20 stable transitions
Graph (complete) has 493 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 448 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20768 steps, run visited all 1 properties in 41 ms. (steps per millisecond=506 )
Probabilistic random walk after 20768 steps, saw 10275 distinct states, run finished after 41 ms. (steps per millisecond=506 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 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))]
Product exploration explored 100000 steps with 22904 reset in 179 ms.
Product exploration explored 100000 steps with 22910 reset in 185 ms.
Built C files in :
/tmp/ltsmin12420763117289366086
[2024-05-21 22:21:41] [INFO ] Computing symmetric may disable matrix : 205 transitions.
[2024-05-21 22:21:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:21:41] [INFO ] Computing symmetric may enable matrix : 205 transitions.
[2024-05-21 22:21:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:21:41] [INFO ] Computing Do-Not-Accords matrix : 205 transitions.
[2024-05-21 22:21:41] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:21:41] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12420763117289366086
Running compilation step : cd /tmp/ltsmin12420763117289366086;'/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 413 ms.
Running link step : cd /tmp/ltsmin12420763117289366086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12420763117289366086;'/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/stateBased9925630976426944679.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 205/205 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2024-05-21 22:21:56] [INFO ] Invariant cache hit.
[2024-05-21 22:21:56] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 22:21:56] [INFO ] Invariant cache hit.
[2024-05-21 22:21:56] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 22:21:56] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-05-21 22:21:56] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 22:21:56] [INFO ] Invariant cache hit.
[2024-05-21 22:21:56] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 456 ms. Remains : 133/133 places, 205/205 transitions.
Built C files in :
/tmp/ltsmin14550438685976835047
[2024-05-21 22:21:56] [INFO ] Computing symmetric may disable matrix : 205 transitions.
[2024-05-21 22:21:56] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:21:56] [INFO ] Computing symmetric may enable matrix : 205 transitions.
[2024-05-21 22:21:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:21:56] [INFO ] Computing Do-Not-Accords matrix : 205 transitions.
[2024-05-21 22:21:56] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:21:56] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14550438685976835047
Running compilation step : cd /tmp/ltsmin14550438685976835047;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 436 ms.
Running link step : cd /tmp/ltsmin14550438685976835047;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14550438685976835047;'/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/stateBased5860665100849546080.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:22:11] [INFO ] Flatten gal took : 10 ms
[2024-05-21 22:22:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:22:11] [INFO ] Time to serialize gal into /tmp/LTL627645236813804772.gal : 1 ms
[2024-05-21 22:22:11] [INFO ] Time to serialize properties into /tmp/LTL18442893434477232770.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/LTL627645236813804772.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9915371024481707168.hoa' '-atoms' '/tmp/LTL18442893434477232770.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/LTL18442893434477232770.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9915371024481707168.hoa
Detected timeout of ITS tools.
[2024-05-21 22:22:26] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:22:26] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:22:26] [INFO ] Time to serialize gal into /tmp/LTL14575889878405750560.gal : 5 ms
[2024-05-21 22:22:26] [INFO ] Time to serialize properties into /tmp/LTL6214728717135154725.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/LTL14575889878405750560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6214728717135154725.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(((G(F("((s1>=1)&&(l3847>=1))")))||("((s1>=1)&&(l3828>=1))"))||("(((s1<1)||(l3086<1))&&((s1<1)||(l3828<1)))")))))
Formula 0 simplified : FG(!"(((s1<1)||(l3086<1))&&((s1<1)||(l3828<1)))" & !"((s1>=1)&&(l3828>=1))" & !"((s1>=1)&&(l3847>=1))")
Detected timeout of ITS tools.
[2024-05-21 22:22:42] [INFO ] Flatten gal took : 14 ms
[2024-05-21 22:22:42] [INFO ] Applying decomposition
[2024-05-21 22:22:42] [INFO ] Flatten gal took : 9 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/graph8028478413741292072.txt' '-o' '/tmp/graph8028478413741292072.bin' '-w' '/tmp/graph8028478413741292072.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8028478413741292072.bin' '-l' '-1' '-v' '-w' '/tmp/graph8028478413741292072.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:22:42] [INFO ] Decomposing Gal with order
[2024-05-21 22:22:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:22:42] [INFO ] Removed a total of 187 redundant transitions.
[2024-05-21 22:22:42] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:22:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 6 ms.
[2024-05-21 22:22:42] [INFO ] Time to serialize gal into /tmp/LTL17541050535314587061.gal : 3 ms
[2024-05-21 22:22:42] [INFO ] Time to serialize properties into /tmp/LTL13335833691396113633.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/LTL17541050535314587061.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13335833691396113633.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F(((G(F("((i3.u2.s1>=1)&&(u13.l3847>=1))")))||("((i3.u2.s1>=1)&&(u13.l3828>=1))"))||("(((i3.u2.s1<1)||(i0.u6.l3086<1))&&((i3.u2.s...182
Formula 0 simplified : FG(!"(((i3.u2.s1<1)||(i0.u6.l3086<1))&&((i3.u2.s1<1)||(u13.l3828<1)))" & !"((i3.u2.s1>=1)&&(u13.l3828>=1))" & !"((i3.u2.s1>=1)&&(u13...168
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12034666208034517011
[2024-05-21 22:22:57] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12034666208034517011
Running compilation step : cd /tmp/ltsmin12034666208034517011;'/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 323 ms.
Running link step : cd /tmp/ltsmin12034666208034517011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12034666208034517011;'/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' '[](<>(([](<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-01 finished in 94375 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(((!p1 U (p2||G(!p1)))&&p0)))))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 177 transition count 310
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 177 transition count 310
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 177 transition count 306
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 57 place count 162 transition count 283
Iterating global reduction 1 with 15 rules applied. Total rules applied 72 place count 162 transition count 283
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 77 place count 162 transition count 278
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 88 place count 151 transition count 263
Iterating global reduction 2 with 11 rules applied. Total rules applied 99 place count 151 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 104 place count 151 transition count 258
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 112 place count 143 transition count 244
Iterating global reduction 3 with 8 rules applied. Total rules applied 120 place count 143 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 122 place count 143 transition count 242
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 128 place count 137 transition count 236
Iterating global reduction 4 with 6 rules applied. Total rules applied 134 place count 137 transition count 236
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 142 place count 137 transition count 228
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 148 place count 131 transition count 192
Iterating global reduction 5 with 6 rules applied. Total rules applied 154 place count 131 transition count 192
Applied a total of 154 rules in 14 ms. Remains 131 /196 variables (removed 65) and now considering 192/392 (removed 200) transitions.
// Phase 1: matrix 192 rows 131 cols
[2024-05-21 22:23:12] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:23:12] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 22:23:12] [INFO ] Invariant cache hit.
[2024-05-21 22:23:12] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 22:23:12] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-21 22:23:12] [INFO ] Invariant cache hit.
[2024-05-21 22:23:12] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/196 places, 192/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 474 ms. Remains : 131/196 places, 192/392 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s16 1) (GEQ s54 1)), p2:(AND (NOT (AND (GEQ s47 1) (GEQ s54 1))) (NOT (AND (GEQ s1 1) (GEQ s119 1)))), p1:(AND (GEQ s1 1) (GEQ s119 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 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-04 finished in 716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(X(p0)) U p1))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 176 transition count 303
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 176 transition count 303
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 176 transition count 299
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 160 transition count 278
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 160 transition count 278
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 160 transition count 271
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 149 transition count 256
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 149 transition count 256
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 110 place count 149 transition count 251
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 118 place count 141 transition count 236
Iterating global reduction 3 with 8 rules applied. Total rules applied 126 place count 141 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 129 place count 141 transition count 233
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 134 place count 136 transition count 228
Iterating global reduction 4 with 5 rules applied. Total rules applied 139 place count 136 transition count 228
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 144 place count 136 transition count 223
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 148 place count 132 transition count 202
Iterating global reduction 5 with 4 rules applied. Total rules applied 152 place count 132 transition count 202
Applied a total of 152 rules in 18 ms. Remains 132 /196 variables (removed 64) and now considering 202/392 (removed 190) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-21 22:23:13] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 22:23:13] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 22:23:13] [INFO ] Invariant cache hit.
[2024-05-21 22:23:13] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-21 22:23:13] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-05-21 22:23:13] [INFO ] Invariant cache hit.
[2024-05-21 22:23:13] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/196 places, 202/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 428 ms. Remains : 132/196 places, 202/392 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NOT (AND (GEQ s24 1) (GEQ s113 1))) (AND (GEQ s10 1) (GEQ s104 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 288 ms.
Product exploration explored 100000 steps with 50000 reset in 266 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 486 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-05 finished in 1100 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)) U (F(p1)&&(p2 U p3))))'
Support contains 7 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 177 transition count 315
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 177 transition count 315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 177 transition count 311
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 163 transition count 289
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 163 transition count 289
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 76 place count 163 transition count 283
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 86 place count 153 transition count 270
Iterating global reduction 2 with 10 rules applied. Total rules applied 96 place count 153 transition count 270
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 100 place count 153 transition count 266
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 107 place count 146 transition count 253
Iterating global reduction 3 with 7 rules applied. Total rules applied 114 place count 146 transition count 253
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 118 place count 146 transition count 249
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 123 place count 141 transition count 244
Iterating global reduction 4 with 5 rules applied. Total rules applied 128 place count 141 transition count 244
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 135 place count 141 transition count 237
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 142 place count 134 transition count 196
Iterating global reduction 5 with 7 rules applied. Total rules applied 149 place count 134 transition count 196
Applied a total of 149 rules in 25 ms. Remains 134 /196 variables (removed 62) and now considering 196/392 (removed 196) transitions.
// Phase 1: matrix 196 rows 134 cols
[2024-05-21 22:23:14] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 22:23:14] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 22:23:14] [INFO ] Invariant cache hit.
[2024-05-21 22:23:14] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 22:23:14] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-05-21 22:23:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 22:23:14] [INFO ] Invariant cache hit.
[2024-05-21 22:23:14] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/196 places, 196/392 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 433 ms. Remains : 134/196 places, 196/392 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p3) (NOT p1)), (NOT p0), (NOT p1), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s50 1) (GEQ s56 1)), p2:(AND (GEQ s1 1) (GEQ s122 1)), p1:(AND (GEQ s8 1) (GEQ s98 1)), p0:(AND (GEQ s1 1) (GEQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-06 finished in 643 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))||G(F(G(X(G(p1)))))) U p2))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 177 transition count 315
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 177 transition count 315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 177 transition count 311
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 163 transition count 289
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 163 transition count 289
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 75 place count 163 transition count 284
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 85 place count 153 transition count 271
Iterating global reduction 2 with 10 rules applied. Total rules applied 95 place count 153 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 99 place count 153 transition count 267
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 106 place count 146 transition count 254
Iterating global reduction 3 with 7 rules applied. Total rules applied 113 place count 146 transition count 254
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 117 place count 146 transition count 250
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 122 place count 141 transition count 245
Iterating global reduction 4 with 5 rules applied. Total rules applied 127 place count 141 transition count 245
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 134 place count 141 transition count 238
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 141 place count 134 transition count 197
Iterating global reduction 5 with 7 rules applied. Total rules applied 148 place count 134 transition count 197
Applied a total of 148 rules in 14 ms. Remains 134 /196 variables (removed 62) and now considering 197/392 (removed 195) transitions.
// Phase 1: matrix 197 rows 134 cols
[2024-05-21 22:23:14] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:23:14] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 22:23:14] [INFO ] Invariant cache hit.
[2024-05-21 22:23:14] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 22:23:15] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-21 22:23:15] [INFO ] Invariant cache hit.
[2024-05-21 22:23:15] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/196 places, 197/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 412 ms. Remains : 134/196 places, 197/392 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s48 1) (GEQ s56 1)), p0:(AND (GEQ s1 1) (GEQ s122 1)), p1:(AND (GEQ s1 1) (GEQ s127 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 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-07 finished in 604 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(p1)||p0)))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 178 transition count 315
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 178 transition count 315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 178 transition count 311
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 54 place count 164 transition count 289
Iterating global reduction 1 with 14 rules applied. Total rules applied 68 place count 164 transition count 289
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 74 place count 164 transition count 283
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 84 place count 154 transition count 271
Iterating global reduction 2 with 10 rules applied. Total rules applied 94 place count 154 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 98 place count 154 transition count 267
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 105 place count 147 transition count 253
Iterating global reduction 3 with 7 rules applied. Total rules applied 112 place count 147 transition count 253
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 121 place count 147 transition count 244
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 125 place count 143 transition count 240
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 143 transition count 240
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 136 place count 143 transition count 233
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 143 place count 136 transition count 192
Iterating global reduction 5 with 7 rules applied. Total rules applied 150 place count 136 transition count 192
Applied a total of 150 rules in 16 ms. Remains 136 /196 variables (removed 60) and now considering 192/392 (removed 200) transitions.
// Phase 1: matrix 192 rows 136 cols
[2024-05-21 22:23:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:23:15] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 22:23:15] [INFO ] Invariant cache hit.
[2024-05-21 22:23:15] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 22:23:15] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-05-21 22:23:15] [INFO ] Invariant cache hit.
[2024-05-21 22:23:15] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/196 places, 192/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 413 ms. Remains : 136/196 places, 192/392 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s129 1)), p0:(OR (LT s1 1) (LT s121 1) (AND (GEQ s1 1) (GEQ s130 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 227 ms.
Product exploration explored 100000 steps with 50000 reset in 230 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 490 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-10 finished in 1036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||F((p1&&F(p2))))))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 177 transition count 304
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 177 transition count 304
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 177 transition count 300
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 57 place count 162 transition count 278
Iterating global reduction 1 with 15 rules applied. Total rules applied 72 place count 162 transition count 278
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 162 transition count 272
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 151 transition count 257
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 151 transition count 257
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 104 place count 151 transition count 253
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 113 place count 142 transition count 237
Iterating global reduction 3 with 9 rules applied. Total rules applied 122 place count 142 transition count 237
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 125 place count 142 transition count 234
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 131 place count 136 transition count 228
Iterating global reduction 4 with 6 rules applied. Total rules applied 137 place count 136 transition count 228
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 145 place count 136 transition count 220
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 149 place count 132 transition count 199
Iterating global reduction 5 with 4 rules applied. Total rules applied 153 place count 132 transition count 199
Applied a total of 153 rules in 26 ms. Remains 132 /196 variables (removed 64) and now considering 199/392 (removed 193) transitions.
// Phase 1: matrix 199 rows 132 cols
[2024-05-21 22:23:16] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 22:23:16] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 22:23:16] [INFO ] Invariant cache hit.
[2024-05-21 22:23:16] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-21 22:23:16] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-21 22:23:16] [INFO ] Invariant cache hit.
[2024-05-21 22:23:16] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/196 places, 199/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 427 ms. Remains : 132/196 places, 199/392 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (LT s1 1) (LT s90 1)), p0:(OR (LT s8 1) (LT s54 1)), p1:(OR (LT s1 1) (LT s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 484 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-11 finished in 1177 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((X(p1)&&F((F(p3)&&p2))))||p0)))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 178 transition count 306
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 178 transition count 306
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 52 place count 162 transition count 285
Iterating global reduction 0 with 16 rules applied. Total rules applied 68 place count 162 transition count 285
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 75 place count 162 transition count 278
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 86 place count 151 transition count 263
Iterating global reduction 1 with 11 rules applied. Total rules applied 97 place count 151 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 102 place count 151 transition count 258
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 110 place count 143 transition count 243
Iterating global reduction 2 with 8 rules applied. Total rules applied 118 place count 143 transition count 243
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 143 transition count 240
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 126 place count 138 transition count 235
Iterating global reduction 3 with 5 rules applied. Total rules applied 131 place count 138 transition count 235
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 136 place count 138 transition count 230
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 137 transition count 229
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 137 transition count 229
Applied a total of 138 rules in 18 ms. Remains 137 /196 variables (removed 59) and now considering 229/392 (removed 163) transitions.
// Phase 1: matrix 229 rows 137 cols
[2024-05-21 22:23:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 22:23:17] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 22:23:17] [INFO ] Invariant cache hit.
[2024-05-21 22:23:17] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-21 22:23:18] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-05-21 22:23:18] [INFO ] Invariant cache hit.
[2024-05-21 22:23:18] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 137/196 places, 229/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 528 ms. Remains : 137/196 places, 229/392 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-12 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)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s72 1)), p2:(AND (GEQ s1 1) (GEQ s71 1)), p3:(AND (GEQ s26 1) (GEQ s116 1)), p1:(AND (GEQ s1 1) (GEQ s71 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Computed a total of 5 stabilizing places and 21 stable transitions
Graph (complete) has 517 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 18 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-12 finished in 1377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (X((p0||G(!p1)))||G(!p0))))))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 176 transition count 303
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 176 transition count 303
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 176 transition count 299
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 160 transition count 276
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 160 transition count 276
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 82 place count 160 transition count 270
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 148 transition count 254
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 148 transition count 254
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 111 place count 148 transition count 249
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 119 place count 140 transition count 234
Iterating global reduction 3 with 8 rules applied. Total rules applied 127 place count 140 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 130 place count 140 transition count 231
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 135 place count 135 transition count 226
Iterating global reduction 4 with 5 rules applied. Total rules applied 140 place count 135 transition count 226
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 147 place count 135 transition count 219
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 154 place count 128 transition count 178
Iterating global reduction 5 with 7 rules applied. Total rules applied 161 place count 128 transition count 178
Applied a total of 161 rules in 16 ms. Remains 128 /196 variables (removed 68) and now considering 178/392 (removed 214) transitions.
// Phase 1: matrix 178 rows 128 cols
[2024-05-21 22:23:18] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:23:19] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 22:23:19] [INFO ] Invariant cache hit.
[2024-05-21 22:23:19] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 22:23:19] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2024-05-21 22:23:19] [INFO ] Invariant cache hit.
[2024-05-21 22:23:19] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/196 places, 178/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 395 ms. Remains : 128/196 places, 178/392 transitions.
Stuttering acceptance computed with spot in 193 ms :[p0, p0, false, false, false]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s111 1)), p1:(AND (GEQ s45 1) (GEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 37312 reset in 180 ms.
Product exploration explored 100000 steps with 37404 reset in 186 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[p0, p0, false, false, false]
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 944 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 443 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 22:23:20] [INFO ] Invariant cache hit.
[2024-05-21 22:23:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 22:23:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 22:23:20] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-21 22:23:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 22:23:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 22:23:20] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-21 22:23:20] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 22:23:20] [INFO ] After 23ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-21 22:23:20] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-21 22:23:20] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 8 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 127/128 places, 175/178 transitions.
Incomplete random walk after 10000 steps, including 2265 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 941 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21097 steps, run visited all 1 properties in 36 ms. (steps per millisecond=586 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 37 ms. (steps per millisecond=570 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 176 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 192 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 22:23:21] [INFO ] Invariant cache hit.
[2024-05-21 22:23:21] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 22:23:21] [INFO ] Invariant cache hit.
[2024-05-21 22:23:21] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 22:23:21] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-21 22:23:21] [INFO ] Invariant cache hit.
[2024-05-21 22:23:21] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 128/128 places, 178/178 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 999 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 22:23:22] [INFO ] Invariant cache hit.
[2024-05-21 22:23:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 22:23:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 22:23:22] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 22:23:22] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 22:23:22] [INFO ] After 12ms SMT Verify possible using 54 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 22:23:22] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 22:23:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-21 22:23:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 22:23:22] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 22:23:22] [INFO ] After 13ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 22:23:22] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-21 22:23:22] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 5 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 127/128 places, 175/178 transitions.
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 977 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21097 steps, run visited all 1 properties in 36 ms. (steps per millisecond=586 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 37 ms. (steps per millisecond=570 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1)]
Knowledge based reduction with 5 factoid took 144 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 195 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 259 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 37397 reset in 181 ms.
Product exploration explored 100000 steps with 37303 reset in 184 ms.
Built C files in :
/tmp/ltsmin1906128831540811647
[2024-05-21 22:23:23] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1906128831540811647
Running compilation step : cd /tmp/ltsmin1906128831540811647;'/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 301 ms.
Running link step : cd /tmp/ltsmin1906128831540811647;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1906128831540811647;'/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/stateBased7728504732041284498.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 22:23:38] [INFO ] Invariant cache hit.
[2024-05-21 22:23:38] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 22:23:38] [INFO ] Invariant cache hit.
[2024-05-21 22:23:38] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 22:23:39] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-21 22:23:39] [INFO ] Invariant cache hit.
[2024-05-21 22:23:39] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 128/128 places, 178/178 transitions.
Built C files in :
/tmp/ltsmin9271987466752464301
[2024-05-21 22:23:39] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9271987466752464301
Running compilation step : cd /tmp/ltsmin9271987466752464301;'/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 289 ms.
Running link step : cd /tmp/ltsmin9271987466752464301;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9271987466752464301;'/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/stateBased1923768386971965135.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:23:54] [INFO ] Flatten gal took : 8 ms
[2024-05-21 22:23:54] [INFO ] Flatten gal took : 6 ms
[2024-05-21 22:23:54] [INFO ] Time to serialize gal into /tmp/LTL8426627618837333074.gal : 1 ms
[2024-05-21 22:23:54] [INFO ] Time to serialize properties into /tmp/LTL18063775432862661951.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/LTL8426627618837333074.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5140695479434282529.hoa' '-atoms' '/tmp/LTL18063775432862661951.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/LTL18063775432862661951.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5140695479434282529.hoa
Detected timeout of ITS tools.
[2024-05-21 22:24:09] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:24:09] [INFO ] Flatten gal took : 6 ms
[2024-05-21 22:24:09] [INFO ] Time to serialize gal into /tmp/LTL11708253866740346606.gal : 1 ms
[2024-05-21 22:24:09] [INFO ] Time to serialize properties into /tmp/LTL14610570909018619677.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/LTL11708253866740346606.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14610570909018619677.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(F((X((!("((s1>=1)&&(l3659>=1))"))U((X(("((s1>=1)&&(l3659>=1))")||(G(!("((p362>=1)&&(l2273>=1))")))))||(G(!("((s1>=1)&&(l3659>=1))...191
Formula 0 simplified : FG(!"((s1<1)||(l3659<1))" | X("((s1>=1)&&(l3659>=1))" M X(!"((s1>=1)&&(l3659>=1))" & F"((p362>=1)&&(l2273>=1))")))
Detected timeout of ITS tools.
[2024-05-21 22:24:24] [INFO ] Flatten gal took : 6 ms
[2024-05-21 22:24:24] [INFO ] Applying decomposition
[2024-05-21 22:24:24] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph715120648084431266.txt' '-o' '/tmp/graph715120648084431266.bin' '-w' '/tmp/graph715120648084431266.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph715120648084431266.bin' '-l' '-1' '-v' '-w' '/tmp/graph715120648084431266.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:24:24] [INFO ] Decomposing Gal with order
[2024-05-21 22:24:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:24:24] [INFO ] Removed a total of 196 redundant transitions.
[2024-05-21 22:24:24] [INFO ] Flatten gal took : 17 ms
[2024-05-21 22:24:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 5 ms.
[2024-05-21 22:24:24] [INFO ] Time to serialize gal into /tmp/LTL2634602332980284727.gal : 3 ms
[2024-05-21 22:24:24] [INFO ] Time to serialize properties into /tmp/LTL5630074232769024219.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/LTL2634602332980284727.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5630074232769024219.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((i6.u0.s1>=1)&&(i6.u16.l3659>=1))"))U((X(("((i6.u0.s1>=1)&&(i6.u16.l3659>=1))")||(G(!("((i6.u16.p362>=1)&&(i8.u19.l2273...257
Formula 0 simplified : FG(!"((i6.u0.s1<1)||(i6.u16.l3659<1))" | X("((i6.u0.s1>=1)&&(i6.u16.l3659>=1))" M X(!"((i6.u0.s1>=1)&&(i6.u16.l3659>=1))" & F"((i6.u...190
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5540324441828085137
[2024-05-21 22:24:39] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5540324441828085137
Running compilation step : cd /tmp/ltsmin5540324441828085137;'/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 285 ms.
Running link step : cd /tmp/ltsmin5540324441828085137;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5540324441828085137;'/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) U (X(((LTLAPp0==true)||[](!(LTLAPp1==true))))||[](!(LTLAPp0==true)))))&&!(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-13 finished in 95744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(p1)))))'
Support contains 3 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 176 transition count 309
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 176 transition count 309
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 176 transition count 305
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 160 transition count 281
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 160 transition count 281
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 160 transition count 274
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 149 transition count 259
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 149 transition count 259
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 110 place count 149 transition count 254
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 117 place count 142 transition count 244
Iterating global reduction 3 with 7 rules applied. Total rules applied 124 place count 142 transition count 244
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 127 place count 142 transition count 241
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 131 place count 138 transition count 237
Iterating global reduction 4 with 4 rules applied. Total rules applied 135 place count 138 transition count 237
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 142 place count 138 transition count 230
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 148 place count 132 transition count 190
Iterating global reduction 5 with 6 rules applied. Total rules applied 154 place count 132 transition count 190
Applied a total of 154 rules in 25 ms. Remains 132 /196 variables (removed 64) and now considering 190/392 (removed 202) transitions.
// Phase 1: matrix 190 rows 132 cols
[2024-05-21 22:24:54] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 22:24:54] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 22:24:54] [INFO ] Invariant cache hit.
[2024-05-21 22:24:54] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 22:24:55] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-21 22:24:55] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 22:24:55] [INFO ] Invariant cache hit.
[2024-05-21 22:24:55] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/196 places, 190/392 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 423 ms. Remains : 132/196 places, 190/392 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s126 1)), p1:(AND (GEQ s1 1) (GEQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23051 reset in 151 ms.
Product exploration explored 100000 steps with 22961 reset in 153 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 479 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2303 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1698 steps, run visited all 1 properties in 9 ms. (steps per millisecond=188 )
Probabilistic random walk after 1698 steps, saw 899 distinct states, run finished after 9 ms. (steps per millisecond=188 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 190/190 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-21 22:24:55] [INFO ] Invariant cache hit.
[2024-05-21 22:24:56] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 22:24:56] [INFO ] Invariant cache hit.
[2024-05-21 22:24:56] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 22:24:56] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-05-21 22:24:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 22:24:56] [INFO ] Invariant cache hit.
[2024-05-21 22:24:56] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 407 ms. Remains : 132/132 places, 190/190 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 479 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 429 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1698 steps, run visited all 1 properties in 10 ms. (steps per millisecond=169 )
Probabilistic random walk after 1698 steps, saw 899 distinct states, run finished after 10 ms. (steps per millisecond=169 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 23132 reset in 154 ms.
Product exploration explored 100000 steps with 23060 reset in 158 ms.
Built C files in :
/tmp/ltsmin1611052636386660727
[2024-05-21 22:24:57] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2024-05-21 22:24:57] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:24:57] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2024-05-21 22:24:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:24:57] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2024-05-21 22:24:57] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:24:57] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1611052636386660727
Running compilation step : cd /tmp/ltsmin1611052636386660727;'/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 395 ms.
Running link step : cd /tmp/ltsmin1611052636386660727;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1611052636386660727;'/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/stateBased13940867423957373080.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 190/190 transitions.
Applied a total of 0 rules in 9 ms. Remains 132 /132 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-21 22:25:12] [INFO ] Invariant cache hit.
[2024-05-21 22:25:12] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 22:25:12] [INFO ] Invariant cache hit.
[2024-05-21 22:25:12] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 22:25:12] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-21 22:25:12] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 22:25:12] [INFO ] Invariant cache hit.
[2024-05-21 22:25:12] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 441 ms. Remains : 132/132 places, 190/190 transitions.
Built C files in :
/tmp/ltsmin6177709277083997062
[2024-05-21 22:25:12] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2024-05-21 22:25:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:25:12] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2024-05-21 22:25:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:25:12] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2024-05-21 22:25:12] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:25:12] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6177709277083997062
Running compilation step : cd /tmp/ltsmin6177709277083997062;'/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 385 ms.
Running link step : cd /tmp/ltsmin6177709277083997062;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6177709277083997062;'/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/stateBased7073010476478355045.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:25:27] [INFO ] Flatten gal took : 19 ms
[2024-05-21 22:25:27] [INFO ] Flatten gal took : 6 ms
[2024-05-21 22:25:27] [INFO ] Time to serialize gal into /tmp/LTL12184443225344938262.gal : 2 ms
[2024-05-21 22:25:27] [INFO ] Time to serialize properties into /tmp/LTL9990100028818176552.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/LTL12184443225344938262.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5418707106930984029.hoa' '-atoms' '/tmp/LTL9990100028818176552.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/LTL9990100028818176552.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5418707106930984029.hoa
Detected timeout of ITS tools.
[2024-05-21 22:25:42] [INFO ] Flatten gal took : 5 ms
[2024-05-21 22:25:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 22:25:42] [INFO ] Time to serialize gal into /tmp/LTL5439112004876236982.gal : 1 ms
[2024-05-21 22:25:42] [INFO ] Time to serialize properties into /tmp/LTL10875270438184581677.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/LTL5439112004876236982.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10875270438184581677.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1<1)||(l4129<1))"))||(X(F("((s1>=1)&&(l3657>=1))"))))))
Formula 0 simplified : F(G!"((s1<1)||(l4129<1))" & XG!"((s1>=1)&&(l3657>=1))")
Detected timeout of ITS tools.
[2024-05-21 22:25:58] [INFO ] Flatten gal took : 5 ms
[2024-05-21 22:25:58] [INFO ] Applying decomposition
[2024-05-21 22:25:58] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph768478231817181653.txt' '-o' '/tmp/graph768478231817181653.bin' '-w' '/tmp/graph768478231817181653.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph768478231817181653.bin' '-l' '-1' '-v' '-w' '/tmp/graph768478231817181653.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:25:58] [INFO ] Decomposing Gal with order
[2024-05-21 22:25:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:25:58] [INFO ] Removed a total of 215 redundant transitions.
[2024-05-21 22:25:58] [INFO ] Flatten gal took : 15 ms
[2024-05-21 22:25:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 12 ms.
[2024-05-21 22:25:58] [INFO ] Time to serialize gal into /tmp/LTL13509223785434870461.gal : 2 ms
[2024-05-21 22:25:58] [INFO ] Time to serialize properties into /tmp/LTL5817527867861677909.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/LTL13509223785434870461.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5817527867861677909.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("((i0.u0.s1<1)||(i5.u20.l4129<1))"))||(X(F("((i0.u0.s1>=1)&&(i0.u15.l3657>=1))"))))))
Formula 0 simplified : F(G!"((i0.u0.s1<1)||(i5.u20.l4129<1))" & XG!"((i0.u0.s1>=1)&&(i0.u15.l3657>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin65882659577930295
[2024-05-21 22:26:13] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin65882659577930295
Running compilation step : cd /tmp/ltsmin65882659577930295;'/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 306 ms.
Running link step : cd /tmp/ltsmin65882659577930295;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin65882659577930295;'/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(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-14 finished in 93609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||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' '!(G(F((G(F(p1))||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' '!(G(F((!p0&&X((!p0 U (X((p0||G(!p1)))||G(!p0))))))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d2m10-LTLFireability-13
Stuttering acceptance computed with spot in 178 ms :[p0, p0, false, false, false]
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 176 transition count 303
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 176 transition count 303
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 176 transition count 299
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 160 transition count 276
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 160 transition count 276
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 82 place count 160 transition count 270
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 148 transition count 254
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 148 transition count 254
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 111 place count 148 transition count 249
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 119 place count 140 transition count 234
Iterating global reduction 3 with 8 rules applied. Total rules applied 127 place count 140 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 130 place count 140 transition count 231
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 135 place count 135 transition count 226
Iterating global reduction 4 with 5 rules applied. Total rules applied 140 place count 135 transition count 226
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 147 place count 135 transition count 219
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 154 place count 128 transition count 178
Iterating global reduction 5 with 7 rules applied. Total rules applied 161 place count 128 transition count 178
Applied a total of 161 rules in 20 ms. Remains 128 /196 variables (removed 68) and now considering 178/392 (removed 214) transitions.
// Phase 1: matrix 178 rows 128 cols
[2024-05-21 22:26:28] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 22:26:28] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 22:26:28] [INFO ] Invariant cache hit.
[2024-05-21 22:26:28] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 22:26:29] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-21 22:26:29] [INFO ] Invariant cache hit.
[2024-05-21 22:26:29] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 128/196 places, 178/392 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 468 ms. Remains : 128/196 places, 178/392 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s111 1)), p1:(AND (GEQ s45 1) (GEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 37483 reset in 176 ms.
Product exploration explored 100000 steps with 37367 reset in 184 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[p0, p0, false, false, false]
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 941 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 22:26:30] [INFO ] Invariant cache hit.
[2024-05-21 22:26:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 22:26:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 22:26:30] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-21 22:26:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 22:26:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 22:26:30] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-21 22:26:30] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 22:26:30] [INFO ] After 29ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-21 22:26:30] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-21 22:26:30] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 7 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 127/128 places, 175/178 transitions.
Incomplete random walk after 10000 steps, including 2316 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 932 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21097 steps, run visited all 1 properties in 34 ms. (steps per millisecond=620 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 34 ms. (steps per millisecond=620 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 213 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 183 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 22:26:30] [INFO ] Invariant cache hit.
[2024-05-21 22:26:31] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 22:26:31] [INFO ] Invariant cache hit.
[2024-05-21 22:26:31] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 22:26:31] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-05-21 22:26:31] [INFO ] Invariant cache hit.
[2024-05-21 22:26:31] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 400 ms. Remains : 128/128 places, 178/178 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 22:26:31] [INFO ] Invariant cache hit.
[2024-05-21 22:26:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 22:26:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 22:26:31] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 22:26:31] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 22:26:31] [INFO ] After 12ms SMT Verify possible using 54 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 22:26:31] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 22:26:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 22:26:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 22:26:31] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 22:26:32] [INFO ] After 13ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 22:26:32] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-21 22:26:32] [INFO ] After 118ms 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 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 5 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 127/128 places, 175/178 transitions.
Incomplete random walk after 10000 steps, including 2281 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21097 steps, run visited all 1 properties in 42 ms. (steps per millisecond=502 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 42 ms. (steps per millisecond=502 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1)]
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 205 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 186 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 37304 reset in 174 ms.
Product exploration explored 100000 steps with 37238 reset in 185 ms.
Built C files in :
/tmp/ltsmin855749401923842981
[2024-05-21 22:26:33] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin855749401923842981
Running compilation step : cd /tmp/ltsmin855749401923842981;'/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 283 ms.
Running link step : cd /tmp/ltsmin855749401923842981;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin855749401923842981;'/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/stateBased12183559190589771192.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 22:26:48] [INFO ] Invariant cache hit.
[2024-05-21 22:26:48] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 22:26:48] [INFO ] Invariant cache hit.
[2024-05-21 22:26:48] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 22:26:48] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-21 22:26:48] [INFO ] Invariant cache hit.
[2024-05-21 22:26:48] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 423 ms. Remains : 128/128 places, 178/178 transitions.
Built C files in :
/tmp/ltsmin5572370905116407241
[2024-05-21 22:26:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5572370905116407241
Running compilation step : cd /tmp/ltsmin5572370905116407241;'/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 283 ms.
Running link step : cd /tmp/ltsmin5572370905116407241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5572370905116407241;'/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/stateBased12415699791693536616.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:27:03] [INFO ] Flatten gal took : 6 ms
[2024-05-21 22:27:04] [INFO ] Flatten gal took : 11 ms
[2024-05-21 22:27:04] [INFO ] Time to serialize gal into /tmp/LTL2806885614477767144.gal : 1 ms
[2024-05-21 22:27:04] [INFO ] Time to serialize properties into /tmp/LTL635852436129854133.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/LTL2806885614477767144.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9191846890884206737.hoa' '-atoms' '/tmp/LTL635852436129854133.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...316
Loading property file /tmp/LTL635852436129854133.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9191846890884206737.hoa
Detected timeout of ITS tools.
[2024-05-21 22:27:19] [INFO ] Flatten gal took : 5 ms
[2024-05-21 22:27:19] [INFO ] Flatten gal took : 6 ms
[2024-05-21 22:27:19] [INFO ] Time to serialize gal into /tmp/LTL9428882578508418330.gal : 2 ms
[2024-05-21 22:27:19] [INFO ] Time to serialize properties into /tmp/LTL16933544767131654727.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/LTL9428882578508418330.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16933544767131654727.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((s1>=1)&&(l3659>=1))"))U((X(("((s1>=1)&&(l3659>=1))")||(G(!("((p362>=1)&&(l2273>=1))")))))||(G(!("((s1>=1)&&(l3659>=1))...191
Formula 0 simplified : FG(!"((s1<1)||(l3659<1))" | X("((s1>=1)&&(l3659>=1))" M X(!"((s1>=1)&&(l3659>=1))" & F"((p362>=1)&&(l2273>=1))")))
Detected timeout of ITS tools.
[2024-05-21 22:27:34] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:27:34] [INFO ] Applying decomposition
[2024-05-21 22:27:34] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3760988783143479130.txt' '-o' '/tmp/graph3760988783143479130.bin' '-w' '/tmp/graph3760988783143479130.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3760988783143479130.bin' '-l' '-1' '-v' '-w' '/tmp/graph3760988783143479130.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:27:34] [INFO ] Decomposing Gal with order
[2024-05-21 22:27:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:27:34] [INFO ] Removed a total of 204 redundant transitions.
[2024-05-21 22:27:34] [INFO ] Flatten gal took : 29 ms
[2024-05-21 22:27:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 129 labels/synchronizations in 18 ms.
[2024-05-21 22:27:34] [INFO ] Time to serialize gal into /tmp/LTL8645679638670263589.gal : 2 ms
[2024-05-21 22:27:34] [INFO ] Time to serialize properties into /tmp/LTL2090468113617272974.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/LTL8645679638670263589.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2090468113617272974.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((i4.u0.s1>=1)&&(i4.u16.l3659>=1))"))U((X(("((i4.u0.s1>=1)&&(i4.u16.l3659>=1))")||(G(!("((i4.u16.p362>=1)&&(i2.i1.u21.l2...260
Formula 0 simplified : FG(!"((i4.u0.s1<1)||(i4.u16.l3659<1))" | X("((i4.u0.s1>=1)&&(i4.u16.l3659>=1))" M X(!"((i4.u0.s1>=1)&&(i4.u16.l3659>=1))" & F"((i4.u...193
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7125040989932653313
[2024-05-21 22:27:49] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7125040989932653313
Running compilation step : cd /tmp/ltsmin7125040989932653313;'/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 278 ms.
Running link step : cd /tmp/ltsmin7125040989932653313;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin7125040989932653313;'/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) U (X(((LTLAPp0==true)||[](!(LTLAPp1==true))))||[](!(LTLAPp0==true)))))&&!(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-13 finished in 95938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(p1)))))'
[2024-05-21 22:28:04] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10375463865843853245
[2024-05-21 22:28:04] [INFO ] Computing symmetric may disable matrix : 392 transitions.
[2024-05-21 22:28:04] [INFO ] Applying decomposition
[2024-05-21 22:28:04] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:28:04] [INFO ] Flatten gal took : 26 ms
[2024-05-21 22:28:04] [INFO ] Computing symmetric may enable matrix : 392 transitions.
[2024-05-21 22:28:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph12999822496409628829.txt' '-o' '/tmp/graph12999822496409628829.bin' '-w' '/tmp/graph12999822496409628829.weights'
[2024-05-21 22:28:04] [INFO ] Computing Do-Not-Accords matrix : 392 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12999822496409628829.bin' '-l' '-1' '-v' '-w' '/tmp/graph12999822496409628829.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:28:04] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:28:04] [INFO ] Decomposing Gal with order
[2024-05-21 22:28:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:28:04] [INFO ] Built C files in 138ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10375463865843853245
Running compilation step : cd /tmp/ltsmin10375463865843853245;'/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-21 22:28:04] [INFO ] Removed a total of 375 redundant transitions.
[2024-05-21 22:28:04] [INFO ] Flatten gal took : 38 ms
[2024-05-21 22:28:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 5 ms.
[2024-05-21 22:28:04] [INFO ] Time to serialize gal into /tmp/LTLFireability10656855363707360483.gal : 16 ms
[2024-05-21 22:28:04] [INFO ] Time to serialize properties into /tmp/LTLFireability9139960001057687928.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/LTLFireability10656855363707360483.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9139960001057687928.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 : !((G(F((!("((i1.u0.p213>=1)&&(i2.u2.l0>=1))"))U(("((!((i1.u0.s1>=1)&&(i1.u0.l3083>=1)))&&(!((i1.u0.p213>=1)&&(i2.u2.l0>=1))))")||(G(!(...197
Formula 0 simplified : FG("((i1.u0.p213>=1)&&(i2.u2.l0>=1))" M !"((!((i1.u0.s1>=1)&&(i1.u0.l3083>=1)))&&(!((i1.u0.p213>=1)&&(i2.u2.l0>=1))))")
Compilation finished in 1109 ms.
Running link step : cd /tmp/ltsmin10375463865843853245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10375463865843853245;'/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' '[](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10375463865843853245;'/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' '[](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10375463865843853245;'/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' '[](<>(([](<>((LTLAPp3==true)))||(LTLAPp2==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 22:50:49] [INFO ] Flatten gal took : 32 ms
[2024-05-21 22:50:49] [INFO ] Time to serialize gal into /tmp/LTLFireability2955917819954693405.gal : 5 ms
[2024-05-21 22:50:49] [INFO ] Time to serialize properties into /tmp/LTLFireability13416061861241453620.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/LTLFireability2955917819954693405.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13416061861241453620.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...298
Read 4 LTL properties
Checking formula 0 : !((G(F((!("((p213>=1)&&(l0>=1))"))U(("((!((s1>=1)&&(l3083>=1)))&&(!((p213>=1)&&(l0>=1))))")||(G(!("((p213>=1)&&(l0>=1))"))))))))
Formula 0 simplified : FG("((p213>=1)&&(l0>=1))" M !"((!((s1>=1)&&(l3083>=1)))&&(!((p213>=1)&&(l0>=1))))")
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10375463865843853245;'/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' '[](<>(([](<>((LTLAPp3==true)))||(LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10375463865843853245;'/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' '[](<>((!(LTLAPp4==true)&&X((!(LTLAPp4==true) U (X(((LTLAPp4==true)||[](!(LTLAPp5==true))))||[](!(LTLAPp4==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10375463865843853245;'/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' '[](<>((!(LTLAPp4==true)&&X((!(LTLAPp4==true) U (X(((LTLAPp4==true)||[](!(LTLAPp5==true))))||[](!(LTLAPp4==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10375463865843853245;'/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' '[]((<>((LTLAPp6==true))||X(<>((LTLAPp7==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 23:13:34] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:13:34] [INFO ] Input system was already deterministic with 392 transitions.
[2024-05-21 23:13:34] [INFO ] Transformed 196 places.
[2024-05-21 23:13:34] [INFO ] Transformed 392 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 23:13:34] [INFO ] Time to serialize gal into /tmp/LTLFireability18241260034099620934.gal : 2 ms
[2024-05-21 23:13:34] [INFO ] Time to serialize properties into /tmp/LTLFireability15196499342257483661.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/LTLFireability18241260034099620934.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15196499342257483661.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F((!("((p213>=1)&&(l0>=1))"))U(("((!((s1>=1)&&(l3083>=1)))&&(!((p213>=1)&&(l0>=1))))")||(G(!("((p213>=1)&&(l0>=1))"))))))))
Formula 0 simplified : FG("((p213>=1)&&(l0>=1))" M !"((!((s1>=1)&&(l3083>=1)))&&(!((p213>=1)&&(l0>=1))))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.036: LTL layer: formula: []((<>((LTLAPp6==true))||X(<>((LTLAPp7==true)))))
pins2lts-mc-linux64( 5/ 8), 0.036: "[]((<>((LTLAPp6==true))||X(<>((LTLAPp7==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.037: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.046: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.046: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.069: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.147: DFS-FIFO for weak LTL, using special progress label 401
pins2lts-mc-linux64( 0/ 8), 0.147: There are 402 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.147: State length is 197, there are 395 groups
pins2lts-mc-linux64( 0/ 8), 0.147: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.147: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.147: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.147: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.174: ~1 levels ~960 states ~3064 transitions
pins2lts-mc-linux64( 2/ 8), 0.182: ~1 levels ~1920 states ~5240 transitions
pins2lts-mc-linux64( 2/ 8), 0.225: ~1 levels ~3840 states ~10912 transitions
pins2lts-mc-linux64( 1/ 8), 0.311: ~1 levels ~7680 states ~17032 transitions
pins2lts-mc-linux64( 1/ 8), 0.456: ~1 levels ~15360 states ~41752 transitions
pins2lts-mc-linux64( 3/ 8), 0.730: ~1 levels ~30720 states ~77424 transitions
pins2lts-mc-linux64( 6/ 8), 1.193: ~1 levels ~61440 states ~187712 transitions
pins2lts-mc-linux64( 1/ 8), 1.995: ~4 levels ~122880 states ~301120 transitions
pins2lts-mc-linux64( 0/ 8), 3.387: ~4 levels ~245760 states ~548472 transitions
pins2lts-mc-linux64( 0/ 8), 5.454: ~4 levels ~491520 states ~1179240 transitions
pins2lts-mc-linux64( 0/ 8), 8.840: ~4 levels ~983040 states ~2310712 transitions
pins2lts-mc-linux64( 0/ 8), 15.588: ~5 levels ~1966080 states ~4643880 transitions
pins2lts-mc-linux64( 0/ 8), 29.575: ~5 levels ~3932160 states ~9544672 transitions
pins2lts-mc-linux64( 0/ 8), 56.682: ~5 levels ~7864320 states ~19145512 transitions
pins2lts-mc-linux64( 0/ 8), 111.658: ~5 levels ~15728640 states ~39610680 transitions
pins2lts-mc-linux64( 4/ 8), 233.414: ~7 levels ~31457280 states ~87644224 transitions
pins2lts-mc-linux64( 1/ 8), 346.332: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 346.374:
pins2lts-mc-linux64( 0/ 8), 346.374: mean standard work distribution: 8.7% (states) 10.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 346.374:
pins2lts-mc-linux64( 0/ 8), 346.374: Explored 44326045 states 122708284 transitions, fanout: 2.768
pins2lts-mc-linux64( 0/ 8), 346.374: Total exploration time 346.220 sec (346.180 sec minimum, 346.197 sec on average)
pins2lts-mc-linux64( 0/ 8), 346.374: States per second: 128029, Transitions per second: 354423
pins2lts-mc-linux64( 0/ 8), 346.374:
pins2lts-mc-linux64( 0/ 8), 346.374: Progress states detected: 55393256
pins2lts-mc-linux64( 0/ 8), 346.374: Redundant explorations: -21.3108
pins2lts-mc-linux64( 0/ 8), 346.374:
pins2lts-mc-linux64( 0/ 8), 346.374: Queue width: 8B, total height: 26479924, memory: 202.03MB
pins2lts-mc-linux64( 0/ 8), 346.374: Tree memory: 685.8MB, 12.8 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 346.374: Tree fill ratio (roots/leafs): 41.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 346.374: Stored 395 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 346.374: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 346.374: Est. total memory use: 887.8MB (~1226.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10375463865843853245;'/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' '[]((<>((LTLAPp6==true))||X(<>((LTLAPp7==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10375463865843853245;'/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' '[]((<>((LTLAPp6==true))||X(<>((LTLAPp7==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 12807052 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16040876 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="DBSingleClientW-PT-d2m10"
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 DBSingleClientW-PT-d2m10, 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 r109-tall-171624208400373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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